Comprehension Bilateral Filtering
Jyoti Reddy, B. Rama Bhupal Reddy · IOSR Journal of Electronics and Communication Engineering · 2017
The main of the paper presents an efficient constant-time bilateral filter that produces a near-optimal performance tradeoff between approximate accuracy and computational complexity without any complicated parameter adjustment, called a compressive bilateral filter (CBLF).The constant-time means that the computational complexity is independent of its filter window size.Although many existing constant-time bilateral filters have been proposed step by step to pursue a more efficient performance tradeoff, they have less focused on the optimal tradeoff for their own frameworks.It is important to discuss this question because it can reveal whether or not a constant-time algorithm still has plenty room for improvements of performance tradeoff.This paper tackles the question from a viewpoint of compressibility and highlights the fact that state of-the-art algorithms have not yet touched the optimal tradeoff.The CBLF achieves a near optimal performance tradeoff by two key ideas: approximate Gaussian range kernel through Fourier analysis and period length optimization.Experiments demonstrate that the CBLF significantly outperforms state-of-the-art algorithms in terms of approximate accuracy, computational complexity, and usability.