Error correcting graph matching: on the influence of the underlying cost function

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 21, Issue 9, 1999, Pages 917-922

  Bunke, H ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; ERROR CORRECTION; GRAPH THEORY;

ERROR CORRECTING GRAPH MATCHING; GRAPH EDIT DISTANCE; GRAPH ISOMORPHISM; MAXIMUM COMMON SUBGRAPH; SUBGRAPH ISOMORPHISM;

PATTERN MATCHING;

EID: 0033188822     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.790431     Document Type: Article

References (17)

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, pp. 588-597, May 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, 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, pp. 31-42, 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. Messmer and H. Bunke, "A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, pp. 493-505, 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, no. 11, pp. 1,168-1,180, Nov. 1989.
13. R.A. Wagner and M.J. Fischer, "The String-to-String Correction Problem," J. ACM, vol. 21, no. 1, pp. 168-173, 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.