Inexact Graph Matching Using Eigen-Subspace Projection Clustering

Graph eigenspaces have been used to encode many different properties of graphs. In this paper we explore how such methods can be used for solving inexact graph matching (the matching of sets of ver...

[1]  Michael Brady,et al.  Feature-based correspondence: an eigenvector approach , 1992, Image Vis. Comput..

[2]  Edwin R. Hancock,et al.  Spectral Feature Vectors for Graph Clustering , 2002, SSPR/SPR.

[3]  Edwin R. Hancock,et al.  Inexact graph matching using genetic search , 1997, Pattern Recognit..

[4]  Kaleem Siddiqi,et al.  Hamilton-Jacobi Skeletons , 2002, International Journal of Computer Vision.

[5]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Kaleem Siddiqi,et al.  Matching Hierarchical Structures Using Association Graphs , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  H. C. Longuet-Higgins,et al.  An algorithm for associating the features of two images , 1991, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[8]  Jin Hyung Kim,et al.  Attributed stroke graph matching for seal imprint verification , 1989, Pattern Recognit. Lett..

[9]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[10]  W. Velicer,et al.  Comparison of five rules for determining the number of components to retain. , 1986 .

[11]  L. Collatz,et al.  Spektren endlicher grafen , 1957 .

[12]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[13]  Horst Bunke,et al.  Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis , 2001, IWVF.

[14]  Edwin R. Hancock,et al.  Least-commitment graph matching with genetic algorithms , 2001, Pattern Recognit..

[15]  Barend J. van Wyk,et al.  Non-bayesian Graph Matching without Explicit Compatibility Calculations , 2002, SSPR/SPR.

[16]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Horst Bunke,et al.  On Median Graphs: Properties, Algorithms, and Applications , 2001, IEEE Trans. Pattern Anal. Mach. Intell..