On the geodesic distance in shapes K-means clustering
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...