This paper describes a novel framework for comparing and matching corrupted relational graphs. The normalised edit distance of Marzal and Vidal (1993) 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 this criterion with that recently reported by Wilson and Hancock (1997). 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.
Bayesian graph edit distance
1999-01-01
125849 byte
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 1999
|Edit distance from graph spectra
IEEE | 2003
|Edit Distance from Graph Spectra
British Library Conference Proceedings | 2003
|Approximate graph edit distance computation by means of bipartite graph matching
British Library Online Contents | 2009
|