Issue No. 06 - June (2000 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.862201
<p><b>Abstract</b>—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 [<ref type="bib" rid="bibI06281">1</ref>]. 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.</p>
Graph matching, edit-distance, Bayesian, MAP estimation, stereo images.
Richard Myers, Edwin R. Hancock, Richard C. Wilson, "Bayesian Graph Edit Distance", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 22, no. , pp. 628-635, June 2000, doi:10.1109/34.862201