On the Geodesic Distance in Shapes K-means Clustering
On the Geodesic Distance in Shapes K-means Clustering
In this paper, the problem of clustering rotationally invariant shapes is studied and a solution using Information Geometry tools is provided. Landmarks of a complex shape are defined as probability densities in a statistical manifold. Then, in the setting of shapes clustering through a K-means algorithm, the discriminative power of …