Summary: Real-Time O(1) Bilateral Filtering
Qingxiong Yang
Kar-Han Tan
Narendra Ahuja

University of Illinois at Urbana Champaign
HP Labs, Palo Alto
http://vision.ai.uiuc.edu/~qyang6/
Abstract
We propose a new bilateral filtering algorithm with com-
putational complexity invariant to filter kernel size, so-
called O(1) or constant time in the literature. By showing
that a bilateral filter can be decomposed into a number of
constant time spatial filters, our method yields a new class
of constant time bilateral filters that can have arbitrary spa-
tial1
and arbitrary range kernels. In contrast, the current
available constant time algorithm requires the use of spe-
cific spatial or specific range kernels. Also, our algorithm
lends itself to a parallel implementation leading to the first

Source: Ahuja, Narendra - Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign

Collections: Computer Technologies and Information Sciences; Engineering