Unsupervised geodesic convex combination of shape dissimilarity measures - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Letters Année : 2017

Unsupervised geodesic convex combination of shape dissimilarity measures

Résumé

Dissimilarity or distance metrics are the cornerstone of shape matching and retrieval algorithms. As there is no unique dissimilarity measure that gives good performances in all possible configurations, these metrics are usually combined to provide reliable results. In this paper we propose to compute the best linear convex, or weighted, combination of any set of measured shape distances to enhance shape matching algorithms. To do so, a database is represented as a graph, where nodes are shapes and the edges carry the convex combination of dissimilarity measures. Weights are chosen to maximize the weighted distances between the query shape and shapes in the database. The optimal weights are solutions of a linear programming problem. This fully unsupervised method improves the outcomes of any set of shape similarity measures as shown in our experimental results performed on several popular 3D shape benchmarks. (C) 2017 Published by Elsevier B.V
Fichier non déposé

Dates et versions

hal-01620535 , version 1 (20-10-2017)

Identifiants

Citer

Bilal Mokhtari, Kamal Eddine Melkemi, Dominique Michelucci, Sebti Foufou. Unsupervised geodesic convex combination of shape dissimilarity measures. Pattern Recognition Letters, 2017, 98, pp.46 - 52. ⟨10.1016/j.patrec.2017.07.012⟩. ⟨hal-01620535⟩
86 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More