By Topic

An Algorithm for Point Correspondences Based on Laplacian Spectra of Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nian Wang ; Key Lab. of ICSP, Anhui Univ., Hefei ; Jun Tang ; Yi-Zheng Fang ; Rui Dong

This paper presents a novel algorithm of correspondence matching of point-sets by using Laplacian spectra of graphs. We make three contributions. Firstly, according to the two point sets to be matched, we define a Laplacian matrix with Euclidean distance, and give a closed form solution in terms of the matching matrix constructed on the vectors of eigenspace of the Laplacian matrix. Secondly, we theoretically prove that the algorithm acquires exact results under equilong or equiform transformation of image plane. Thirdly, we demonstrate how to combine this method with the algorithm of probabilistic relaxation. Experimental results of real-world data show that our method possesses comparatively high accuracy

Published in:

Computational Intelligence and Security, 2006 International Conference on  (Volume:1 )

Date of Conference:

Nov. 2006