Representation and matching for planar curve based on corner distance matrix and concentric circles

Zeng Jiexian; Liu Xiupeng; Fu Xiang

doi:10.11834/jig.20120816

Views : 0 下载量: 58 CSCD: 0

PDF
Export
Share
Collection
Album

Representation and matching for planar curve based on corner distance matrix and concentric circles
Vol. 17, Issue 8, Pages: 1011-1020(2012)
Published：2012
DOI： 10.11834/jig.20120816
稿件说明：

移动端阅览

DOI：

Zeng Jiexian, Liu Xiupeng, Fu Xiang. Representation and matching for planar curve based on corner distance matrix and concentric circles[J]. Journal of Image and Graphics, 2012, 17(8): 1011-1020. DOI： 10.11834/jig.20120816.

摘要

曲线匹配对于物体识别、目标跟踪、碎片拼接等有着重要的意义。针对曲线匹配的效率与鲁棒性问题

提出了一种基于角点距离矩阵和同心圆划分的曲线描述与匹配算法。该算法分为粗略匹配和精确匹配两个阶段。粗略匹配阶段首先采用角点距离矩阵来描述曲线;然后通过子矩阵的方法来匹配曲线。精确匹配阶段首先采用同心圆划分的方法描述曲线;然后通过两条曲线同心圆描述集的差异度度量函数来度量他们的相似性。算法不仅具有平移、旋转、缩放不变性

而且具有较强的鲁棒性

可用于遮挡物体的匹配以及基于轮廓的图形拼接。实验结果表明了该算法的有效性和可行性。

Abstract

Curve matching plays a significant role in object recognition

target tracking and fragment reassembling. An algorithm for planar curves based on corner distance matrix and concentric circles is presented. The algorithm includes two steps

namely rough matching and exact matching. The curves are represented using corner distance matrics in the rough matching stage

and then they are matched with a sub-matrix. As for exact matching

first

the representation of the curve uses concentric circles and then measures their similarity through two curve representation sets of concentric circles. The algorithm is robust to translation

rotation

and scaling. It can be used to match block objects and reassemble the graphic. The experiment results show the effectiveness and feasibility of algorithm.