Method with the Center of Graph for Point Pattern Matching
Based on the center of graph,a point pattern feature matching method is proposed here.Firstly,a weighted complete graph is constructed with the feature points of each image,and then the center of each graph is found respectively.With the vertex sets of the centers,the feature points are divided into several layers according to the distance from the center,and then the corresponding relation between layers is obtained.Secondly,the Gaussian-weighted Laplace matrices are constructed between the corresponding layers. And then the matrices are submitted to singular-value decompositionfSVD).Finally,represent the feature points with eigenvectors obtained from sVD,and then construct matching matrix to obtain the final matching results.Synthetic data and real world data both indicate that our method has a higher accuracy than theirs,and it can deal with the matching problem with more feature points effectively.
feature point center of graph Laplace matriz matching.
Shanli Xuan Dong Liang Ming Zhu Yizheng Fan Nian Wang
School of Computer & Information,HeFei University of Technology,Hefei,230009,China Key Lab Intelligent Computing & Signal Ministry of Education,Anhui University,Hefei,230039,China Key Lab Intelligent Computing & Signal Ministry of Education,Anhui University,Hefei,230039,China Sch
国际会议
2009 9th International Conference on Electronic Measurement & Instruments(第九届电子测量与仪器国际会议 ICEMI2009)
北京
英文
345-349
2009-08-16（万方平台首次上网日期，不代表论文的发表时间）