15,636 research outputs found
Noise-robust method for image segmentation
Segmentation of noisy images is one of the most challenging problems in image analysis and any improvement of segmentation methods can highly influence the performance of many image processing applications. In automated image segmentation, the fuzzy c-means (FCM) clustering has been widely used because of its ability to model uncertainty within the data, applicability to multi-modal data and fairly robust behaviour. However, the standard FCM algorithm does not consider any information about the spatial linage context and is highly sensitive to noise and other imaging artefacts. Considering above mentioned problems, we developed a new FCM-based approach for the noise-robust fuzzy clustering and we present it in this paper. In this new iterative algorithm we incorporated both spatial and feature space information into the similarity measure and the membership function. We considered that spatial information depends on the relative location and features of the neighbouring pixels. The performance of the proposed algorithm is tested on synthetic image with different noise levels and real images. Experimental quantitative and qualitative segmentation results show that our method efficiently preserves the homogeneity of the regions and is more robust to noise than other FCM-based methods
Anisotropic mean shift based fuzzy c-means segmentation of deroscopy images
Image segmentation is an important task in analysing dermoscopy images as the extraction of the borders of skin lesions provides important cues for accurate diagnosis. One family of segmentation algorithms is based on the idea of clustering pixels with similar characteristics. Fuzzy c-means has been shown to work well for clustering based segmentation, however due to its iterative nature this approach has excessive computational requirements. In this paper, we introduce a new mean shift based fuzzy c-means algorithm that requires less computational time than previous techniques while providing good segmentation results. The proposed segmentation method incorporates a mean field term within the standard fuzzy c-means objective function. Since mean shift can quickly and reliably find cluster centers, the entire strategy is capable of effectively detecting regions within an image. Experimental results on a large dataset of diverse dermoscopy images demonstrate that the presented method accurately and efficiently detects the borders of skin lesions
A New Multistage Medical Segmentation Method Based on Superpixel and Fuzzy Clustering
The medical image segmentation is the key approach of image processing for brain MRI images. However, due to the visual complex appearance of image structures and the imaging characteristic, it is still challenging to automatically segment brain MRI image. A new multi-stage segmentation method based on superpixel and fuzzy clustering (MSFCM) is proposed to achieve the good brain MRI segmentation results. The MSFCM utilizes the superpixels as the clustering objects instead of pixels, and it can increase the clustering granularity and overcome the influence of noise and bias effectively. In the first stage, the MRI image is parsed into several atomic areas, namely, superpixels, and a further parsing step is adopted for the areas with bigger gray variance over setting threshold. Subsequently, designed fuzzy clustering is carried out to the fuzzy membership of each superpixel, and an iterative broadcast method based on the Butterworth function is used to redefine their classifications. Finally, the segmented image is achieved by merging the superpixels which have the same classification label. The simulated brain database from BrainWeb site is used in the experiments, and the experimental results demonstrate that MSFCM method outperforms the traditional FCM algorithm in terms of segmentation accuracy and stability for MRI image
Recommended from our members
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
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
Recommended from our members
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
Performance characterization of clustering algorithms for colour image segmentation
This paper details the implementation of three
traditional clustering techniques (K-Means clustering, Fuzzy C-Means clustering and Adaptive K-Means clustering) that are applied to extract the colour information that is used in the image segmentation process. The aim of this paper is to evaluate the performance of the analysed colour clustering techniques for the extraction of optimal features from colour spaces and investigate which method returns the most consistent results when applied on a large suite of mosaic images
- âŠ