An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 10, Issue 5, 1988, Pages 695-703

  Umeyama, Shinji ^a  

^a ELECTROTECHNICAL LABORATORY   (Japan)

Author keywords

Eigendecomposition; inexact matching; structural description; structural pattern recognition; weighted graph matching

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL TECHNIQUES -- GRAPH THEORY;

ADJACENCY MATRICES; EIGENDECOMPOSITIONS; PATTERN MATCHING; WEIGHTED GRAPH MATCHING PROBLEMS (WGMP);

PATTERN RECOGNITION;

EID: 0024069925     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.6778     Document Type: Article

References (8)

1. W. H. Tsai and K. S. Fu, “Error-correcting isomorphisms of attributed relational graphs for pattern analysis”, IEEE Trans. Syst., Man, Cybernet., vol. SMC-9, pp. 757–768. Dec. 1979. ‘2] H. S. Baird, Model-Based Image Matching Using Location. Cambridge, MA: M.I.T. Press, 1985.
2. M. You and A. K. C. Wong, “An algorithm for graph optimal isomorphism”, in Proc. 1984 ICPR, pp. 316-319, 1984.
3. L. Kitchen and A. Rosenfeld, “Discrete relaxation for matching relational structures”, IEEE Trans. Syst., Man, Cybernet., vol. SMC-9, pp. 869–874, Dec. 1979.
4. L. Kitchen, “Relaxation applied to matching quantitative relational structures”, IEEE Trans. Syst., Man, Cybernet., vol. SMC-10, pp. 96–101, Feb. 1980.
5. M. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman, 1979.'
6. D. Dubois and H. Prade, Fuzzy Sets and Systems: Theory and Applications. New York: Academic, 1980.
7. A. J. Hoffman and H. W. Wielandt, “The variation of the spectrum of a normal matrix”, Duke Math. J., vol. 20, pp. 37–39, 1953.
8. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithm and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.