11 research outputs found
Fuzzy image segmentation combining ring and elliptic shaped clustering algorithms
Results from any existing clustering algorithm that are used for segmentation are highly sensitive to features that limit their generalization. Shape is one important attribute of an object. The detection and separation of an object using fuzzy ring-shaped clustering (FKR) and elliptic ring-shaped clustering (FKE) already exists in the literature. Not all real objects however, are ring or elliptical in shape, so to address these issues, this paper introduces a new shape-based algorithm, called fuzzy image segmentation combining ring and elliptic shaped clustering algorithms (FCRE) by merging the initial segmented results produced by FKR and FKE. The distribution of unclassified pixels is performed by connectedness and fuzzy c-means (FCM) using a combination of pixel intensity and normalized pixel location. Both qualitative and quantitative analysis of the results for different varieties of images proves the superiority of the proposed FCRE algorithm compared with both FKR and FKE
Recommended from our members
Fuzzy image segmentation of generic shaped clusters
The segmentation performance of any clustering algorithm is very sensitive to the features in an image, which ultimately restricts their generalisation capability. This limitation was the primary motivation in our investigation into using shape information to improve the generality of these algorithms. Fuzzy shape-based clustering techniques already consider ring and elliptical profiles in segmentation, though most real objects are neither ring nor elliptically shaped. This paper addresses this issue by introducing a new shape-based algorithm called fuzzy image segmentation of generic shaped clusters (FISG) that incorporates generic shape information into the framework of the fuzzy c-means (FCM) algorithm. Both qualitative and quantitative analyses confirm the superiority of FISG compared to other shape-based fuzzy clustering methods including, Gustafson-Kessel algorithm, ring-shaped, circular shell, c-ellipsoidal shells and elliptic ring-shaped clusters. The new algorithm has also been shown to be application independent so it can be applied in areas such as video object plane segmentation in MPEG-4 based coding
Fuzzy image segmentation using shape information
Results of any clustering algorithm are highly sensitive to features that limit their generalization and hence provide a strong motivation to integrate shape information into the algorithm. Existing fuzzy shape-based clustering algorithms consider only circular and elliptical shape information and consequently do not segment well, arbitrary shaped objects. To address this issue, this paper introduces a new shape-based algorithm, called fuzzy image segmentation using shape information (FISS) by incorporating general shape information. Both qualitative and quantitative analysis proves the superiority of the new FISS algorithm compared to other well-established shape-based fuzzy clustering algorithms, including Gustafson-Kessel, ring-shaped, circular shell, c-ellipsoidal shells and elliptic ring-shaped clusters
Fuzzy Clustering for Image Segmentation Using Generic Shape Information
The performance of clustering algorithms for image segmentation are highly sensitive to the features used and types of objects in the image, which ultimately limits their generalization capability. This provides strong motivation to investigate integrating shape information into the clustering framework to improve the generality of these algorithms. Existing shape-based clustering techniques mainly focus on circular and elliptical clusters and so are unable to segment arbitrarily-shaped objects. To address this limitation, this paper presents a new shape-based algorithm called fuzzy clustering for image segmentation using generic shape information (FCGS), which exploits the B-spline representation of an object's shape in combination with the Gustafson-Kessel clustering algorithm. Qualitative and quantitative results for FCGS confirm its superior segmentation performance consistently compared to well-established shape-based clustering techniques, for a wide range of test images comprising various regular and arbitrary-shaped objects
Minimum Cross-Entropy Approximation for Modeling of Highly Intertwining Data Sets at Subclass Levels
We study the problem of how to accurately model the data sets that contain a number of highly intertwining sets in terms of their spatial distributions. Applying the Minimum Cross-Entropy minimization technique, the data sets are placed into a minimum number of subclass clusters according to their high intraclass and low interclass similarities. The method leads to a derivation of the probability density functions for the data sets at the subclass levels. These functions then, in combination, serve as an approximation to the underlying functions that describe the statistical features of each data set
A soft hierarchical algorithm for the clustering of multiple bioactive chemical compounds
Most of the clustering methods used in the clustering of chemical structures such as Wards, Group Average, K- means and Jarvis-Patrick, are known as hard or crisp as they partition a dataset into strictly disjoint subsets; and thus are not suitable for the clustering of chemical structures exhibiting more than one activity. Although, fuzzy clustering algorithms such as fuzzy c-means provides an inherent mechanism for the clustering of overlapping structures (objects) but this potential of the fuzzy methods which comes from its fuzzy membership functions have not been utilized effectively. In this work a fuzzy hierarchical algorithm is developed which provides a mechanism not only to benefit from the fuzzy clustering process but also to get advantage of the multiple membership function of the fuzzy clustering. The algorithm divides each and every cluster, if its size is larger than a pre-determined threshold, into two sub clusters based on the membership values of each structure. A structure is assigned to one or both the clusters if its membership value is very high or very similar respectively. The performance of the algorithm is evaluated on two bench mark datasets and a large dataset of compound structures derived from MDL MDDR database. The results of the algorithm show significant improvement in comparison to a similar implementation of the hard c-means algorithm
Recommended from our members
Review on Fuzzy Clustering Algorithms
Image segmentation especially fuzzy-based segmentation techniques are widely used due to effective segmentation performance. For this reason, a number of algorithms are proposed in the literature. This paper presents a survey report of different types of classical fuzzy clustering techniques which are available in the literature
Detection and separation of generic-shaped objects by fuzzy clustering
Purpose - Existing shape-based fuzzy clustering algorithms are all designed to explicitly segment regular geometrically-shaped objects in an image, with the consequence that this restricts their capability to separate arbitrarily-shaped objects.
Design/Methodology/Approach – With the aim of separating arbitrary shaped objects in an image, this paper presents a new detection and separation of generic shaped objects (FKG) algorithm that analytically integrates arbitrary shape information into a fuzzy clustering framework, by introducing a shape constraint that preserves the original object shape during iterative scaling.
Findings - Both qualitative and numerical empirical results analysis corroborate the improved object segmentation performance achieved by the FKG strategy upon different image types and disparately shaped objects.
Originality/Value - The proposed FKG algorithm can be highly used in the applications where object segmentation is necessary. Like this algorithm can be applied in MPEG-4 for real object segmentation that is already applied in synthetic object segmentation
A New Measure of Cluster Validity Using Line Symmetry
[[abstract]]Many real-world and man-made objects are symmetry, therefore, it is reasonable to assume that some kind of symmetry may exist in data clusters. In this paper a new cluster validity measure which adopts a non-metric distance measure based on the idea of "line symmetry" is presented. The proposed validity measure can be applied in finding the number of clusters of different geometrical structures. Several data sets are used to illustrate the performance of the proposed measure.[[notice]]補正完畢[[journaltype]]國外[[incitationindex]]SCI[[incitationindex]]EI[[ispeerreviewed]]Y[[booktype]]紙本[[booktype]]電子版[[countrycodes]]TW