USING CANNY CRITERIA TO DERIVE A RECURSIVELY IMPLEMENTED OPTIMAL EDGE DETECTOR
USING CANNY CRITERIA TO DERIVE A RECURSIVELY IMPLEMENTED OPTIMAL EDGE DETECTOR
复制标题
DOI：
10.1007/bf00123164
复制
发表时间：
1987-01-01
影响因子：
19.5
通讯作者：
DERICHE, R
中科院分区：
文献类型：
--
作者：
DERICHE, R
提出了一种高效的递归边缘检测算法。使用Canny的设计[1]，我们证明了他对无限范围滤波器的检测和定位的精确公式的解决方案导致一维的最佳算子，这可以通过两个在相反方向上移动的递归滤波器有效地实现。除了噪声截断免疫力的结果，递归性质的滤波操作导致，与顺序机，以大量节省计算工作（五个乘法和五个加法为一个像素，独立于邻域的大小）。扩展到二维的情况下被认为是和由此产生的过滤结构实现为二维递归过滤器。因此，可以通过简单地改变一个参数的值来改变滤波器大小，而不影响算法的时间执行。给出了这种新的边缘检测器的性能指标，并与Canny滤波器进行了比较。各种实验结果显示。
A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented by two recursive filters moving in opposite directions. In addition to the noise truncature immunity which results, the recursive nature of the filtering operations leads, with sequential machines, to a substantial saving in computational effort (five multiplications and five additions for one pixel, independent of the size of the neighborhood). The extension to the two-dimensional case is considered and the resulting filtering structures are implemented as two-dimensional recursive filters. Hence, the filter size can be varied by simply changing the value of one parameter without affecting the time execution of the algorithm. Performance measures of this new edge detector are given and compared to Canny's filters. Various experimental results are shown.