Efficient Subgraph Isomorphism Detection: A Decomposition Approach

Graphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we propose a new algorithm for subgraph isomorphism detection from a set of a priori known model graphs to an input graph that is given online. The new approach is based on a compact representation of the model graphs that is computed offline. Subgraphs that appear more than once within the same or within different model graphs are represented only once, thus reducing the computational effort to detect them in an input graph. In the extreme case where all model graphs are highly similar, the run-time of the new algorithm becomes independent of the number of model graphs. Both a theoretical complexity analysis and practical experiments characterizing the performance of the new approach are given.

[1]  Avinash C. Kak,et al.  3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  K. Boyer,et al.  Organizing Large Structural Modelbases , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Horst Bunke.  Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[5]  A. Balaban.  Chemical applications of graph theory , 1976 .

[6]  Jerry Ray Dias,et al.  Chemical Applications of Graph Theory , 1992 .

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

[8]  Lawrence B. Holder,et al.  Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..

[9]  Rudolph E. Seviora,et al.  An Evaluation of DRete on CUPlD for OPSS Matching , 1989, IJCAI.

[10]  Edward M. Riseman,et al.  Matching complex images to multiple 3D objects using view description networks , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[12]  Richard E. Blake.  Partitioning graph matching with constraints , 1994, Pattern Recognit..

[13]  Robert M. Haralick,et al.  Organization of Relational Models for Scene Analysis , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[15]  Ho Soo Lee,et al.  Match Algorithms for Generalized Rete Networks , 1992, Artif. Intell..

[16]  Wendy G. Lehnert,et al.  Some Experiments with Case-Based Search , 1988, AAAI.

[17]  Jun Zhang,et al.  Structural graph-matching approach to image understanding , 1992, Other Conferences.

[18]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[19]  Introduction to graph grammars with applications to semantic networks , 1992 .

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

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

[22]  Radu Horaud,et al.  Symbolic image matching by simulated annealing , 1990, BMVC.

[23]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[24]  Birgit Ueberreiter,et al.  Pattern Recognition by Graph Matching - Combinatorial versus continuous Optimization , 1988, Int. J. Pattern Recognit. Artif. Intell..

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

[26]  Kyu Ho Park,et al.  Incremental clustering of attributed graphs , 1993, IEEE Trans. Syst. Man Cybern..

[27]  R. Horaud,et al.  Structural matching for stereo vision , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[28]  Marc Rioux,et al.  Recognition and Shape Synthesis of 3-D Objects Based on Attributed Hypergraphs , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Stéfane Paris.  Structural Recognition using an Index , 1993 .

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

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

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

[33]  Thomas S Huang,et al.  IMAGE RECOGNITION BY MATCHING RELATIONAL STRUCTURES. , 1981 .

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

[35]  Aurelio López-López,et al.  Conceptual graph matching: a flexible algorithm and experiments , 1992, J. Exp. Theor. Artif. Intell..

[36]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[37]  Brian Falkenhainer,et al.  The Structure-Mapping Engine: Algorithm and Examples , 1989, Artif. Intell..

[38]  H. Bunke,et al.  3-D Object Recognition Based on Subgraph Matching in Polynomial Time , 1990 .

[39]  Juan Humberto Sossa Azuela,et al.  Model indexing: the graph-hashing approach , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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