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

Graph matching with a dual-step EM algorithm

Cross, A.D.J. and Hancock, E.R. (1998) Graph matching with a dual-step EM algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence. pp. 1236-1253. ISSN 0162-8828

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

Download (3785Kb)

Abstract

This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifying point-correspondence matches. Unification is realized by constructing a mixture model over the bipartite graph representing the correspondence match and by affecting optimization using the EM algorithm. According to our EM framework, the probabilities of structural correspondence gate contributions to the expected likelihood function used to estimate maximum likelihood transformation parameters. These gating probabilities measure the consistency of the matched neighborhoods in the graphs. The recovery of transformational geometry and hard correspondence matches are interleaved and are realized by applying coupled update operations to the expected log-likelihood function. In this way, the two processes bootstrap one another. This provides a means of rejecting structural outliers. We evaluate the technique on two real-world problems. The first involves the matching of different perspective views of 3.5-inch floppy discs. The second example is furnished by the matching of a digital map against aerial images that are subject to severe barrel distortion due to a line-scan sampling process. We complement these experiments with a sensitivity study based on synthetic data.

Item Type: Article
Copyright, Publisher and Additional Information: Copyright © 1998 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: EM algorithm, graph-matching, affine geometry, perspective geometry, relational constraints, Delaunay graph, discrete relaxation, DELAUNAY TRIANGULATION, WEAK-PERSPECTIVE, SHAPE MODELS, POINT, POSE, RECOGNITION, IMAGES, PARAPERSPECTIVE, REPRESENTATION, PATTERNS
Academic Units: The University of York > Computer Science (York)
Depositing User: Repository Officer
Date Deposited: 21 Feb 2007
Last Modified: 17 Oct 2013 14:40
Published Version: http://dx.doi.org/10.1109/34.730557
Status: Published
Refereed: Yes
Related URLs:
URI: http://eprints.whiterose.ac.uk/id/eprint/1986

Actions (login required)

View Item View Item