ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

FAST AND ACCURATE BILATERAL FILTERING USING GAUSS-POLYNOMIAL DECOMPOSITION

Chaudhury, Kunal N (2015) FAST AND ACCURATE BILATERAL FILTERING USING GAUSS-POLYNOMIAL DECOMPOSITION. In: IEEE International Conference on Image Processing (ICIP), SEP 27-30, 2015, Quebec City, CANADA, pp. 2005-2009.

[img] PDF
ICIP_2005_2015.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: http://arxiv.org/abs/1505.00077

Abstract

The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.

Item Type: Conference Proceedings
Series.: IEEE International Conference on Image Processing ICIP
Publisher: IEEE
Additional Information: Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Keywords: Bilateral filter; approximation; Gauss-polynomial; convolution; fast algorithm
Department/Centre: Division of Electrical Sciences > Electrical Engineering
Date Deposited: 17 May 2016 05:39
Last Modified: 17 May 2016 05:39
URI: http://eprints.iisc.ac.in/id/eprint/53845

Actions (login required)

View Item View Item