A Novel Isomorphism Based on Nearest Neighbours for Efficient Graph Matching Algorithm

Proceedings of the 7th International Conference on Control, Automation, Robotics and Vision, ICARCV 2002

Volumn , Issue , 2002, Pages 722-727

  Piriyakumar, Douglas Antony Louis ^a   Levi, Paul ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Graph Isomorphism; Graph Matching; NP complete Problem; Pattern Recognition; Vision

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER VISION; GRAPH THEORY; IMAGE SENSORS; INVERSE PROBLEMS; MATRIX ALGEBRA; PATTERN RECOGNITION; PROBLEM SOLVING; EIGENVALUES AND EIGENFUNCTIONS; ERROR CORRECTION; MEDICAL IMAGING; REAL TIME SYSTEMS; ROBOTICS; SET THEORY; VISION;

GRAPH ISOMORPHISM; GRAPH MATCHING; NODE NEIGHBOUR ISOMORPHISM (NNI); SINGLE VALUE DECOMPOSITION; EIGENDECOMPOSITION; GRAPH MATCHING ALGORITHMS; NP-COMPLETE PROBLEM;

ROBOTICS; GRAPHIC METHODS;

EID: 2342439866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Shapiro, L.G. and Haralick, R.M., "Structural Descriptions and Inexact matching," IEEE T Pattern Analysis and Machine Intelligence, vol. 3, pp. 504-519, September, 1981.
2. Gold, S. and Rangarajan, A., "A Graduated Assignment Algorithm for Graph Matching," IEEE. T Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp.377-388, April, 1996.
3. Schmidt, D.C., "A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices," J Association of Computing Machinery, vol. 23, no. 3, pp. 433-445, July, 1976.
4. Berztiss, A. T., "A Backtrack Procedure for Isomorphism of Directed Graphs," J Association of Computing Machinery, vol. 20, no. 3, pp. 365-377, July 1973.
5. Lawler, E. and Wood, D., "Branch and Bound Methods: A Survey," Operations Research, vol. 14, pp. 699-719, July-August, 1966.
6. Christmas, W.J., Kittler, J. and Petrou, M., "Structural Matching in Computer Vision using Probabilistic Relaxations," IEEE. T Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749-764, August, 1995.
7. Douglas A L Piriyakumar, and Paul Levi, "An Efficient A* based Algorithm for Optimal Graph Matching applied to Computer Vision," Proceedings of GRWSIA-98, pp.16-24, September, Herrsching, 1998.
8. Nilson, N.J. Principles of Artificial Intelligence, Palo Alto, Calif, Tiaga Publications, 1980.
9. Corneil, D.G. and Gotleib, C.C., "An Efficient Algorithm for Graph Isomorphism," J Association of Computing Machinery, vol. 17, no. 1, pp. 51-64, January 1970.
10. Shiji Umeyama, "An Eigendecomposition approach to weighted graph matching problems," IEEE. T Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp.695-703, September 1988.
11. Bruno T. Messmer and Horst Bunke, "A new algorithm for error- tolerant subgraph isomorphism detection," IEEE. T Pattern Analysis and Machine Intelligence, vol.20, no.5, pp. 493-504, May 1998.
12. Horst Bunke, "Error correcting Graph Matching: On the influence of the underlying cost function," IEEE. T Pattern Analysis and Machine Intelligence, vol. 21, no. 9, pp. 917-922, September 1999.
13. Bin Luo and Edwin R. Hancock, "Structural graph matching using EM algorithm and single value decomposition," IEEE. T Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1120-1136, October 2001.
14. Benoit Huet and Edwin R. Hancock, "Line Pattern Retrieval Using Relational Histograms, IEEE. T Pattern Analysis and Machine intelligence, vol. 21, no. 12, pp. 1363-1370, December 1999.
15. J.R.Ullman, "An Algorithm for Subgraph Isomorphism," J Association of Computing Machinery, vol. 23, no. 1, pp.31-42, 1976.
16. Douglas A L Piriyakumar, and Paul Levi, " On the Symmetries of Regular Repeated Objects Using Graph Theory Based Novel Isomorphism," The 5th International Conference on PATTERN RECOGNITION and IMAGE ANALYSIS: NEW INFORMATION TECHNOLOGIES (PRIA-5-2000), Samara, The Russian Federation, 2000.
17. Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-wesley, 1975.