A graph distance metric based on the maximal common subgraph

Abstract Error-tolerant graph matching is a powerful concept that has various applications in pattern recognition and machine vision. In the present paper, a new distance measure on graphs is proposed. It is based on the maximal common subgraph of two graphs. The new measure is superior to edit distance based measures in that no particular edit operations together with their costs need to be defined. It is formally shown that the new distance measure is a metric. Potential algorithms for the efficient computation of the new measure are discussed.

[1]  Shi-Kuo Chang,et al.  Iconic Indexing by 2-D Strings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  G. Levi.  A note on the derivation of maximal common subgraphs of two directed or undirected graphs , 1973 .

[3]  Jin H. Kim,et al.  Recognizing 3-D objects by forward checking constrained tree search , 1992, Pattern Recognit. Lett..

[4]  Horst Bunke,et al.  Automatic Learning and Recognition of Graphical Symbols in Engineering Drawings , 1995, GREC.

[5]  Walter F. Bischof,et al.  Rulegraphs for graph matching in pattern recognition , 1994, Pattern Recognit..

[6]  Horst Bunke,et al.  Recent Advances in Graph Matching , 1997, Int. J. Pattern Recognit. Artif. Intell..

[7]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[9]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[10]  Radu Horaud,et al.  Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[12]  Mario Vento,et al.  Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs , 1997, GbRPR.

[13]  E. K. WONG,et al.  Model matching in robot vision by subgraph isomorphism , 1992, Pattern Recognit..

[14]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

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

[16]  R. Levinson.  PATTERN ASSOCIATIVITY AND THE RETRIEVAL OF SEMANTIC NETWORKS , 1991 .

[17]  SUH-YIN LEE,et al.  Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation , 1992, Pattern Recognit..

[18]  Horst Bunke,et al.  Efficient Graph Matching for Video Indexing , 1997, GbRPR.

[19]  Jin Hyung Kim,et al.  Translation-, Rotation- and Scale- Invariant Recognition of Hand-Drawn Symbols in Schematic Diagrams , 1990, Int. J. Pattern Recognit. Artif. Intell..

[20]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..