Location of Repository

Structural graph matching using the EM algorithm and singular value decomposition

By E.R. Hancock and B. Luo

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 method

Year: 2001
DOI identifier: 10.1109/34.954602
OAI identifier: oai:eprints.whiterose.ac.uk:1990

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.