A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain
Article first published online: 1 DEC 2011
© 2012 The Authors Computer Graphics Forum © 2012 The Eurographics Association and Blackwell Publishing Ltd.
Computer Graphics Forum
Volume 31, Issue 1, pages 19–32, February 2012
How to Cite
Banterle, F., Corsini, M., Cignoni, P. and Scopigno, R. (2012), A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain. Computer Graphics Forum, 31: 19–32. doi: 10.1111/j.1467-8659.2011.02078.x
- Issue published online: 28 FEB 2012
- Article first published online: 1 DEC 2011
- Accepted 9 October 2011.
- bilateral filter;
- cross-bilateral filter;
- real-time filtering;
- video denoising;
- edge-aware painting;
- GPU techniques
- I.4.1 [Image Processing and Computer Vision]: Enhancement;
- Filtering I.3.3 [Computer Graphics]: Picture/Image Generation;
- Bitmap and framebuffer operations
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.