Subpixel contour matching using continuous dynamic programming
Subpixel contour matching using continuous dynamic programming
复制标题
DOI：
10.1109/cvpr.1994.323830
复制
发表时间：
1994-06
期刊：
影响因子：
--
通讯作者：
B. Serra;M. Berthod
中科院分区：
文献类型：
--
作者：
B. Serra;M. Berthod
提出了一种基于动态规划的亚像素轮廓匹配算法。与传统的动态规划方法不同，我们的方法允许确定最优的连续路径，而不是在图中搜索离散路径。匹配以分段参数函数的形式获得，不涉及离散化，也不假定任何参数化变形。作为副作用的结果，获得匹配轮廓的变形的测量，从而产生关于匹配质量的信息。该算法已经在不同类型的图像上进行了测试，显示了它处理轮廓线段链和轮廓边缘链的能力，因为轮廓的离散化不再限制匹配的精度。
This paper presents a subpixel contour matching algorithm using a novel dynamic programming scheme. Unlike classical dynamic programming methods, where a discrete path is searched for across a graph, our approach allows the optimal continuous path to be determined. The matching is obtained as a piecewise parametric function, and no discretization is involved, nor any parameterized deformation assumed. As a side result, a measure of the deformation of the matched contours is obtained, yielding information on the quality of the match. The algorithm has been tested with different types of images, demonstrating its ability to deal with chains of contour segments as well as chains of contour edges, since the discretization of the contours does not limit the precision of the matches anymore.>