Validating fuzzy partitions obtained through c-shells clustering
Pattern Recognition Letters - Special issue on fuzzy set technology in pattern recognition
A curve tracing algorithm using level set based affine transform
Pattern Recognition Letters
An efficient approach to external cluster assessment with an application to Martian topography
Data Mining and Knowledge Discovery
Possibilistic shell clustering of template-based shapes
IEEE Transactions on Fuzzy Systems
Detecting and measuring rings in banknote images
Engineering Applications of Artificial Intelligence
A time-domain-constrained fuzzy clustering method and its application to signal analysis
Fuzzy Sets and Systems
Relational generalizations of cluster validity indices
IEEE Transactions on Fuzzy Systems
Relational duals of cluster-validity functions for the c-means family
IEEE Transactions on Fuzzy Systems
Automatic shape independent shell clustering using an ant based approach
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Multi-level thresholding using entropy-based weighted FCM algorithm in color image
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Possibilistic c-template clustering and its application in object detection in images
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Hi-index | 0.00 |
Shell clustering algorithms are ideally suited for computer vision tasks such as boundary detection and surface approximation, particularly when the boundaries have jagged or scattered edges and when the range data is sparse. This is because shell clustering is insensitive to local aberrations, it can be performed directly in image space, and unlike traditional approaches it does assume dense data and does not use additional features such as curvatures and surface normals. The shell clustering algorithms introduced in Part I of this paper assume that the number of clusters is known, however, which is not the case in many boundary detection and surface approximation applications. This problem can be overcome by considering cluster validity. We introduce a validity measure called surface density which is explicitly meant for the type of applications considered in this paper, we show through theoretical derivations that surface density is relatively invariant to size and partiality (incompleteness) of the clusters. We describe unsupervised clustering algorithms that use the surface density measure and other measures to determine the optimum number of shell clusters automatically, and illustrate the application of the proposed algorithms to boundary detection in the case of intensity images and to surface approximation in the case of range images