On the geodesic distance in shapes K-means clustering

Stefano Gattone 1 Angela De Sanctis 1 Stéphane Puechmorel 2 Florence Nicol 2
1 Ud'A - Università degli studi "G. d'Annunzio" Chieti-Pescara [Chieti-Pescara]
2 ENAC - Ecole Nationale de l'Aviation Civile
Abstract : Using Information Geometry tools, we represent landmarks of a complex shape as probability densities in a statistical manifold. Then, in the setting of shapes clustering through a K-means algorithm, we evaluate the discriminative power of two different shapes distances. The first, derived from Fisher-Rao metric, is related with the minimization of information in the Fisher sense and the other is derived from the Wasserstein distance which measures the minimal transportation cost.
Keywords : K-means algorithm Shape Analysis Fisher-Rao metric Wasserstein distance 6 clustering wasserstein distance 9
Type de document :
Article dans une revue
Entropy, MDPI, 2018, Special Issue Selected Papers from 4th International Electronic Conference on Entropy and Its Applications, 20 (9), pp 647. 〈10.3390/e20090647〉
Liste complète des métadonnées
https://hal-enac.archives-ouvertes.fr/hal-01852144
Contributeur : Laurence Porte <>
Soumis le : jeudi 4 octobre 2018 - 11:11:28
Dernière modification le : lundi 10 décembre 2018 - 16:14:08
Document(s) archivé(s) le : samedi 5 janvier 2019 - 14:34:15

Fichier

entropy_20_00647_manuscript_v2...
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

ENAC | DEVI | INSMI

Citation

Stefano Gattone, Angela De Sanctis, Stéphane Puechmorel, Florence Nicol. On the geodesic distance in shapes K-means clustering. Entropy, MDPI, 2018, Special Issue Selected Papers from 4th International Electronic Conference on Entropy and Its Applications, 20 (9), pp 647. 〈10.3390/e20090647〉. 〈hal-01852144v2〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

32

Téléchargements de fichiers

54

Picto

Contact  : publications@enac.fr