This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
September 1999 (vol. 21 no. 9)
pp. 917-922

Abstract—This paper investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost function, there are an infinite number of other cost functions that lead, for any given pair of graphs, to the same optimal error correcting matching. Furthermore, it is shown that well-known concepts from graph theory, such as graph isomorphism, subgraph isomorphism, and maximum common subgraph, are special cases of optimal error correcting graph matching under particular cost functions.

[1] S. W.Lu, Y. Ren, and C.Y. Suen, "Hierarchical Attributed Graph Representation And Recognition Of Handwritten Chinese Characters," Pattern Recognition, vol. 24, pp. 617-632, 1991.
[2] J. Rocha and T. Pavlidis, "A Shape Analysis Model With Applications to a Character Recognition System," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 393-404, 1994.
[3] Y.-K. Wang, K.-C. Fan, and J.-T. Horng, “Genetic-Based Search for Error-Correcting Graph Isomorphism,” IEEE Trans. Systems, Man, and Cybernetics, vol. 27, no. 4, pp. 588-597, 1997.
[4] S.W. Lee, J.H. Kim, and F.C.A. Groen, “Translation-, Rotation-, and Scale-Invariant Recognition of Hand-Drawn Symbols in Schematic Diagrams,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 4, no. 1, pp. 1-15, 1990.
[5] A. Pearce, T. Caelli, and W.F. Bischof, “Rulegraphs for Graph Matching in Pattern Recognition,” Pattern Recognition, vol. 27, no. 9, pp. 1,231-1,246, 1994.
[6] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749–764, Aug. 1995.
[7] E.K. Wong, “Model Matching in Robot Vision by Subgraph Isomorphism,” Pattern Recognition, vol. 25, no. 3, pp. 287-304, 1992.
[8] J.R. Ullman, “An Algorithm for Subgraph Isomorphism,” J. ACM, vol. 23, no. 1, Jan. 1976.
[9] L.G. Shapiro and R.M. Haralick, “Structural Descriptions and Inexact Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 504-519, 1981.
[10] B.T. Messmer and H. Bunke, “A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 5, pp. 493-504, May 1998.
[11] A. Sanfeliu and K.S. Fu, “A Distance Measure between Attributed Relational Graphs for Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 13, pp. 353-363, 1983.
[12] R. Horaud and T. Skordas, “Stereo Correspondence Through Feature Grouping and Maximal Cliques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 1,168-1,180, 1989.
[13] R.A. Wagner and M.J. Fischer, "The String-to-String Correction Problem," J. ACM, vol. 21, no. 1, pp. 168-78, 1974.
[14] L. Herault, R. Horaud, F. Veillon, and J.J. Niez, “Symbolic Image Matching by Simulated Annealing,” Proc. British Machine Vision Conf., pp. 319-324, Oxford, U.K., 1990.
[15] L. Xu and E. Oja, “Improved Simulated Annealing, Boltzmann Machine, and Attributed Graph Matching,” Lecture Notes in Computer Science 412, L. Almeida, ed., pp. 151-161, Springer Verlag, 1990.
[16] H. Bunke, “On a Relation Between Graph Edit Distance and Maximum Common Subgraph,” Pattern Recognition Letters, vol. 18, pp. 689-694, 1997.
[17] S. Rice, H. Bunke, and T. Nartker, “Classes of Cost Functions for String Matching,” Algorithmica, vol. 18, no. 2, pp. 271-280, 1997.

Index Terms:
Graph, subgraph, maximum common subgraph, graph isomorphism, subgraph isomorphism, graph matching, error correcting graph matching, cost function, edit operation, graph edit distance.
Citation:
H. Bunke, "Error Correcting Graph Matching: On the Influence of the Underlying Cost Function," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 9, pp. 917-922, Sept. 1999, doi:10.1109/34.790431
Usage of this product signifies your acceptance of the Terms of Use.