基于相对形状上下文和谱匹配方法的点模式匹配算法.pdfVIP

第32 卷第10 期 电 子 与 信 息 学 报 Vol.32No.10 2010 年10 月 Journal of Electronics Information Technology Oct..2010 基于相对形状上下文和谱匹配方法的点模式匹配算法 赵 键 孙即祥 李智勇 陈明生 (国防科学技术大学电子科学与工程学院信息工程系 长沙 410073)　 摘 要：该文提出了一种将不变特征与谱匹配方法相结合的点模式匹配算法。该算法首先提出一种新的基于点集的 不变特征 相对形状上下文，然后利用点集间相对形状上下文的统计检验匹配测度来定义新的相容性度量，并以 此为基础构造分配图及其亲近矩阵。最后利用分配图亲近矩阵的主特征向量以及匹配约束条件来实现点模式匹配问 题的求解。模拟仿真与真实数据实验验证了该文算法的有效性和鲁棒性。 关键词：点模式匹配；相对形状上下文；分配图；谱匹配方法 中图分类号：TP391 文献标识码： A 文章编号：1009-5896(2010)10-2287-07 DOI: 10.3724/SP.J.1146.2010.00655 Point Pattern Matching Algorithm Based on Relative Shape Context and Spectral Matching Method Zhao Jian Sun Ji-xiang Li Zhi-yong Chen Ming-sheng (Department of Information Engineering, College of Electronic Science and Engineering, National University of Defense Technology, Changsha 410073, China) Abstract: This paper presents a novel and robust point pattern matching algorithm in which the invariant feature and the method of spectral matching are combined. A new point-set based invariant feature, Relative Shape Context (RSC), is proposed firstly. Using the test statistic of relative shape context descriptor’s matching scores as the foundation of new compatibility measurement, the assignment graph and the affinity matrix of assignment graph are constructed based on the gained compatibility measurement. Finally, the correct matching results are recovered by using the principal eigenvector of affinity matrix of assignment graph and imposing the mapping constraints required by the overall correspondence mapping. Experiments on both synthetic point-sets and on real world data