We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Constant-time bilateral filter using spectral decomposition.

Sugimoto, K. and Breckon, T.P. and Kamata, S. (2016) 'Constant-time bilateral filter using spectral decomposition.', in 2016 IEEE International Conference on Image Processing (ICIP), September 25-28, 2016, Phoenix, Arizona, USA ; proceedings. Piscataway, NJ: IEEE, pp. 3319-3323.


This paper presents an efficient constant-time bilateral filter where constant-time means that computational complexity is independent of filter window size. Many state-of-the-art constant-time methods approximate the original bilateral filter by an appropriate combination of a series of convolutions. It is important for this framework to optimize the performance tradeoff between approximate accuracy and the number of convolutions. The proposed method achieves the optimal performance tradeoff in a least-squares manner by using spectral decomposition under the assumption that images consist of discrete intensities such as 8-bit images. This approach is essentially applicable to arbitrary range kernel. Experiments show that the proposed method outperforms state-of-the-art methods in terms of both computational complexity and approximate accuracy.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Date accepted:12 July 2016
Date deposited:06 October 2016
Date of first online publication:19 August 2016
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar