Acceleration of the Shiftable $\mbi{O}{(1)}$ Algorithm for Bilateral Filtering and Nonlocal Means
- 5 October 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 22 (4), 1291-1300
- https://doi.org/10.1109/tip.2012.2222903
Abstract
A direct implementation of the bilateral filter requires O (σ s 2 ) operations per pixel, where σ s is the (effective) width of the spatial kernel. A fast implementation of the bilateral filter that required O (1) operations per pixel with respect to σ s was recently proposed. This was done by using trigonometric functions for the range kernel of the bilateral filter, and by exploiting their so-called shiftability property. In particular, a fast implementation of the Gaussian bilateral filter was realized by approximating the Gaussian range kernel using raised cosines. Later, it was demonstrated that this idea could be extended to a larger class of filters, including the popular non-local means filter. As already observed, a flip side of this approach was that the run time depended on the width σ r of the range kernel. For an image with dynamic range [0, T ], the run time scaled as O ( T 2 /σ r 2 ) with σ r . This made it difficult to implement narrow range kernels, particularly for images with large dynamic range. In this paper, we discuss this problem, and propose some simple steps to accelerate the implementation, in general, and for small σ r in particular. We provide some experimental results to demonstrate the acceleration that is achieved using these modifications.Keywords
Other Versions
This publication has 21 references indexed in Scilit:
- Constant-Time Filtering Using Shiftable KernelsIEEE Signal Processing Letters, 2011
- Fast Bilateral Filter With Arbitrary Range and Domain KernelsIEEE Transactions on Image Processing, 2011
- Fast High‐Dimensional Filtering Using the Permutohedral LatticeComputer Graphics Forum, 2010
- Multispectral Bilateral Video FusionIEEE Transactions on Image Processing, 2007
- Fast median and bilateral filteringPublished by Association for Computing Machinery (ACM) ,2006
- Real-time video abstractionPublished by Association for Computing Machinery (ACM) ,2006
- Adaptive demosaickingJournal of Electronic Imaging, 2003
- Fast bilateral filtering for the display of high-dynamic-range imagesPublished by Association for Computing Machinery (ACM) ,2002
- Filtering by repeated integrationPublished by Association for Computing Machinery (ACM) ,1986
- Summed-area tables for texture mappingACM SIGGRAPH Computer Graphics, 1984