The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1997 vol.19)
pp: 634-648
ABSTRACT
<p><b>Abstract</b>—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 focus 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 of 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.</p>
INDEX TERMS
Structural graph matching, discrete relaxation, energy minimization, Bayesian, graph edit, clutter, MAP estimation, SAR images, infrared images.
CITATION
Richard C. Wilson, Edwin R. Hancock, "Structural Matching by Discrete Relaxation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.19, no. 6, pp. 634-648, June 1997, doi:10.1109/34.601251
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool