Analysis of fuzzy clustering and a generic fuzzy rule-based image segmentation technique

Many fuzzy clustering based techniques when applied to image segmentation do not incorporate spatial relationships of the pixels, while fuzzy rule-based image segmentation techniques are generally application dependent. Also for most of these techniques, the structure of the membership functions is predefined and parameters have to either automatically or manually derived. This paper addresses some of these issues by introducing a new generic fuzzy rule based image segmentation (GFRIS) technique, which is both application independent and can incorporate the spatial relationships of the pixels as well. A qualitative comparison is presented between the segmentation results obtained using this method and the popular fuzzy c-means (FCM) and possibilistic c-means (PCM) algorithms using an empirical discrepancy method. The results demonstrate this approach exhibits significant improvements over these popular fuzzy clustering algorithms for a wide range of differing image types

Fuzzy Image Segmentation using Suppressed Fuzzy C-Means Clustering

Clustering algorithms are highly dependent on the features used and the type of the objects in a particular image. By considering object similar surface variations (SSV) as well as the arbitrariness of the fuzzy c-means (FCM) algorithm for pixellocation, a fuzzy image segmentation considering object surface similarity (FSOS) algorithm was developed, but it was unable to segment objects having SSV satisfactorily. To improve the effectiveness of FSOS in segmenting objects with SSV, thispaper introduces a new fuzzy image segmentation using suppressed fuzzy c-means clustering (FSSC) algorithm, which directly considers object SSV and incorporates the use of suppressed-FCM (SFCM) using pixel location. The algorithmalso perceptually selects the threshold within the range of human visual perception. Both qualitative and quantitative resultsconfirm the improved segmentation performance of FSSC compared with other algorithms including FSOS, FCM,possibilistic c-means (PCM) and SFCM for many different images

Automatic Feature Set Selection for Merging Image Segmentation Results Using Fuzzy Clustering

The image segmentation performance of clustering algorithms is highly dependent on the features used and the type of objects contained in the image, which limits the generalization ability of such algorithms. As a consequence, a fuzzy image segmentation using suppressed fuzzy c-means clustering (FSSC) algorithm was proposed that merged the initially segmented regions produced by a fuzzy clustering algorithm, using two different feature sets each comprising two features from pixel location, pixel intensity and a combination of both, which considered objects with similar surface variations (SSV), the arbitrariness of fuzzy c-means (FCM) algorithm using pixel location and the connectedness property of objects. The feature set selection for the initial segmentation in the merging technique was however, inaccurate because it did not consider all possible feature set combinations and also manually defined the threshold used to identify objects having SSV. To overcome these limitations, a new automatic feature set selection for merging image segmentation results using fuzzy clustering (AFMSF) algorithm is proposed, which considers the best feature set selection and also calculates the threshold based upon human visual perception. Both qualitative and quantitative analysis prove the superiority of AFMSF algorithm compared with other clustering techniques including FSSC, FCM, possibilistic c-means (PCM) and SFCM, for different image types

Inter-comparison of medical image segmentation algorithms

Segmentation of images is a vital part of medical image processing, and MRI (Magnetic Resonance Imaging) is already recognized as a very important tool for clinical diagnosis. In this thesis, comparisons between different segmentation algorithms are carried out, specifically on brain MRI images. Initial parts of the thesis provide the background to the project, and an introduction to the basic principles of MRI, respectively, followed by parameter definitions and MRI image artifacts. The next part briefly covers various image pre-processing techniques which are required, and this is followed with a review of the major segmentation techniques which are available, including thresholding, region growing, clustering, and K-Means clustering. The concept of fuzzy logic is also introduced here, and the chapter concludes with a discussion of fuzzy logic based segmentation algorithms such as Fuzzy C-Means (FCM) and Improved Fuzzy C-Means (IFCM) clustering algorithms. The following part provides details concerning the source, type and parameters of the data (images) used for this thesis. Evaluation and inter-comparisons between a number of different segmentation algorithms are given in near concluding part, finally, conclusions and suggestions for future research are provided in last part. Qualitative comparisons on real images and quantitative comparisons on simulated images were performed. Both qualitative and quantitative comparisons demonstrated that fuzzy logic based segmentation algorithms are superior in comparison with classical segmentation algorithms. Edge-based segmentation algorithms demonstrated the poorest performance of all; K-means and IFCM clustering algorithms performed better, and FCM demonstrated the best performance of all. However, it should be noted that IFCM was not properly evaluated due to time restrictions in code generation, testing and evaluation.Segmentation of images is a vital part of medical image processing, and MRI (Magnetic Resonance Imaging) is already recognized as a very important tool for clinical diagnosis. In this thesis, comparisons between different segmentation algorithms are carried out, specifically on brain MRI images. Initial parts of the thesis provide the background to the project, and an introduction to the basic principles of MRI, respectively, followed by parameter definitions and MRI image artifacts. The next part briefly covers various image pre-processing techniques which are required, and this is followed with a review of the major segmentation techniques which are available, including thresholding, region growing, clustering, and K-Means clustering. The concept of fuzzy logic is also introduced here, and the chapter concludes with a discussion of fuzzy logic based segmentation algorithms such as Fuzzy C-Means (FCM) and Improved Fuzzy C-Means (IFCM) clustering algorithms. The following part provides details concerning the source, type and parameters of the data (images) used for this thesis. Evaluation and inter-comparisons between a number of different segmentation algorithms are given in near concluding part, finally, conclusions and suggestions for future research are provided in last part. Qualitative comparisons on real images and quantitative comparisons on simulated images were performed. Both qualitative and quantitative comparisons demonstrated that fuzzy logic based segmentation algorithms are superior in comparison with classical segmentation algorithms. Edge-based segmentation algorithms demonstrated the poorest performance of all; K-means and IFCM clustering algorithms performed better, and FCM demonstrated the best performance of all. However, it should be noted that IFCM was not properly evaluated due to time restrictions in code generation, testing and evaluation

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

