Statistical shape analysis: clustering, learning, and testing
Anuj Srivastava, S. K. Joshi, Washington Mio et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2005
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.
Cited by 2,727 works. doi:10.1109/tpami.2005.86
Authors
References
- A theory for multiresolution signal decomposition: the wavelet representation
- Algorithms for Clustering Data
- De-noising by soft-thresholding
- Algorithms for clustering data
- Active Shape Models-Their Training and Application
- Fast and robust fixed-point algorithms for independent component analysis
- Monte Carlo Statistical Methods
- Unsupervised learning of finite mixture models
- Monte Carlo Statistical Methods
- Deterministic annealing for clustering, compression, classification, regression, and related optimization problems