An algorithm using length-r paths to approximate subgraph isomorphism

Pattern Recognition Letters

Volumn 24, Issue 1-3, 2003, Pages 33-46

  DePiero, Fred ^a   Krout, David ^a  

^a CALIFORNIA POLYTECHNIC STATE UNIVERSITY   (United States)

Author keywords

Approximate graph matching; Attributed relational graphs; Subgraph isomorphism

Indexed keywords

APPROXIMATION THEORY; COLORING; POLYNOMIALS;

SUBGRAPH ISOMORPHISM;

PATTERN RECOGNITION;

ALGORITHM;

EID: 0037233253     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00186-1     Document Type: Article

References (33)

1. Barrow, H.G., Burstall, R.M., 1976, Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters 4, 83-84.
2. Bolles, R.C., Cain, R.A., 1982. Recognizing and locating partially visible objects: the local-feature-focus method. International Journal of Robotics Research 1 (3), 1236-1253.
3. Bunke, H., Allerman, G., 1983. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1 (4), 245-253.
4. Christmas, W.J., Kittler, J., Petrou, M., 1995. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-17, 749-764.
5. Christmas, W.J., Kittler, J., Petrou, M., 1996a. Probabilistic feature-labeling schemes: modeling compatibility coefficient distributions. Image and Vision Computing 14, 617-625.
6. Christmas, W.J., Kittler, J., Petrou, M., 1996b. Labeling 2-D geometric primitives using probabilistic relaxation: reducing the computational requirements. Electronic Letters 32 (4), 312-314.
7. Costa, M.S., Shapiro, L.G., 1996. Scene analysis using appearance-based models and relational indexing. IEEE Symposium on Computer Vision, Coral Gables, FL, 103-108.
8. Cross, A.D.J., Hancock, E.R., 1998. Graph matching with a dual-step EM algorithm. IEEE Transaction of Pattern Analysis and Machine Intelligence 20 (11), 1236-1253.
9. DePiero, F.W., Trivedi, M.M., Serbin, S., 1996. Graph matching using a direct classification of node attendance. Pattern Recognition Journal 29 (6), 1031-1048.
10. Eshera, M.A., Fu, K.S., 1984. A graph distance measure for image analysis. IEEE Transaction of Systems, Man and Cybernetics 14 (3), 398-408.
11. Foulds, L.R., 1992. Graph theory applications. Springer-Verlag, New York.
12. Gold, S., Rangarajan, A., 1996. A graduated assignment algorithm for graph matching. IEEE Transaction of Pattern Analysis and Machine Intelligence 18 (4), 377-388.
13. Grimson, W.E.L., 1990. Object recognition by computer. MIT Press.
14. Hummel, R., Zucker, S., 1983. On the foundations of relaxation labeling processes. IEEE Transaction of Pattern Analysis and Machine Intelligence 5, 267-287.
15. Kittler, J., Petrou, M., Christmas, W.J., 1998. Non-iterative contextual correspondence matching. Pattern Recognition Journal 31 (10), 1455-1468.
16. Krout, D.W., 2001. LeRP: An algorithm for finding subgraph isomorphisms with applications to VLSI, Master's Thesis Cal Poly State University, San Luis Obispo, CA.
17. Lamden, Y., Wolfson, H., 1998. Geometric hashing: a general and efficient model-based recognition scheme. In: Proceedings of 2nd International Conference On Computer Vision, Tarpon Springs, FL, pp. 238-249.
18. Luo, B., Hancock, E.R., 2001. Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transaction of Pattern Analysis and Machine Intelligence 23 (10), 1120-1136.
19. McKay, B., 1981. Practical graph isomorphism. Congressus Numerantium 30, 45-87.
20. Messmer, B.T., Bunke, H., 1998. A new algorithm for errortolerant subgraph isomorphism detection. IEEE Transaction of Pattern Analysis and Machine Intelligence 20 (5), 493-504.
21. Myers, R., Wilson, R.C., Hancock, E.R., 2000. Bayesian graph edit distance. IEEE Transaction of Pattern Analysis and Machine Intelligence 22 (6), 628-635.
22. Nillson, N.J., 1980. Principles of artificial intelligence. Tioga, Palo Alto, CA.
23. Palmer, E.M., 1985. Graphical Evolution-An Introduction to the Theory of Random Graphs. Wiley-Interscience.
24. Read, R.C., Corneil, D.G., 1977. The graph isomorphism disease. Journal of Graph Theory 1 (1), 339-363.
25. Rosenfeld, A., Hummel, R., Zucker, S., 1976. Scene labeling by relaxation operators. IEEE Transaction of Systems, Man and Cybernetics 6, 420-453.
26. Sanfeliu, A., Fu, K.S., 1983. A distance measure between attributed relational graphs for pattern recognition. IEEE Transaction of Systems, Man and Cybernetics 13, 353-363.
27. Shafer, G., 1976. A mathematical theory of evidence. Princeton University Press, Princeton, New Jersey.
28. Shapiro, L.G., Haralick, R.M., 1981. Structural descriptions and inexact matching. IEEE Transaction of Pattern Analysis and Machine Intelligence 3 (5), 504-519.
29. Shapiro, L.G., Haralick, R.M., 1985. A metric for comparing relational descriptions. IEEE Transaction of Pattern Analysis and Machine Intelligence 7, 90-94.
30. Stockman, G., 1987. Object recognition and localization via pose clustering. Computer Vision, Graphics and Image Processing 40, 361-387.
31. West, D.B., 2001. Introduction to Graph Theory, second ed. Prentice-Hall, Upper Saddle River, NJ.
32. Wilson, R.C., Hancock, E.R., 1997. Structural matching by discrete relaxation. IEEE Transaction of Pattern Analysis and Machine Intelligence 19 (6), 634-648.
33. Wong, E.K., 1990. Three-dimensional object recognition by attributed graphs. In: Bunke, H., Sanfeliu, A. (Eds.), Syntactic and Structural Pattern Recognition Theory and Applications. World Scientific, pp. 381-414.