Premium
A Low‐Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain
Author(s) -
Banterle Francesco,
Corsini Massimiliano,
Cigi Paolo,
Scopigno Roberto
Publication year - 2012
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2011.02078.x
Subject(s) - computer science , filter (signal processing) , overhead (engineering) , kernel (algebra) , noise reduction , bilateral filter , artificial intelligence , enhanced data rates for gsm evolution , computer vision , domain (mathematical analysis) , image (mathematics) , speedup , algorithm , parallel computing , mathematics , mathematical analysis , combinatorics , operating system
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.