Recursive anisotropic 2-D Gaussian filtering based on a triple-axis decomposition
Recursive anisotropic 2-D Gaussian filtering based on a triple-axis decomposition
复制标题
DOI：
10.1109/tip.2007.896673
复制
发表时间：
2007-07-01
影响因子：
10.6
通讯作者：
Shi, Bertram E.
中科院分区：
文献类型：
--
作者：
Lam, Stanley Yin Man;Shi, Bertram E.
我们描述了一个递归算法的各向异性2-D高斯滤波，分离的基础上过滤器的级联三个，而不是两个，1-D过滤器。滤波器沿通过整数水平和/或垂直像素移位获得的轴沿着操作。这消除了插值，从而消除了滤波器中的空间不均匀性，并产生更多的椭圆形内核。它还导致更规则的滤波器结构，这有利于在DSP芯片中实现。最后，它改善了具有相同偏心率和宽度但不同取向的滤波器之间的匹配。我们的分析和实验表明，计算复杂度是类似的算法，沿沿着两个轴（< 11毫秒的512 × 512图像使用3.2 GHz的奔腾4 PC）。另一方面，给定一组有限的基本滤波器轴，存在与可实现的纵横比相关的取向下限。
We describe a recursive algorithm for anisotropic 2-D Gaussian filtering, based on separating the filter into the cascade of three, rather two, 1-D filters. The filters operate along axes obtained by integer horizontal and/or vertical pixel shifts. This eliminates interpolation, which removes spatial inhomogeneity in the filter, and produces more elliptically shaped kernels. It also results in a more regular filter structure, which facilitates implementation in DSP chips. Finally, it improves matching between filters with the same eccentricity and width, but different orientations. Our analysis and experiments indicate that the computational complexity is similar to an algorithm that operates along two axes (< 11 ms for a 512 X 512 image using a 3.2-GHz Pentium 4 PC). On the other hand, given a limited set of basis filter axes, there is an orientation dependent lower bound on the achievable aspect ratios.