By Topic

Symbolic graph matching using the EM algorithm and singular value decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. Luo ; Dept. of Comput. Sci., York Univ., UK ; E. R. Hancock

This paper describes an efficient algorithm for inexact graph-matching. The method is purely structural, i.e., it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions: 1) commencing from a probability distribution for matching errors, we show how the problem of graph-matching can be posed as maximum likelihood estimation using the apparatus of the EM algorithm; and 2) casting the recover of correspondences matches between the graph-nodes in a matrix framework. This allows us to efficiently recover correspondence matches using singular value decomposition. We experiment with the method on both real-world and synthetic data. We demonstrate that the method offers comparable performance to more computationally demanding methods

Published in:

Pattern Recognition, 2000. Proceedings. 15th International Conference on  (Volume:2 )

Date of Conference: