2006 | OriginalPaper | Chapter
Unsupervised Clustering of Shapes
Authors : Mohammad Reza Daliri, Vincent Torre
Published in: Advances in Visual Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A new method for unsupervised clustering of shapes is here proposed. This method is based on two steps: in the first step a preliminary clusterization is obtained by considering the distance among shapes after alignment with procrustes analysis [1],[2]. This step is based on the minimization of the functional
θ
(
N
cluster
)=
αN
cluster
+(1/
N
cluster
)
dist
(
c
i
) where
N
cluster
is the total number of clusters,
dist
(
c
i
) is the intra-cluster variability and
α
is an appropriate constant. In the second step, the curvature of shapes belonging to clusters obtained in the first step is examined to i) identify possible outliers and to ii) introduce a further refinement of clusters. The proposed method was tested on the Kimia, Surrey and MPEG7 shape databases and was able to obtain correct clusters, corresponding to perceptually homogeneous object categories. The proposed method was able to distinguish shapes with subtle differences, such as birds with one or two feet and to distinguish among very similar animal species....