Statistical shape analysis: clustering, learning, and testing
Citations Over TimeTop 1% of 2005 papers
Abstract
Using a differential-geometric treatment of planar shapes, we present tools for: 1) hierarchical clustering of imaged objects according to the shapes of their boundaries, 2) learning of probability models for clusters of shapes, and 3) testing of newly observed shapes under competing probability models. Clustering at any level of hierarchy is performed using a mimimum variance type criterion criterion and a Markov process. Statistical means of clusters provide shapes to be clustered at the next higher level, thus building a hierarchy of shapes. Using finite-dimensional approximations of spaces tangent to the shape space at sample means, we (implicitly) impose probability models on the shape space, and results are illustrated via random sampling and classification (hypothesis testing). Together, hierarchical clustering and hypothesis testing provide an efficient framework for shape retrieval. Examples are presented using shapes and images from ETH, Surrey, and AMCOM databases.
Related Papers
- → Formal and Informal Hierarchy in Different Types of Organization(2011)303 cited
- → Anomalies in the wait-free hierarchy(1994)18 cited
- Transformation From AKNS Hierarchy to Burgers Hierarchy(2009)
- → Comment on "A counterpart of the WKI soliton hierarchy associated with so(3,R)"(2014)
- → Exploring the Hierarchy(2021)