An improved algorithm for relational distance graph matching

Pattern Recognition

Volumn 29, Issue 2, 1996, Pages 349-359

  Cinque, Luigi ^a   Yasuda, Dean ^b   Shapiro, Linda G ^b,c,d   Tanimoto, Steven L ^b   Allen, Robert ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b University of Washington   (United States)

^c Sunflower Networking Group   (United States)

^d VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Forward checking; Graph matching; Inexact matching; Relational distance; Structural description; Tree search

Indexed keywords

ALGORITHMS; COMPUTER VISION; GRAPH THEORY; IMAGE ANALYSIS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

FORWARD CHECKING; INEXACT MATCHING; RELATIONAL DISTANCE GRAPH MATCHING; STRUCTURAL DESCRIPTION;

PATTERN RECOGNITION;

EID: 0030084862     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(95)00089-5     Document Type: Article

References (11)

1. H. G. Borrow, A. P. Ambler and R. M. Burstall, Some techniques for recognizing structures in pictures, Frontiers of Pattern Recognition, pp. 1-29, Academic Press, New York (1972).
2. J. R. Ullman, An algorithm for subgraph homomorphisms, J. Ass. Comput. Mach. 23, 31-42 (1976).
3. A. Rosenfeld, R. A. Hummel and S. W. Zucker, Scene labeling by relaxaton operators. IEEE Trans. Syst. Man Cybernet. SMC-6, 420-443 (1976).
4. R. M. Haralick and G. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Proc. 6th Int. Joint Conf. Artif. Intell. (1979).
5. R. M. Haralick and L. G. Shapiro, The consistent labeling problem: Part 1, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1, 173-184 (1979).
6. L. G. Shapiro and R. M. Haralick, Structural descriptions and inexact matching, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-3, 504-519 (1981).
7. L. G. Shapiro and R. M. Haralick, A metric for computing relational description, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-7, 90-94 (1985).
8. A. Sanfelieu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst. Man Cybernet. SMC-13, 353-362 (1983).
9. K. Sengupta and K. L. Boyer, Information theoretic clustering of large structural modelbases, Proc. IEEE Conf. Comput. Vis. Pattern Recognition 174-179 (1993).
10. R. M. Haralick and J. Kartus, Arrangements, homomorphisms, and discrete relaxation, IEEE Trans. Syst. Man Cybernet. SMC-13, 600-612 (1976).
11. R. Allen, D. Yasuda, S. Tanimoto, L. Shapiro and L. Cinque, A parallel algorithm for graph matching and its MasPar implementation, Proc. IEEE Workshop Comput. Architect. Mach. Percept. 13-18 (1993).