基于图匹配的旋转不变弹性点匹配算法  

Rotation-invariant non-rigid point matching algorithm based on graph matching

作　　者：连玮[1] 

机构地区：[1]长治学院计算机系,山西长治046011

出　　处：《计算机应用》2012年第9期2564-2567,2572,共5页journal of Computer Applications

基　　金：山西省高校科技研究开发项目(20111128);山西省基础研究计划项目青年科技研究基金资助项目(2012021015-2)

摘　　要：针对旋转不变的弹性点匹配问题,提出一种基于图匹配的算法。对两点集分别构造边集合,然后定向的形状上下文距离和边长度的差别被用于度量两点集的边之间的相似性。基于边的相似性,点对应关系通过求解一个图匹配问题而恢复。实验结果表明该算法可以获得很好的配准结果并且鲁棒、高效。To address the rotation-invariant non-rigid point matching problem, a graph matching based algorithm was proposed in this paper. Two sets of edges were constructed from two point sets respectively. Then oriented Shape Context （SC） distances and length differences were both used to measure the similarities of edges between two point sets. Based on edge similarities, point correspondence was recovered via graph matching. The experimental results show the method is capable of achieving good matching results and also robust and efficient.

关 键 词：图匹配 形状上下文 形状表示 点匹配 

分 类 号：TP391[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]