Using eigen-decomposition method for weighted graph matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4681 LNCS, Issue , 2007, Pages 1283-1294

  Zhao, Guoxing ^a   Luo, Bin ^b   Tang, Jin ^b   Ma, Jinxin ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

^b ANHUI UNIVERSITY   (China)

Author keywords

Graph matching; Intelligent computing; Pattern recognition

Indexed keywords

APPROXIMATION THEORY; DOMAIN DECOMPOSITION METHODS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; INTELLIGENT SYSTEMS;

EIGEN-DECOMPOSITION; GRAPH MATCHING; INTELLIGENT COMPUTING; WEIGHTED GRAPHS;

PATTERN MATCHING;

EID: 38049018153     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74171-8_131     Document Type: Conference Paper

References (16)

1. Almohamad, H.A.: A Polynomial Transformfor Matching Pairs of Weighted Graphs. Applied Mathematical Modelling, 15 (1991) 216-222
2. Almohamad, H.A., Duffuaa, S.O.: A Linear Programming Approach for the Weighted Graph Matching Problem. IEEE Trans. PAMI, 15 (1993) 522-525
3. Wyk, B.J.V.: Kronecker Product Successive Projection and Related Graph Matching Algorithms. Ph.D. diss., University of the Witwatersrand, Johannesburg (2002)
4. Davis, C., Kahan, W.M.: The Rotation of Eigenvectors by a Perturbation. Ill, SIAM J. Numer. Anal, 7 (1970) 1-46
5. Finch, A.M., Wilson R.C., Hancock, E.R.: Matching Delaunay Triangulations by Probabilistic Relaxation. Proc. of Computer Analysis of Images and Patterns, (1995) 350-358
6. Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. PAMI, 18 (1996) 377-388
7. Harold, W.K.: The Hungarian Method for the Assignment Problem. Naval Research Logistic Quarterly, 2 (1955) 83-97
8. Hummel, R., Zuker, S.: On the Foundations of Relaxation Labeling Processes. IEEE Trans. PAMI, 5 (1983) 267-287
9. Krcmar, M., Dhawan, A.P.: Application of Genetic Algorithms in Graph Matching. Proc. of the International Conference on Neural Networks, 6 (1994) 3872-3876
10. Ninoslav, T.: Relative Perturbation Theory for Matrix Spectral Decompositions. Ph.D. diss., Dept. of Mathematics, Univ. of Zagreb (2000)
11. Sanfeliu, A., Fu, K.S.: A Distance Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Trans. SMC, 13 (1983) 53-363
12. Stewart, G.W., Sun, J.: Matrix Perturbation Theory. Academic Press, Inc., San Diego (1990)
13. Suganthan, P., Teoh, E., Mital, D.: Pattern Recognition by Graph Matching Using the Potts MFT Neural Networks. Pattern Recognition, 28 (1995) 997-1009
14. Tasi, W.H., Fu, K.S.: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Recognition. IEEE Trans. SMC, 9 (1979) 757-768
15. Ullman, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the Association for Computing Machinery, 23 (1976) 31-42
16. Umeyama, S.: An Eigendecomposition Approach to Weighted Graph Matching Problems. IEEE Trans. PAMI, 10 (1988) 695-703