%0 Conference Proceedings
%@isbn 978-85-7669-273-7
%A Hancock, Edwin R.,
%A Wilson, Richard C.,
%@affiliation Department of Computer Science of University of York
%@affiliation Department of Computer Science of University of York
%T Active graph matching
%B Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, 8 (SIBGRAPI)
%D 1995
%E Lotufo, Roberto de Alencar,
%E Mascarenhas, Nelson Delfino d'Ávila,
%S Anais
%8 25 - 27 out. 1995
%J Porto Alegre
%I Sociedade Brasileira de Computação
%C São Carlos
%K simulation study, machine vision, graph representation.
%X This 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 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.
%P 1-13
%@language en
%9 Palestras Internacionais
%3 1 Active graph matching.pdf