arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.08081cs.CV
收藏

基于Fourier核的快速双边滤波

On Fast Bilateral Filtering using Fourier Kernels

Indian Institute of Science(印度科学学院)

Sanjay Ghosh, Kunal N. Chaudhury

摘要:

在早期的工作中证明,通过使用可移位函数近似其范围核,可以使用一系列快速卷积来计算非线性双边滤波器。然而,以前的方法的基础上移位近似,被限制为高斯范围内核。在这项工作中,我们提出了一种新的近似,可以适用于任何范围内核,只要它有一个逐点收敛的傅立叶级数。更具体地说,我们建议使用傅立叶基,其中的基础上的系数通过解决一系列的最小二乘问题来获得的双边滤波器的高斯范围内核的近似。可以使用QR分解的递归形式有效地计算系数。通过控制傅立叶基的基数,我们可以在运行时间和滤波精度之间获得一个很好的折衷。特别是,我们能够保证子像素精度的整体滤波,这是不提供的大多数现有的方法快速双边滤波。我们目前的仿真结果证明所提出的算法的速度和准确性。

英文摘要:

It was demonstrated in earlier work that, by approximating its range kernel using shiftable functions, the non-linear bilateral filter can be computed using a series of fast convolutions. Previous approaches based on shiftable approximation have, however, been restricted to Gaussian range kernels. In this work, we propose a novel approximation that can be applied to any range kernel, provided it has a pointwise-convergent Fourier series. More specifically, we propose to approximate the Gaussian range kernel of the bilateral filter using a Fourier basis, where the coefficients of the basis are obtained by solving a series of least-squares problems. The coefficients can be efficiently computed using a recursive form of the QR decomposition. By controlling the cardinality of the Fourier basis, we can obtain a good tradeoff between the run-time and the filtering accuracy. In particular, we are able to guarantee sub-pixel accuracy for the overall filtering, which is not provided by most existing methods for fast bilateral filtering. We present simulation results to demonstrate the speed and accuracy of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