An eigenspace projection clustering method for inexact graph matching

In this paper, we show how inexact graph matching (that is, the correspondence between sets of vertices of pairs of graphs) can be solved using the renormalization of projections of the vertices (as defined in this case by their connectivities) into the joint eigenspace of a pair of graphs and a form of relational clustering. An important feature of this eigenspace renormalization projection clustering (EPC) method is its ability to match graphs with different number of vertices. Shock graph-based shape matching is used to illustrate the model and a more objective method for evaluating the approach using random graphs is explored with encouraging results.

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

[2]  Kaleem Siddiqi,et al.  The Hamilton-Jacobi skeleton , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

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

[4]  S ShapiroLarry,et al.  Feature-based correspondence , 1992 .

[5]  Fabio Gagliardi Cozman,et al.  Random Generation of Bayesian Networks , 2002, SBIA.

[6]  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.

[7]  Alex Pentland,et al.  Modal Matching for Correspondence and Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[10]  Ching Y. Suen,et al.  Hierarchical attributed graph representation and recognition of handwritten chinese characters , 1991, Pattern Recognit..

[11]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  George Karypis,et al.  A Comparison of Document Clustering Techniques , 2000 .

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

[14]  Kaleem Siddiqi,et al.  Many-to-many Matching of Attributed Trees Using Association Graphs and Game Dynamics , 2001, IWVF.

[15]  Ali Shokoufandeh,et al.  Shock Graphs and Shape Matching , 1998, International Journal of Computer Vision.

[16]  Tariq S. Durrani,et al.  A RKHS Interpolator-Based Graph Matching Algorithm , 2002, IEEE Trans. Pattern Anal. Mach. Intell..