Skip to Main content Skip to Navigation
Journal articles

On the geodesic distance in shapes K-means clustering

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.
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Thursday, October 4, 2018 - 11:11:28 AM
Last modification on : Wednesday, November 3, 2021 - 5:17:26 AM
Long-term archiving on: : Saturday, January 5, 2019 - 2:34:15 PM


Publisher files allowed on an open archive




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⟩



Les métriques sont temporairement indisponibles