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 histogram-based fast bilateral filter approximation that uses uniform box as the domain kernel. Instead of using a single box kernel, multiple box kernels are used and...
Saved in:
Published in | IEEE transactions on image processing Vol. 20; no. 9; pp. 2690 - 2696 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.09.2011
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper, we present a fast implementation of the bilateral filter with arbitrary range and domain kernels. It is based on the histogram-based fast bilateral filter approximation that uses uniform box as the domain kernel. Instead of using a single box kernel, multiple box kernels are used and optimally combined 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. We also derive the optimal kernel size when a single box kernel is used. |
---|---|
Bibliography: | SourceType-Other Sources-1 ObjectType-Article-2 content type line 63 ObjectType-Correspondence-1 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1057-7149 1941-0042 |
DOI: | 10.1109/TIP.2011.2126585 |