Manifold Clustering of Shapes

Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological cells in a bank of cyto-images; the groups of species on photographs collected from certain aerials; or the groups of objects observed on surveillance scenes from an office building. Here we demonstrate that a nonlinear projection algorithm such as Isomap can attract together shapes of similar objects, suggesting the existence of isometry between the shape space and a low dimensional nonlinear embedding. Whenever there is a relatively small amount of noise in the data, the projection forms compact, convex clusters that can easily be learned by a subsequent partitioning scheme. We further propose a modification of the Isomap projection based on the concept of degree-bounded minimum spanning trees. The proposed approach is demonstrated to move apart bridged clusters and to alleviate the effect of noise in the data.

[1]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[2]  Eamonn J. Keogh,et al.  LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures , 2006, VLDB.

[3]  Chin-Chen Chang,et al.  A shape recognition scheme based on relative distances of feature points from the centroid , 1991, Pattern Recognition.

[4]  Robert Pless,et al.  Manifold clustering , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[5]  Joshua B. Tenenbaum,et al.  The Isomap Algorithm and Topological Stability , 2002, Science.

[6]  Josef Kittler,et al.  Efficient and Robust Retrieval by Shape Content through Curvature Scale Space , 1998, Image Databases and Multi-Media Search.

[7]  Guojun Lu,et al.  Review of shape representation and description techniques , 2004, Pattern Recognit..

[8]  Paul S. Bradley,et al.  Initialization of Iterative Refinement Clustering Algorithms , 1998, KDD.

[9]  Dimitrios Charalampidis,et al.  A modified k-means algorithm for circular invariant clustering , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  David L. Sheinberg,et al.  Visual object recognition. , 1996, Annual review of neuroscience.

[11]  Anuj Srivastava,et al.  Statistical shape analysis: clustering, learning, and testing , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Remco C. Veltkamp,et al.  Properties and Performance of Shape Similarity Measures , 2006, Data Science and Classification.

[13]  Christos H. Papadimitriou,et al.  On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.

[14]  Satyandra K. Gupta,et al.  A Survey of Shape Similarity Assessment Algorithms for Product Design and Manufacturing Applications , 2003, J. Comput. Inf. Sci. Eng..

[15]  Xiaoli Zhou,et al.  Face recognition from face profile using dynamic time warping , 2004, ICPR 2004.

[16]  Philip S. Yu,et al.  Rotation invariant indexing of shapes and line drawings , 2005, CIKM '05.

[17]  Noel E. O'Connor,et al.  Efficient contour-based shape representation and matching , 2003, MIR '03.

[18]  Li Yang Building k-connected neighborhood graphs for isometric data embedding , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Markus Breitenbach,et al.  Clustering through ranking on manifolds , 2005, ICML '05.

[20]  Horst Bunke,et al.  Diatom identification: a double challenge called ADIAC , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[21]  Shih-Fu Chang,et al.  Image Retrieval: Current Techniques, Promising Directions, and Open Issues , 1999, J. Vis. Commun. Image Represent..

[22]  Remco C. Veltkamp,et al.  Content-based image retrieval systems: A survey , 2000 .

[23]  Paul L. Rosin,et al.  Shape Orientability , 2006, ACCV.

[24]  Anuj Srivastava,et al.  Analysis of planar shapes using geodesic paths on shape spaces , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Pepe Siy,et al.  Robust shape similarity retrieval based on contour segmentation polygonal multiresolution and elastic matching , 2005, Pattern Recognit..

[26]  R. Ravi,et al.  Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.

[27]  Kap Luk Chan,et al.  An extended Isomap algorithm for learning multi-class manifold , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[28]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[29]  Bernard Chazelle,et al.  Shape distributions , 2002, TOGS.

[30]  Dalong Li,et al.  Shape Retrieval Based on Distance Ratio Distribution , 2002 .