Symbolic Image Matching by Simulated Annealing

Abstract : In this paper we suggest an optimisation approach to visual matching. We assume that the information available in an image may be conveniently represented symbolically in a relational graph. We concentrate on the problem of matching two such graphs. First we derive a cost function associated with graph matching and more precisely associated with subgraph isomorphism and with maximum subgraph matching. This cost function is well suited for optimization methods such as simulated annealing. We show how the graph matching problem is easily cast into a simulated annealing algorithm. Finally we show some preliminary experimental results and discuss the utility of this graph matching method in computer vision in general.
Type de document :
Communication dans un congrès
4th British Machine Vision Conference (BMVC '90), Sep 1990, Oxford, United Kingdom. The British Machine Vision Association (BMVA), pp.319--324, 1990, 〈http://www.bmva.org/bmvc/1990/bmvc-90-057.pdf〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00589994
Contributeur : Team Perception <>
Soumis le : mardi 3 mai 2011 - 08:28:52
Dernière modification le : mercredi 11 avril 2018 - 01:55:19
Document(s) archivé(s) le : jeudi 4 août 2011 - 02:35:26

Fichier

HeraultHoraudBMVC90.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00589994, version 1

Collections

Citation

Laurent Hérault, Radu Horaud, Françoise Veillon, Jean-Jacques Niez. Symbolic Image Matching by Simulated Annealing. 4th British Machine Vision Conference (BMVC '90), Sep 1990, Oxford, United Kingdom. The British Machine Vision Association (BMVA), pp.319--324, 1990, 〈http://www.bmva.org/bmvc/1990/bmvc-90-057.pdf〉. 〈inria-00589994〉

Partager

Métriques

Consultations de la notice

371

Téléchargements de fichiers

99