An improved fuzzy clustering approach for image segmentation

Fuzzy clustering techniques have been widely used in automated image segmentation. However, since the standard fuzzy c-means (FCM) clustering algorithm does not consider any spatial information, it is highly sensitive to noise. In this paper, we present an extension of the FCM algorithm to overcome this drawback, by incorporating spatial neighborhood information into a new similarity measure. We consider that spatial information depends on the relative location and features of the neighboring pixels. The performance of the proposed algorithm is tested on synthetic and real images with different noise levels. Experimental quantitative and qualitative segmentation results show that the proposed method is effective, more robust to noise and preserves the homogeneity of the regions better than other FCM-based methods

Brain Tumor Segmentation on MRI Brain Images with Fuzzy Clustering and GVF Snake Model

Deformable or snake models are extensively used for medical image segmentation, particularly to locate tumor boundaries in brain tumor MRI images. Problems associated with initialization and poor convergence to boundary concavities, however, has limited their usefulness. As result of that they tend to be attracted towards wrong image features. In this paper, we propose a method that combine region based fuzzy clustering called Enhanced Possibilistic Fuzzy C-Means (EPFCM) and Gradient vector flow (GVF) snake model for segmenting tumor region on MRI images. Region based fuzzy clustering is used for initial segmentation of tumor then result of this is used to provide initial contour for GVF snake model, which then determines the final contour for exact tumor boundary for final segmentation. The evaluation result with tumor MRI images shows that our method is more accurate and robust for brain tumor segmentation

A Fully Unsupervised Texture Segmentation Algorithm

This paper presents a fully unsupervised texture segmentation algorithm by using a modified discrete wavelet frames decomposition and a mean shift algorithm. By fully unsupervised, we mean the algorithm does not require any knowledge of the type of texture present nor the number of textures in the image to be segmented. The basic idea of the proposed method is to use the modified discrete wavelet frames to extract useful information from the image. Then, starting from the lowest level, the mean shift algorithm is used together with the fuzzy c-means clustering to divide the data into an appropriate number of clusters. The data clustering process is then refined at every level by taking into account the data at that particular level. The final crispy segmentation is obtained at the root level. This approach is applied to segment a variety of composite texture images into homogeneous texture areas and very good segmentation results are reported

A survey of kernel and spectral methods for clustering

Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods. The aim of this paper is to present a survey of kernel and spectral clustering methods, two approaches able to produce nonlinear separating hypersurfaces between clusters. The presented kernel clustering methods are the kernel version of many classical clustering algorithms, e.g., K-means, SOM and neural gas. Spectral clustering arise from concepts in spectral graph theory and the clustering problem is configured as a graph cut problem where an appropriate objective function has to be optimized. An explicit proof of the fact that these two paradigms have the same objective is reported since it has been proven that these two seemingly different approaches have the same mathematical foundation. Besides, fuzzy kernel clustering methods are presented as extensions of kernel K-means clustering algorithm. (C) 2007 Pattem Recognition Society. Published by Elsevier Ltd. All rights reserved