Speeding Up the Bilateral Filter: A Joint Acceleration Way
Longquan Dai, Mengke Yuan, Xiaopeng Zhang

TL;DR
This paper introduces a unified framework that combines five acceleration techniques to significantly speed up the bilateral filter while maintaining high accuracy, overcoming previous limitations of individual methods.
Contribution
It proposes the first method to jointly integrate multiple acceleration techniques for the bilateral filter, achieving constant-time performance with improved accuracy.
Findings
Achieves linear-time computation of bilateral filter using combined techniques.
Significantly improves filtering accuracy without increasing computational cost.
Demonstrates effectiveness through extensive experiments.
Abstract
Computational complexity of the brute-force implementation of the bilateral filter (BF) depends on its filter kernel size. To achieve the constant-time BF whose complexity is irrelevant to the kernel size, many techniques have been proposed, such as 2D box filtering, dimension promotion, and shiftability property. Although each of the above techniques suffers from accuracy and efficiency problems, previous algorithm designers were used to take only one of them to assemble fast implementations due to the hardness of combining them together. Hence, no joint exploitation of these techniques has been proposed to construct a new cutting edge implementation that solves these problems. Jointly employing five techniques: kernel truncation, best N -term approximation as well as previous 2D box filtering, dimension promotion, and shiftability property, we propose a unified framework to transform…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
