Fast and Provably Accurate Bilateral Filtering

Chaudhury, Kunal N and Dabhade, Swapnil Deelip (2016) Fast and Provably Accurate Bilateral Filtering. In: IEEE TRANSACTIONS ON IMAGE PROCESSING, 25 (6). pp. 2519-2528.

PDF IEEE_Tra_Img_Pro_25-6_2519_2016.pdf - Published Version Restricted to Registered users only Download (4MB) | Request a copy

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 O(S) operations per pixel, where S 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 O(1) per pixel for any arbitrary S. The algorithm has a simple implementation involving N + 1 spatial filterings, where N 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 estimate the order N required to obtain a given accuracy. We also present comprehensive numerical results to demonstrate that the proposed algorithm is competitive with the state-of-the-art methods in terms of speed and accuracy.

Item Type:	Journal Article
Publication:	IEEE TRANSACTIONS ON IMAGE PROCESSING
Publisher:	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Additional Information:	Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
Keywords:	Edge-preserving smoothing; bilateral filter; kernel; approximation; fast algorithm; error analysis; bounds
Department/Centre:	Division of Electrical Sciences > Electrical Engineering
Date Deposited:	10 Jun 2016 05:57
Last Modified:	05 Mar 2019 05:30
URI:	http://eprints.iisc.ac.in/id/eprint/53866

Actions (login required)

View Item