基于连接点的二维多角弧匹配

多角弧匹配问题的关键是，其既能反映多角弧的几何性质，又能反映多角弧拓扑结构的特征选取．在分析了多角弧几何形状的基础上，引入了连接点的概念，并用连接点集表示多角弧，这一表示在旋转和平移变换下是不变的。进一步取该连接点集作为匹配的特征集，给出了特征集之间匹配的算法．该算法是将连接点间的距离积分作为测量函数，使二维多角弧的匹配由连接点的匹配来决定．给出的模拟试验结果表明，该算法效果良好，并且对于数值污染具有健壮性。

Matching 2D Polygonal Arcs Based on Junction as Feature Sets

Feature selection is a key problem of matching 2D polygonal arcs. The optimal feature sets should have the attribute of geometry and topology. In this paper, we focus on polygonal arcs junction that is two line segments that meet at a single point. We present junctions of polygonal arcs as feature sets; the benefits of using this feature sets include attribute of geometry and structure of topology of polygonal arcs. The number of features used in the matching must be reducing to a minimum without losing geometric information useful for 2D reconstruction. 2D polygonal arcs are represented by the feature sets. This representation is invariant to translation and rotation transformation. The 2D polygonal arcs matching task is reduce into a 1 D string matching problem. The trivial matching algorithm is proposed and use to matching of nonoccluded and occluded 2D polygonal arcs. Experiments with different classes polygonal arcs show that the matching algorithm is efficiency and is robust to digitization errors and noise effects. And can perform well when simple closed curves represented by polygonal arcs.