DocumentCode :
3107374
Title :
Manifold Clustering of Shapes
Author :
Yankov, Dragomir ; Keogh, Eamonn
Author_Institution :
Univ. of California, Riverside, CA
fYear :
2006
fDate :
18-22 Dec. 2006
Firstpage :
1167
Lastpage :
1171
Abstract :
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.
Keywords :
image retrieval; object recognition; pattern clustering; data noise; degree-bounded minimum spanning trees; image collections; low dimensional nonlinear embedding; nonlinear projection algorithm; objects automatic labeling; office building; shapes manifold clustering; subsequent partitioning scheme; surveillance scenes; Circuit noise; Clustering algorithms; Labeling; Layout; Noise robustness; Noise shaping; Pathology; Projection algorithms; Shape measurement; Surveillance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining, 2006. ICDM '06. Sixth International Conference on
Conference_Location :
Hong Kong
ISSN :
1550-4786
Print_ISBN :
0-7695-2701-7
Type :
conf
DOI :
10.1109/ICDM.2006.101
Filename :
4053173
Link To Document :
بازگشت