A distance measure between attributed relational graphs for pattern recognition

A method to determine a distance measure between two nonhierarchical attributed relational graphs is presented. In order to apply this distance measure, the graphs are characterised by descriptive graph grammars (DGG). The proposed distance measure is based on the computation of the minimum number of modifications required to transform an input graph into the reference one. Specifically, the distance measure is defined as the cost of recognition of nodes plus the number of transformations which include node insertion, node deletion, branch insertion, branch deletion, node label substitution and branch label substitution. The major difference between the proposed distance measure and the other ones is the consideration of the cost of recognition of nodes in the distance computation. In order to do this, the principal features of the nodes are described by one or several cost functions which are used to compute the similarity between the input nodes and the reference ones. Finally, an application of this distance measure to the recognition of lower case handwritten English characters is presented.

[1]  H. Genchi,et al.  Recognition of handwritten numerical characters for automatic letter sorting , 1968 .

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

[3]  S. Boorman,et al.  Metrics on spaces of finite trees , 1973 .

[4]  Alfs T. Berztiss,et al.  A Backtrack Procedure for Isomorphism of Directed Graphs , 1973, JACM.

[5]  Douglas C. Schmidt,et al.  A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices , 1976, J. ACM.

[6]  King-sun Fu,et al.  Error-Correcting Tree Automata for Syntactic Pattern Recognition , 1978, IEEE Transactions on Computers.

[7]  Shin-Yee Lu.  A Tree-to-Tree Distance and Its Application to Cluster Analysis , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  King-Sun Fu,et al.  A Pattern Deformational Model and Bayes Error-Correcting Recognition System , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.

[10]  King-Sun Fu,et al.  Picture Syntax , 1980, Pictorial Information Systems.

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

[12]  Michael G. Thomason,et al.  Syntactic Methods in Pattern Recognition , 1982 .

[13]  King-Sun Fu,et al.  Tree graph grammars for pattern recognition , 1982, Graph-Grammars and Their Application to Computer Science.

[14]  King-Sun Fu,et al.  Subgraph error-correcting isomorphisms for syntactic pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.