The paper describes a novel approach to relational matching problems in machine vision. Rather than matching static scene descriptions, the approach adopts an active representation of the data to be matched. This representation is iteratively reconfigured to increase its degree of topological congruency with the model relational structure in a reconstructive matching process. The active reconfiguration of relational structures is controlled by a MAP update process. The final restored graph representation is optimal in the sense that it has maximum a posteriori probability with respect to the available attributes for the objects under match. The benefits of the technique are demonstrated experimentally on the matching of cluttered synthetic aperture radar data to a model in the form of a digital map. The operational limits of the method are established in a simulation study.<>
Relational matching with dynamic graph structures
1995-01-01
858907 byte
Conference paper
Electronic Resource
English
Relational Matching with Dynamic Graph Structures
British Library Conference Proceedings | 1995
|On the Problem of Attributed Relational Graph Matching
British Library Online Contents | 1992
|Self-organizing Hopfield network for attributed relational graph matching
British Library Online Contents | 1995
|Relational matching with stochastic optimisation
IEEE | 1995
|Relational Matching with Stochastic Optimisation
British Library Conference Proceedings | 1995
|