Abstract The fundamental theory and the antinoise problem of the traditional eigenvector approach (EA) are discussed and analyzed. Two matching algorithms are proposed, namely weighted eigenvector approach (WEA) and sorting approach (SA). WEA decomposes the intraset distance matrices of point sets and gets the feature vectors of the points. Then, the feature vectors are weighted by the eigenvalues of matrices. The algorithm gets the matching map by comparing the similarity of the weighted feature vectors. Without the decomposition of matrices, SA acquires the characteristics of the point by sorting the distance matrices, and obtains the matching in the same way above. The two algorithms solve the choosing problem of Gauss parameter and have better antinoise ability than EA. Experimental results show the practicability of the algorithm and the better performance than that of EA.
[1] Umeyama S. LeastSquares Estimation of Transformation Parameters between Two Point Patterns. IEEE Trans on Pattern Analysis and Machine Intelligence, 1991, 13(4): 376380 [2] Besl P J, Mckay N D. A Method for Registration of 3D Shapes. IEEE Trans on Pattern Analysis and Machine Intelligence, 1992, 14(2): 239256 [3] Wachowiak M P, Smolirova R, Zheng Yufeng, et al. An Approach to Multimodal Biomedical Image Registration Utilizing Particle Swarm Optimization. IEEE Trans on Evolutionary Computation, 2004, 8(3): 289301 [4] Chui H L, Rangarajan A. A New Algorithm for NonRigid Point Matching // Proc of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Hilton Head Island, USA, 2000: 4451 [5] Bin R N, Khan H A, Kamran F, et al. A New Algorithm of Stereo Matching Using Epipolar Geometry // Proc of the 7th International Multi Topic Conference. Islamabad, Pakistan, 2003: 2124 [6] Belongie S, Malik J, Puzicha J. Shape Matching and Object Recognition Using Shape Contexts. IEEE Trans on Pattern Analysis and Machine Intelligence, 2002, 24(4): 509522 [7] Shapiro L S, Brady J M. FeatureBased Correspondence: An Eigenvector Approach. Image and Vision Computing, 1992, 10(5): 283288 [8] Scott G L, LonguetHiggins H C. An Algorithm for Associating the Features of Two Patterns. Proc of the Royal Society of London Series B: Biological Sciences, 1991, 224: 2126 [9] Pilu M. A Direct Method for Stereo Correspondence Based on Singular Value Decomposition // Proc of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. San Juan, Puerto Rico, 1997: 261266 [10] Zhong Xue, Teoh E K. A Novel Eigenvector Approach to Pose and Correspondence Estimation // Proc of the IEEE International Conference on Systems, Man, and Cybernetics. Nashville, USA, 2000: 14891494 [11] Carcassoni M, Hancock E R. Spectral Correspondence for Point Pattern Matching. Pattern Recognition, 2003, 36(1): 193204
2007, Vol. 20 
