Learning an efficient and robust graph matching procedure for specific object recognition - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Learning an efficient and robust graph matching procedure for specific object recognition

Résumé

We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is automatically built. It contains its local keypoints as well as their spatial proximity relationships. Training is based on a selection of the most efficient subgraphs using the mutual information. The detection uses dynamic programming with a lattice and thus is very fast. Experiments demonstrate that the proposed method outperforms the specific object detectors of the state-of-the-art in realistic noise conditions.
Fichier non déposé

Dates et versions

hal-01381492 , version 1 (14-10-2016)

Identifiants

Citer

Jérôme Revaud, Guillaume Lavoué, Yasuo Ariki, Atilla Baskurt. Learning an efficient and robust graph matching procedure for specific object recognition. International Conference on Pattern Recognition (ICPR), Aug 2010, Istanbul, Turkey. pp.754-757, ⟨10.1109/ICPR.2010.190⟩. ⟨hal-01381492⟩
106 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More