A stochastic-variational model for soft Mumford-Shah segmentation

In contemporary image and vision analysis, stochastic approaches demonstrate great flexibility in representing and modeling complex phenomena, while variational-PDE methods gain enormous computational advantages over Monte-Carlo or other stochastic algorithms. In combination, the two can lead to much more powerful novel models and efficient algorithms. In the current work, we propose a stochastic-variational model for soft (or fuzzy) Mumford-Shah segmentation of mixture image patterns. Unlike the classical hard Mumford-Shah segmentation, the new model allows each pixel to belong to each image pattern with some probability. We show that soft segmentation leads to hard segmentation, and hence is more general. The modeling procedure, mathematical analysis, and computational implementation of the new model are explored in detail, and numerical examples of synthetic and natural images are presented.Comment: 22 page

Development of Texture Weighted Fuzzy C-Means Algorithm for 3D Brain MRI Segmentation

The segmentation of human brain Magnetic Resonance Image is an essential component in the computer-aided medical image processing research. Brain is one of the fields that are attracted to Magnetic Resonance Image segmentation because of its importance to human. Many algorithms have been developed over decades for brain Magnetic Resonance Image segmentation for diagnosing diseases, such as tumors, Alzheimer, and Schizophrenia. Fuzzy C-Means algorithm is one of the practical algorithms for brain Magnetic Resonance Image segmentation. However, Intensity Non- Uniformity problem in brain Magnetic Resonance Image is still challenging to existing Fuzzy C-Means algorithm. In this paper, we propose the Texture weighted Fuzzy C-Means algorithm performed with Local Binary Patterns on Three Orthogonal Planes. By incorporating texture constraints, Texture weighted Fuzzy C-Means could take into account more global image information. The proposed algorithm is divided into following stages: Volume of Interest is extracted by 3D skull stripping in the pre-processing stage. The initial Fuzzy C-Means clustering and Local Binary Patterns on Three Orthogonal Planes feature extraction are performed to extract and classify each cluster’s features. At the last stage, Fuzzy C-Means with texture constraints refines the result of initial Fuzzy C-Means. The proposed algorithm has been implemented to evaluate the performance of segmentation result with Dice’s coefficient and Tanimoto coefficient compared with the ground truth. The results show that the proposed algorithm has the better segmentation accuracy than existing Fuzzy C-Means models for brain Magnetic Resonance Image

A comparative evaluation of interactive segmentation algorithms

In this paper we present a comparative evaluation of four popular interactive segmentation algorithms. The evaluation was carried out as a series of user-experiments, in which participants were tasked with extracting 100 objects from a common dataset: 25 with each algorithm, constrained within a time limit of 2 min for each object. To facilitate the experiments, a “scribble-driven” segmentation tool was developed to enable interactive image segmentation by simply marking areas of foreground and background with the mouse. As the participants refined and improved their respective segmentations, the corresponding updated segmentation mask was stored along with the elapsed time. We then collected and evaluated each recorded mask against a manually segmented ground truth, thus allowing us to gauge segmentation accuracy over time. Two benchmarks were used for the evaluation: the well-known Jaccard index for measuring object accuracy, and a new fuzzy metric, proposed in this paper, designed for measuring boundary accuracy. Analysis of the experimental results demonstrates the effectiveness of the suggested measures and provides valuable insights into the performance and characteristics of the evaluated algorithms

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