Graph Matching Based on Node Signatures

We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate that the newly presented algorithm is well suited to pattern recognition applications. Compared with four well-known methods, our algorithm gives good results for clustering and retrieving images. A sensitivity analysis reveals that the proposed method is also insensitive to weak structural changes.

[1]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[2]  Sameer A. Nene,et al.  Columbia Object Image Library (COIL100) , 1996 .

[3]  Ernest Valveny,et al.  Report on the Second Symbol Recognition Contest , 2005, GREC.

[4]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[5]  Kaspar Riesen,et al.  Approximate graph edit distance computation by means of bipartite graph matching , 2009, Image Vis. Comput..

[6]  Ali Shokoufandeh,et al.  Applications of Bipartite Matching to Problems in Object Recognition , 2009 .

[7]  Yannis Manolopoulos,et al.  Structure-based similarity search with graph histograms , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.

[8]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Daniel P. Lopresti,et al.  A fast technique for comparing graph representations with applications to performance evaluation , 2003, Document Analysis and Recognition.

[10]  Jean-Michel Jolion,et al.  A Generic Graph Distance Measure Based on Multivalent Matchings , 2007, Applied Graph Theory in Computer Vision and Pattern Recognition.

[11]  Marco Gori,et al.  Exact and approximate graph matching using random walks , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[13]  King-Sun Fu,et al.  A graph distance measure for image analysis , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  Kaspar Riesen,et al.  IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.

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

[16]  Horst Bunke,et al.  Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem , 1999, Pattern Recognit. Lett..

[17]  Joachim M. Buhmann,et al.  Multidimensional Scaling and Data Clustering , 1994, NIPS.

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

[19]  Abraham Kandel,et al.  Applied Graph Theory in Computer Vision and Pattern Recognition , 2007 .

[20]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[21]  Ali Shokoufandeh,et al.  A Unified Framework for Indexing and Matching Hierarchical Shape Structures , 2001, IWVF.

[22]  Edwin R. Hancock,et al.  Bayesian graph edit distance , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

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

[24]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[25]  Gabriella Sanniti di Baja,et al.  Visual Form 2001 , 2001, Lecture Notes in Computer Science.

[26]  J. Dunn.  Well-Separated Clusters and Optimal Fuzzy Partitions , 1974 .

[27]  Lei Xu,et al.  A PCA approach for fast retrieval of structural patterns in attributed graphs , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[28]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[29]  U. Feige,et al.  Spectral Graph Theory , 2015 .