A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain
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.
BibTeX
@article {10.1111:j.1467-8659.2011.02078.x,
journal = {Computer Graphics Forum},
title = {{A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain}},
author = {Banterle, Francesco and Corsini, Massimiliano and Cignoni, Paolo and Scopigno, Roberto},
year = {2012},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2011.02078.x}
}
journal = {Computer Graphics Forum},
title = {{A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain}},
author = {Banterle, Francesco and Corsini, Massimiliano and Cignoni, Paolo and Scopigno, Roberto},
year = {2012},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2011.02078.x}
}