Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers

Minsu Cho 1, 2 Jian Sun 1, 3 Olivier Duchenne 4 Jean Ponce 1, 2
1 WILLOW - Models of visual object recognition and scene understanding
CNRS - Centre National de la Recherche Scientifique : UMR8548, Inria Paris-Rocquencourt, DI-ENS - Département d'informatique de l'École normale supérieure
2 LIENS - Laboratoire d'informatique de l'école normale supérieure
3 Xjtu - Xi'an Jiaotong University
4 INTEL
Abstract : A major challenge in real-world feature matching problems is to tolerate the numerous outliers arising in typical visual tasks. Variations in object appearance, shape, and structure within the same object class make it harder to distinguish inliers from outliers due to clutters. In this pa- per, we propose a max-pooling approach to graph matching, which is not only resilient to deformations but also remarkably tolerant to outliers. The proposed algorithm evaluates each candidate match using its most promising neighbors, and gradually propagates the corresponding scores to update the neighbors. As final output, it assigns a reliable score to each match together with its supporting neighbors, thus providing contextual information for further verification. We demonstrate the robustness and utility of our method with synthetic and real image experiments.
Type de document :
Communication dans un congrès
CVPR - IEEE Conference on Computer Vision and Pattern Recognition, Jun 2014, Columbus, Ohio, United States. 2014
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01053675
Contributeur : Minsu Cho <>
Soumis le : vendredi 1 août 2014 - 01:19:31
Dernière modification le : mardi 24 avril 2018 - 17:20:13
Document(s) archivé(s) le : mardi 25 novembre 2014 - 22:41:14

Fichier

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

Identifiants

  • HAL Id : hal-01053675, version 1

Collections

INRIA | PSL

Citation

Minsu Cho, Jian Sun, Olivier Duchenne, Jean Ponce. Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers. CVPR - IEEE Conference on Computer Vision and Pattern Recognition, Jun 2014, Columbus, Ohio, United States. 2014. 〈hal-01053675〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

487

Téléchargements de fichiers

216

Contact


archive-ouverte@inria.fr