A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain

link to the official journal

Abstract

In this work we present a new algorithm for accelerating the colour bilateral filter based on a subsampling strategy working in the spatial domain. The base idea is to use a suitable subset of samples of the entire kernel in order to obtain a good estimation of the exact filter values. The main advantages of the proposed approach are that it has an excellent trade-off between visual quality and speed-up, a very low memory overhead is required and it is straightforward to implement on the GPU allowing real-time filtering. We show different applications of the proposed filter, in particular efficient cross-bilateral filtering, real-time edge-aware image editing and fast video denoising. We compare our method against the state of the art in terms of image quality, time performance and memory usage.

Errata Corrige: -Figure 2: Poisson-disk patterns (PDS) and Monte-Carlo Stratified (jiitering) patterns (SMS) should be swapped.

Interactive Demo in WebGL/SpiderGL using Importance Sampling

FPS : 0

Range Sigma

Downloads

Have a look to Piccante for a C++ implementation of this algorithm.

OpenGL ES 2.0 shaders source code and data of this web page webGL demo.

@Article\{BCCS12,
  author       = "Banterle, Francesco and Corsini, Massimiliano and Cignoni, Paolo and Scopigno, Roberto",
  title        = "A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain",
  journal      = "Computer Graphics Forum",
  number       = "1",
  volume       = "31",
  pages        = "19--32",
  month        = "February",
  year         = "2012",
  keywords     = "Bilateral Filter, Cross Bilateral Filter, Joint Bilateral Filter, Non-linear filters, Video Denoising, Flash Photography, Tone Mapping, GPU",
  url          = "http://vcg-legacy.isti.cnr.it/Publications/2012/BCCS12"
}