Optimized Fourier Bilateral Filtering

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 ran...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2018-10, Vol.25 (10), p.1555-1559
Main Authors: Ghosh, Sanjay, Nair, Pravin, Chaudhury, Kunal N.
Format: Article
Language:English
Subjects:
Accuracy
Approximation
Approximation algorithms
Approximation error
Bilateral filter
fast approximation
Filtration
Fourier basis
Fourier series
Kernel
Matlab
Optimization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 be 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.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2018.2866949