200 FPS Constant-Time Bilateral Filter Using SVD and Tiling Strategy

This paper presents a constant-time bilateral filter that supports arbitrary range kernel designed via singular value decomposition (SVD). Bilateral filter (BF) suffers from high computational complexity in real-time processing due to the time-variant kernel. Although various accelerations for BF have been proposed, most of them have not achieved both arbitrary range kernel and tight computational complexity simultaneously. The proposed method supports arbitrary range kernel but requires half computational complexity of most state-of-the-art methods. Moreover, we present two implementation techniques well matched to the SVD approach: range fitting and tiling strategy. Experiments show that, in the cases of major range kernels, the proposed method not only runs faster (200 FPS) but also achieves higher accuracy than the state-of-the-art methods.