EPFL
 Biomedical Imaging GroupSTI
EPFL
  Publications
English only   BIG > Publications > Bilateral Filtering


 CONTENTS
 Home Page
 News & Events
 People
 Publications
 Tutorials and Reviews
 Research
 Demos
 Download Algorithms

 DOWNLOAD
 PDF
 Postscript
 All BibTeX References

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

K.N. Chaudhury, D. Sage, M. Unser

IEEE Transactions on Image Processing, vol. 20, no. 12, pp. 3376-3382, December 2011.



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.


@ARTICLE(http://bigwww.epfl.ch/publications/chaudhury1103.html,
AUTHOR="Chaudhury, K.N. and Sage, D. and Unser, M.",
TITLE="Fast ${\mathcal{O}}(1)$ Bilateral Filtering Using Trigonometric
        Range Kernels",
JOURNAL="{IEEE} Transactions on Image Processing",
YEAR="2011",
volume="20",
number="12",
pages="3376--3382",
month="December",
note="")

© 2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.