Skip to main content
Article thumbnail
Location of Repository

Structural matching by discrete relaxation

By R C Wilson and E R Hancock

Abstract

This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we locus on the issue of how relational inexactness may be quantified. We illustrate that several popular relational distance measures can be recovered as specific limiting cases of the Bayesian consistency measure. The second aspect of our comparison concerns the way in which structural inexactness is controlled. We investigate three different realizations ai the matching process which draw on contrasting control models. The main conclusion of our study is that the active process of graph-editing outperforms the alternatives in terms of its ability to effectively control a large population of contaminating clutter

Year: 1997
DOI identifier: 10.1109/34.601251
OAI identifier: oai:eprints.whiterose.ac.uk:1985

Suggested articles


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