Constant-time bilateral filter using spectral decomposition

Kenjiro Sugimoto, Toby Breckon, Sei Ichiro Kamata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)


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.

Original languageEnglish
Title of host publication2016 IEEE International Conference on Image Processing, ICIP 2016 - Proceedings
PublisherIEEE Computer Society
Number of pages5
ISBN (Electronic)9781467399616
Publication statusPublished - 2016 Aug 3
Event23rd IEEE International Conference on Image Processing, ICIP 2016 - Phoenix, United States
Duration: 2016 Sept 252016 Sept 28

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880


Other23rd IEEE International Conference on Image Processing, ICIP 2016
Country/TerritoryUnited States


  • Constant-time bilateral filter
  • Image filtering
  • Spectral decomposition

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing


Dive into the research topics of 'Constant-time bilateral filter using spectral decomposition'. Together they form a unique fingerprint.

Cite this