Feature Matching Based on Laplacian Spectra of Graphs
Nian Wang · 2006
This paper presents a method of feature matching based on Laplacian spectral of graphs.Given feature points of two images,we define Laplacian matrices respectively,analysis the eigenvalues and eigenvectors of the matrices,and construct a feature points matching matrix with information of magnitude and position of entries in the matching matrix,the feature points matching is done.Furthermore,we theoretically prove that our algorithm can acquire an exact matching under an equilong transformation or equiform transformation on images.Experimental results show that the approach attains accuracy 82% on real images.