Journal
IEEE SIGNAL PROCESSING LETTERS
Volume 25, Issue 10, Pages 1555-1559Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LSP.2018.2866949
Keywords
Bilateral filter; fast approximation; Fourier basis
Categories
Funding
- EMR Grant from the Department of Science and Technology, Government of India [SERB/F/6047/2016-2017]
Ask authors/readers for more resources
We consider the problem of approximating a truncated Gaussian kernel using Fourier (trigonometric) functions. The computation-intensive bilateral filter can be expressed using fast convolutions by applying such an approximation to its range kernel, where the truncation in question is the dynamic range of the input image. The error from such an approximation depends on the period, the number of sinusoids, and the coefficient of each sinusoid. For a fixed period, we recently proposed a model for optimizing the coefficients using least squares fitting. Following the compressive bilateral filter (CBF), we demonstrate that the approximation can he improved by taking the period into account during the optimization. The accuracy of the resulting filtering is found to be at least as good as the CBF, but significantly better for certain cases. The proposed approximation can also be used for non-Gaussian kernels, and it comes with guarantees on the filtering accuracy.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available