Inexact graph matching for structural pattern recognition

This paper is concerned with the inexact matching of attributed, relational graphs for structural pattern recognition. The matching procedure is based on a state space search utilizing heuristic information. Some experimental results are reported.

[1]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Heinrich Niemann,et al.  Model Based Analysis of Scintigraphic Image Sequences of the Human Heart , 1983 .

[3]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

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

[5]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[7]  Bharat K. Bhargava,et al.  Tree Systems for Syntactic Pattern Recognition , 1973, IEEE Transactions on Computers.

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

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