Location of Repository

Bayesian graph edit distance

By R. Myers, E.R. Hancock and R.C. Wilson


This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate matches using MAP label updates. We compare the resulting graph-matching algorithm with that recently reported by Wilson and Hancock. The use of edit-distance offers an elegant alternative to the exhaustive compilation of label dictionaries. Moreover, the method is polynomial rather than exponential in its worst-case complexity. We support our approach with an experimental study on synthetic data and illustrate its effectiveness on an uncalibrated stereo correspondence problem. This demonstrates experimentally that the gain in efficiency is not at the expense of quality of match

Year: 2000
DOI identifier: 10.1109/34.862201
OAI identifier: oai:eprints.whiterose.ac.uk:1988

Suggested articles


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