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




Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 WILLOW - Models of visual object recognition and scene understanding DI-ENS - Département d-informatique de l-École normale supérieure, ENS Paris - École normale supérieure - Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548 2 LIENS - Laboratoire d-informatique de l-école normale supérieure 3 Xi-an Jiaotong University Chine 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.





Autor: Minsu Cho - Jian Sun - Olivier Duchenne - Jean Ponce -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados