Possibilistic Shell Clustering of Template-Based Shapes
檔案
- 000268527100004.pdf (1.52 MB, Adobe PDF)
日期
2009-08-01
類型
系所
期刊名稱
IEEE TRANSACTIONS ON FUZZY SYSTEMS
卷期與頁次
第 17 卷第 4 期,頁 777–793
ISSN
1063-6706
語言
英文
摘要
In this paper, we present a new type of alternating-optimization- based possibilistic c-shell algorithm for clustering-template- based shapes. A cluster prototype consists of a copy of the template after translation, scaling, rotation, and/or affine transformations. This extends the capability of shell clustering beyond a few standard geometrical shapes that have been in the literature so far. We use a number of 2-D datasets, consisting of both synthetic and real-world images, to illustrate the capability of our algorithm in detecting generic-template-based shapes in images. We also describe a progressive clustering procedure aimed to relax the requirements for a known number of clusters and good initialization, as well as new performance measures of shell-clustering algorithms.