Fast gauss bilateral filtering

Shin Yoshizawa, Alexander Belyaev, Hideo Yokota

Research output: Contribution to journalArticle

25 Citations (Scopus)
535 Downloads (Pure)

Abstract

In spite of high computational complexity, the bilateral filter and its modifications and extensions have recently become very popular image and shape processing tools. In this paper, we propose a fast and accurate approximation of the bilateral filter. Our approach combines a dimension elevation trick with a Fast Gauss Transform. First we represent the bilateral filter as a convolution in a high dimensional space. Then the convolution is efficiently approximated by using space partitioning and Gaussian function expansions. Advantages of our approach include linear computational complexity, user-specified precision, and an ability to process high dimensional and non-uniformly sampled data. We demonstrate capabilities of the approach by considering its applications to the image and volume denoising and high-dynamic-range tone mapping problems. © 2010 The Eurographics Association and Blackwell Publishing Ltd.

Original languageEnglish
Pages (from-to)60-74
Number of pages15
JournalComputer Graphics Forum
Volume29
Issue number1
DOIs
Publication statusPublished - Mar 2010

Keywords

  • Bilateral filter
  • Fast Gauss transform (FGT)
  • Fast image filtering
  • Yaroslavsky filter

Fingerprint Dive into the research topics of 'Fast gauss bilateral filtering'. Together they form a unique fingerprint.

Cite this