This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Statistical Shape Analysis: Clustering, Learning, and Testing
April 2005 (vol. 27 no. 4)
pp. 590-602
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.

[1] T.F. Cootes, C.J. Taylor, D.H. Cooper, and J. Graham, “Active Shape Models: Their Training and Application,” Computer Vision and Image Understanding, vol. 61, no. 1, pp. 38-59, 1995.
[2] R.H. Davies, C.J. Twining, P.D. Allen, T.F. Cootes, and C.J. Taylor, “Building Optimal 2D Statistical Shape Models,” Image and Vision Computing, vol. 21, pp. 1171-1182, 2003.
[3] I.L. Dryden and K.V. Mardia, Statistical Shape Analysis. John Wiley & Sons, 1998.
[4] N. Duta, A.K. Jain, and M.-P. Dubuisson-Jolly, “Automatic Construction of 2D Shape Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 5, May 2001.
[5] M.A.T. Figueiredo and A.K. Jain, “Unsupervised Learning of Finite Mixture Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 3, Mar. 2002.
[6] U. Grenander, General Pattern Theory. Oxford Univ. Press, 1993.
[7] U. Grenander and M.I. Miller, “Computational Anatomy: An Emerging Discipline,” Quarterly of Applied Math., vol. LVI, no. 4, pp. 617-694, 1998.
[8] U. Grenander and A. Srivastava, “Probability Models for Clutter in Natural Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 4, pp. 424-429, Apr. 2001.
[9] T. Hofmann and J.M. Buhmann, “Pairwise Data Clustering by Deterministic Annealing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 1, pp. 1-14, Jan. 1997.
[10] A. Holboth, J.T. Kent, and I.L. Dryden, “On the Relation between Edge and Vertex Modeling in Shape Analysis,” Scandinavian J. Statistics, vol. 29, pp. 355-374, 2002.
[11] A. Hyvarinen, “Fast and Robust Fixed-Point Algorithm for Independent Component Analysis,” IEEE Trans. Neural Networks, vol. 10, pp. 626-634, 1999.
[12] A.K. Jain and R.C. Dubes, Algorithms for Clustering Data. Prentice-Hall, 1988.
[13] H. Karcher, “Riemann Center of Mass and Mollifier Smoothing,” Comm. Pure and Applied Math., vol. 30, pp. 509-541, 1977.
[14] J.T. Kent and K.V. Mardia, “Procrustes Tangent Projections and Bilateral Symmetry,” Biometrika, vol. 88, pp. 469-485, 2001.
[15] E. Klassen, A. Srivastava, W. Mio, and S. Joshi, “Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 3, pp. 372-383, Mar. 2004.
[16] H.L. Le and D.G. Kendall, “The Riemannian Structure of Euclidean Shape Spaces: A Novel Environment for Statistics,” Annals of Statistics, vol. 21, no. 3, pp. 1225-1271, 1993.
[17] S.G. Mallat, “A Theory for Multiresolution Signal Decomposition: The Wavelet Representation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 674-693, 1989.
[18] W. Mio and A. Srivastava, “Elastic String Models for Representation and Analysis of Planar Shapes,” Proc. IEEE Computer Vision and Pattern Recognition, 2004.
[19] W. Mio, A. Srivastava, and X. Liu, “Learning and Bayesian Shape Extraction for Object Recognition,” Proc. European Conf. Computer Vision, T. Pajdla and J. Matas, eds., part IV, pp. 62-73, 2004.
[20] F. Mokhtarian, “Silhouette-Based Isolated Object Recognition through Curvature Scale Space,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 5, pp. 539-544, May 1995.
[21] C.P. Robert and G. Casella, Monte Carlo Statistical Methods. Springer, 1999.
[22] K. Rose, “Deterministic Annealing for Clustering, Compression, Classification, Regression, and Related Optimization Problems,” Proc. IEEE, vol. 86, no. 11, pp. 2210-2239, 1998.
[23] C.G. Small, The Statistical Theory of Shape. Springer, 1996.

Index Terms:
Shape analysis, shape statistics, shape learning, shape testing, shape retrieval, shape clustering.
Citation:
Anuj Srivastava, Shantanu H. Joshi, Washington Mio, Xiuwen Liu, "Statistical Shape Analysis: Clustering, Learning, and Testing," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 4, pp. 590-602, April 2005, doi:10.1109/TPAMI.2005.86
Usage of this product signifies your acceptance of the Terms of Use.