The Community for Technology Leaders
Image Analysis and Processing, International Conference on (1999)
Venice, Italy
Sept. 27, 1999 to Sept. 29, 1999
ISBN: 0-7695-0040-4
pp: 1166
Richard Myers , University of York
Richard C. Wilson , University of York
Edwin R. Hancock , University of York
ABSTRACT
This paper describes a novel framework for comparing and matching corrupted relational graphs. The normalized edit distance of Marzal and Vidal can 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 this criterion 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.
INDEX TERMS
CITATION

R. C. Wilson, E. R. Hancock and R. Myers, "Bayesian Graph Edit Distance," Image Analysis and Processing, International Conference on(ICIAP), Venice, Italy, 1999, pp. 1166.
doi:10.1109/ICIAP.1999.797761
95 ms
(Ver 3.3 (11022016))