Issue No. 05 - September (1988 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.6778
<p>An approximate solution to the weighted-graph-matching problem is discussed for both undirected and directed graphs. The weighted-graph-matching problem is that of finding the optimum matching between two weighted graphs, which are graphs with weights at each arc. The proposed method uses an analytic instead of a combinatorial or iterative approach to the optimum matching problem. Using the eigendecompositions of the adjacency matrices (in the case of the undirected-graph-matching problem) or Hermitian matrices derived from the adjacency matrices (in the case of the directed-graph-matching problem), a matching close to the optimum can be found efficiently when the graphs are sufficiently close to each other. Simulation results are given to evaluate the performance of the proposed method.</p>
pattern recognition; eigendecomposition; weighted graph matching; adjacency matrices; undirected-graph-matching; Hermitian matrices; directed-graph-matching; eigenvalues and eigenfunctions; graph theory; pattern recognition
S. Umeyama, "An Eigendecomposition Approach to Weighted Graph Matching Problems," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 10, no. , pp. 695-703, 1988.