Fast and Provably Accurate Bilateral Filtering
From MaRDI portal
Abstract: The bilateral filter is a non-linear filter that uses a range filter along with a spatial filter to perform edge-preserving smoothing of images. A direct computation of the bilateral filter requires operations per pixel, where is the size of the support of the spatial filter. In this paper, we present a fast and provably accurate algorithm for approximating the bilateral filter when the range kernel is Gaussian. In particular, for box and Gaussian spatial filters, the proposed algorithm can cut down the complexity to per pixel for any arbitrary . The algorithm has a simple implementation involving spatial filterings, where is the approximation order. We give a detailed analysis of the filtering accuracy that can be achieved by the proposed approximation in relation to the target bilateral filter. This allows us to to estimate the order required to obtain a given accuracy. We also present comprehensive numerical results to demonstrate that the proposed algorithm is competitive with state-of-the-art methods in terms of speed and accuracy.
Cited in
(7)- Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
- Automatic segmentation of ulna and radius in forearm radiographs
- Efficient Beltrami Image Filtering via Vector Extrapolation Methods
- scientific article; zbMATH DE number 1067818 (Why is no real title available?)
- Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels
- Global Color Sparseness and a Local Statistics Prior for Fast Bilateral Filtering
- Fast Bilateral Filtering for Denoising Large 3D Images
This page was built for publication: Fast and Provably Accurate Bilateral Filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4616455)