A graph isomorphism algorithm for object recognition

Pattern Analysis and Applications

Volumn 1, Issue 3, 1998, Pages 189-201

  Abdulrahim, M A ^a   Misra, M ^a  

^a Department of Geology and Geological Engineering   (United States)

Author keywords

Graph isomorphism; Graph matching; Labelled graphs; Local consistency; Object recognition; Pattern recognition; Random graphs

Indexed keywords

EID: 22444455831     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01259368     Document Type: Article

References (24)

1. Eshera MA, King-Sun Fu. A graph distance measure for image analysis. IEEE Trans Systems, Man Cybern 1984; 14(3)
2. Wong EK. Model matching in robot vision by subgraph isomorphism. Pattern Recognition 1992; 25(3): 287-303
3. Chen T-W, Lin W-C. A neural network approach to CSG-based 3-D object recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 1994; 16(7)
4. Peng M, Gupta NK. Invariant and occluded object recognition based on graph matching. Int J Elec Engg Educ 1995; 32: 31-38
5. Messmer DT, Bunke H. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 1988; 20(5): 493-504
6. Xu J. GMA: A Generic Match Algorithm for structural homomorphism, isomorphism, and maximal common substructure match and its applications. J Chem Infor Comput Sci 1996; 36(1): 25-34
7. Suganthan PN, Teoh EK, Mital DP. Pattern recognition by homomorphic graph matching using hopfield neural networks. Image Vision Comput 1995; 13(1)
8. Gold S, Rangarajan A. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 1996; 18(4): 309-319
9. Read RC, Corneil DO. The graph isomorphism disease. Journal Graph Theory 1977; 1: 339-363
10. Liu X, Klein DJ. The graph isomorphism problem. Journal Computational Chemistry 1991; 12(10): 1243-1251
11. Rao AC, Varada Raju D. Application of the Hamming number technique to detect isomorphism among kinematic chains and inversions. Mech Mach Theory 1991; 26(1): 55-75
12. Das N, Bhattacharya BB, Dattagupta J. Isomorphism of conflict graphs in multistage interconnection networks and its application to optimal routing. IEEE Trans Comput 1993; 42(6): 665-677
13. Ambler AP, Barrow HG, Brown CM, Burstall RM, Popplestone RJ. A versatile computer-controlled assembly system. Proceedings of Third International Joint Conference on Artificial Intelligence 1973; 298-307
14. Cornell DG, Mathon RA. Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations. Discrete Math 1978; 2: 1-32
15. Garey MR Johnson DS. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979
16. Luks EM. Isomorphism of graphs of bounded valence can be tested in polynomial time. J Comput Syst Sci 1982; (25): 42-65
17. Corneil DG, Gotlieb CC. An efficient algorithm for graph isomorphism. J ACM 1970; 17(1)
18. Babai L, Erdos P, Selkow S. Random graph isomorphism. SIAM J Comput 1980; 9(3): 628-635
19. Babai L. On the complexity of canonical labeling of strongly regular graphs. SIAM J Comput 1980; 9(1): 212-216
20. Spielman DA. Faster isomorphism testing of strongly regular graphs. Technical report, University of California Berkeley, Computer Science Division, Berkeley, California 94720, 1996. Can be retrieved from http://theory.lcs.mit.edu/spielman/Berk/grisom.html
21. von der Malsburg C, Bienenstock E. A neural network for retrieval of superimposed connection patterns. Europhysics Letters 1987; 3(11): 1243-1249
22. Bienenstock E, von der Malsburg C. A neural network for invariant pattern recognition. Europhysics Letters 1987; 4(1): 121-126
23. Abdulrahim M, Misra M. A practical algorithm for labeled graph isomorphism. Technical Report CSM-MACS-97-16, Colorado School of Mines, Department of Mathematical and Computer Sciences, Golden, Colorado, December 1997
24. Merck KGaA Darmstadt. The relibase system, 1997. Joint work between Merck KGaA Darmstadt and University of Marburg. Can be accessed at http://www2.ebi.ac.uk:8081/home.html.