Graph matching by relaxation of fuzzy assignments

Graphs are very powerful and widely used representational tools in computer applications. We present a relaxation approach to (sub)graph matching based on a fuzzy assignment matrix. The algorithm has a computational complexity of O(n/sup 2/m/sup 2/) where n and m are the number of nodes in the two graphs being matched, and can perform both exact and inexact matching. To illustrate the performance of the algorithm, we summarize the results obtained for more than 12 000 pairs of graphs of varying types (weighted graphs, attributed graphs, and noisy graphs). We also compare our results with those obtained using the graduated assignment algorithm.

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

[2]  Richard Sinkhorn.  A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .

[3]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  M. Krcmár,et al.  Application of genetic algorithms in graph matching , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[5]  R. Krishnapuram,et al.  A fuzzy approach to content-based image retrieval , 1999, FUZZ-IEEE'99. 1999 IEEE International Fuzzy Systems. Conference Proceedings (Cat. No.99CH36315).

[6]  King-Sun Fu,et al.  An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  M. P. Windham.  Numerical classification of proximity data with assignment measures , 1985 .

[8]  Eric Mjolsness,et al.  A Lagrangian relaxation network for graph matching , 1996, IEEE Trans. Neural Networks.

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

[10]  Eam Khwang Teoh,et al.  Pattern recognition by graph matching using the Potts MFT neural networks , 1995, Pattern Recognit..

[11]  Olivier D. Faugeras,et al.  Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Shmuel Peleg,et al.  A New Probabilistic Relaxation Scheme , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Marcello Pelillo,et al.  Replicator Equations, Maximal Cliques, and Graph Isomorphism , 1998, Neural Computation.

[14]  Edwin R. Hancock,et al.  An Energy Function and Continuous Edit Process for Graph Matching , 1998, Neural Computation.

[15]  Edwin R. Hancock,et al.  Symbolic graph matching with the EM algorithm , 1998, Pattern Recognit..

[16]  Mohammad Abdulkader Abdulrahim,et al.  Parallel algorithms for labeled graph matching , 1998 .

[17]  Wei-Chung Lin,et al.  A Neural Network Approach to CSG-Based 3-D Object Recognition , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Edwin R. Hancock,et al.  Graph Matching With a Dual-Step EM Algorithm , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[21]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.