Fast bilateral filter with arbitrary range and domain kernels

In this paper, we present a fast implementation of the bilateral filter with arbitrary range and domain kernels. It is based on the fast bilateral filter approximation that uses uniform box domain kernel. Instead of using a single box kernel, multiple box kernels are used and combined optimally to a...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Image Processing pp. 3289 - 3292
Main Author Gunturk, B
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2010
Subjects
Approximation methods
Bilateral filter
Computer vision
Equations
Histograms
Image processing
Kernel
Pixel
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a fast implementation of the bilateral filter with arbitrary range and domain kernels. It is based on the fast bilateral filter approximation that uses uniform box domain kernel. Instead of using a single box kernel, multiple box kernels are used and combined optimally to approximate an arbitrary domain kernel. The method achieves better approximation of the bilateral filter compared to the single box kernel version with little increase in computational complexity.
ISBN:9781424479924
1424479924
ISSN:1522-4880
2381-8549
DOI:10.1109/ICIP.2010.5650955