Fast $O(1)$ Bilateral Filtering Using Trigonometric Range Kernels
- 9 June 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 20 (12), 3376-3382
- https://doi.org/10.1109/tip.2011.2159234
Abstract
It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithms in the image-processing literature. Along with the spatial filter, the edge-preserving bilateral filter involves an additional range kernel. This is used to restrict the averaging to those neighborhood pixels whose intensity are similar or close to that of the pixel of interest. The range kernel operates by acting on the pixel intensities. This makes the averaging process nonlinear and computationally intensive, particularly when the spatial filter is large. In this paper, we show how the O(1) averaging algorithms can be leveraged for realizing the bilateral filter in constant time, by using trigonometric range kernels. This is done by generalizing the idea presented by Porikli, i.e., using polynomial kernels. The class of trigonometric kernels turns out to be sufficiently rich, allowing for the approximation of the standard Gaussian bilateral filter. The attractive feature of our approach is that, for a fixed number of terms, the quality of approximation achieved using trigonometric kernels is much superior to that obtained by Porikli using polynomials.Keywords
Other Versions
This publication has 14 references indexed in Scilit:
- Fast Space-Variant Elliptical Filtering Using Box SplinesIEEE Transactions on Image Processing, 2010
- Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion HandlingIeee Transactions On Pattern Analysis and Machine Intelligence, 2008
- Multispectral Bilateral Video FusionIEEE Transactions on Image Processing, 2007
- Fast median and bilateral filteringPublished by Association for Computing Machinery (ACM) ,2006
- Separable Bilateral Filtering for Fast Video PreprocessingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Review of Image Denoising Algorithms, with a New OneMultiscale Modeling & Simulation, 2005
- Fast bilateral filtering for the display of high-dynamic-range imagesPublished by Association for Computing Machinery (ACM) ,2002
- Recursive implementation of the Gaussian filterSignal Processing, 1995
- Filtering by repeated integrationACM SIGGRAPH Computer Graphics, 1986
- Summed-area tables for texture mappingACM SIGGRAPH Computer Graphics, 1984