A matching algorithm of deformed planar curves using multiscale convex/concave structures
A matching algorithm of deformed planar curves using multiscale convex/concave structures
复制标题
使用多尺度凸/凹结构的变形平面曲线匹配算法
DOI：
10.1002/scj.4690220510
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
Satoshi Suzuki
中科院分区：
文献类型：
--
作者：
N. Ueda;Satoshi Suzuki
本文提出了一种新的多尺度分段匹配方法，适用于严重变形的平面形状。首先，使用曲率尺度空间过滤获得多尺度表示。然后在连续的平滑形状之间建立拐点对应关系。本文的表示与众所周知的曲率尺度空间图像描述不同，确保其始终满足分层分段替换的一致性。此外，它需要更少的处理时间和内存分配。最后，通过本文提出的新的多尺度分段匹配方法来匹配最佳尺度分段。在该方法中，匹配问题被表述为片段不相似性总量的最小化问题。使用动态规划可以有效地解决最小化问题。所提出的匹配方法使得即使形状有一些局部严重变形也可以获得直观的相关对应关系。
This paper proposes a new multiscale segment matching method which is applicable to heavily deformed planar shapes. First, multiscale representations are obtained using curvature scale space filtering. Then inflection point correspondence is developed between consecutive smoothed shapes. The representation in this paper, unlike the well-known curvature scale space image description, ensures that it always satisfies the consistency of hierarchical segment replacement. Moreover, it requires less processing time and memory allocation. Finally, optimum scale segments are matched by a new multiscale segment matching method proposed herein. In this method, the matching problem is formulated as a minimization problem of the total amount of segment dissimilarity. The minimization problem is solved effectively using dynamic programming. The proposed matching method makes it possible to obtain intuitively relevant correspondences even if the shapes have some local heavy deformation.