The Community for Technology Leaders
Pattern Recognition, International Conference on (2004)
Cambridge UK
Aug. 23, 2004 to Aug. 26, 2004
ISSN: 1051-4651
ISBN: 0-7695-2128-2
pp: 398-401
Xiao Bai , University of York, UK
Hang Yu , University of York, UK
Edwin R. Hancock , University of York, UK
This paper describes how graph-spectral methods can be used to transform the node correspondence problem into one of point-set alignment. We commence by using the ISOMAP algorithm to embed the nodes of a graph in a low-dimensional Euclidean space. With the nodes in the graph transformed to points in a metric space, we can recast the problem of graph-matching into that of aligning the points. Here we use a variant of the Scott and Longuet-Higgins algorithm to find point correspondences. We experiment with the resulting algorithmon a number of real-world problems.

E. R. Hancock, X. Bai and H. Yu, "Graph Matching using Spectral Embedding and Alignment," Pattern Recognition, International Conference on(ICPR), Cambridge UK, 2004, pp. 398-401.
91 ms
(Ver 3.3 (11022016))