Fast Gauss Bilateral Filtering

Simple item page
dc.contributor.authorYoshizawa, Shinen_US
dc.contributor.authorBelyaev, Alexanderen_US
dc.contributor.authorYokota, Hideoen_US
dc.date.accessioned2015-02-23T09:36:17Z
dc.date.available2015-02-23T09:36:17Z
dc.date.issued2010en_US
dc.description.abstractIn spite of high computational complexity, the bilateral filter and its modifications and extensions have recently become very popular image and shape processing tools. In this paper, we propose a fast and accurate approximation of the bilateral filter. Our approach combines a dimension elevation trick with a Fast Gauss Transform. First we represent the bilateral filter as a convolution in a high dimensional space. Then the convolution is efficiently approximated by using space partitioning and Gaussian function expansions. Advantages of our approach include linear computational complexity, user-specified precision, and an ability to process high dimensional and non-uniformly sampled data. We demonstrate capabilities of the approach by considering its applications to the image and volume denoising and high-dynamic-range tone mapping problems.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01544.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages60-74en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01544.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleFast Gauss Bilateral Filteringen_US
Files
Collections
29-Issue 1