Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition

  • Authors:
  • Bin Luo;Edwin R. Hancock

  • Affiliations:
  • Univ. of , York, UK and Anhui Univ., Peoples Republic of China;Univ. of York, York, UK

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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