White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Structural graph matching using the EM algorithm and singular value decomposition

Hancock, E.R. and Luo, B. (2001) Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence. pp. 1120-1136. ISSN 0162-8828

Full text available as:
[img]
Preview
Text (hancocker6.pdf)
hancocker6.pdf

Download (3908Kb)

Abstract

This paper describes an efficient algorithm for inexact graph matching. The method is purely structural, that is, 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) we cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows one to efficiently recover correspondence matches using the singular value decomposition. We experiment with the method on both real-world and synthetic data. Here, we demonstrate that the method offers comparable performance to more computationally demanding methods

Item Type: Article
Copyright, Publisher and Additional Information: Copyright © 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: Inexact graph matching, EM algorithm, matrix factorization, mixture models, Delaunay triangulations
Institution: The University of York
Academic Units: The University of York > Computer Science (York)
Depositing User: Repository Officer
Date Deposited: 21 Feb 2007
Last Modified: 16 Oct 2014 18:23
Published Version: http://dx.doi.org/10.1109/34.954602
Status: Published
Refereed: Yes
Related URLs:
URI: http://eprints.whiterose.ac.uk/id/eprint/1990

Actions (repository staff only: login required)