39 research outputs found
A Parameter Based Modified Fuzzy Possibilistic C-Means Clustering Algorithm for Lung Image Segmentation
Image processing is a technique necessary for modifying an image. The important part of image processing is Image segmentation. The identical medical images can be segmented manually. However the accurateness of image segmentation using the segmentation algorithms is more when compared with the manual segmentation. Medical image segmentation is an indispensable pace for the majority of subsequent image analysis tasks. In this paper, FCM and different extension of FCM Algorithm is discussed. The unique FCM algorithm yields better results for segmenting noise free images, but it fails to segment images degraded by noise, outliers and other imaging artifact. This paper presents an image segmentation approach using Modified Fuzzy Possibilistic C-Means algorithm (MFPCM). This approach is a generalized adaptation of standard Fuzzy C-Means Clustering (FCM) algorithm and Fuzzy Possibilistic C-Means algorithm. The drawback of the conventional FCM technique is eliminated in modifying the standard technique. The Modified FCM algorithm is formulated by modifying the distance measurement of the standard FCM algorithm to permit the labeling of a pixel to be influenced by other pixels and to restrain the noise effect during segmentation. Instead of having one term in the objective function, a second term is included, forcing the membership to be as high as possible without a maximum frontier restraint of one. Experiments are carried out on real images to examine the performance of the proposed modified Fuzzy Possibilistic FCM technique in segmenting the medical images. Standard FCM, Modified FCM, Possibilistic C-Means algorithm (PCM), Fuzzy Possibilistic C-Means algorithm (FPCM) and Modified FPCM are compared to explore the accuracy of our proposed approach
Introduction of Local Spatial Constraints and Local Similarity Estimation in Possibilistic c-Means Algorithm for Remotely Sensed Imagery
This paper presents a unique Possibilistic c-Means with constraints (PCM-S) with Adaptive Possibilistic Local Information c-Means (ADPLICM) in a supervised way by incorporating local information through local spatial constraints and local similarity measures in Possibilistic c-Means Algorithm. PCM-S with ADPLICM overcome the limitations of the known Possibilistic c-Means (PCM) and Possibilistic c-Means with constraints (PCM-S) algorithms. The major contribution of proposed algorithm to ensure the noise resistance in the presence of random salt & pepper noise. The effectiveness of proposed algorithm has been analysed on random āsalt and pepperā noise added on original dataset and Root Mean Square Error (RMSE) has been calculated between original dataset and noisy dataset. It has been observed that PCM-S with ADPLICM is effective in minimizing noise during supervised classification by introducing local convolution
Temporal - spatial recognizer for multi-label data
Pattern recognition is an important artificial intelligence task with practical applications in many fields such as medical and species distribution. Such application involves overlapping data points which are demonstrated in the multi- label dataset. Hence, there is a need for a recognition algorithm that can separate the overlapping data points in order to recognize the correct pattern. Existing recognition methods suffer from sensitivity to noise and overlapping points as they could not recognize a pattern when there is a shift in the position of the data points. Furthermore, the methods do not implicate temporal information in the process of recognition, which leads to low quality of data clustering. In this study, an improved pattern recognition method based on Hierarchical Temporal Memory (HTM) is proposed to solve the overlapping in data points of multi- label dataset. The imHTM (Improved HTM) method includes improvement in two of its components; feature extraction and data clustering. The first improvement is realized as TS-Layer Neocognitron algorithm which solves the shift in position problem in feature extraction phase. On the other hand, the data clustering step, has two improvements, TFCM and cFCM (TFCM with limit- Chebyshev distance metric) that allows the overlapped data points which occur in patterns to be separated correctly into the relevant clusters by temporal clustering. Experiments on five datasets were conducted to compare the proposed method (imHTM) against statistical, template and structural pattern recognition methods. The results showed that the percentage of success in recognition accuracy is 99% as compared with the template matching method (Featured-Based Approach, Area-Based Approach), statistical method (Principal Component Analysis, Linear Discriminant Analysis, Support Vector Machines and Neural Network) and structural method (original HTM). The findings indicate that the improved HTM can give an optimum pattern recognition accuracy, especially the ones in multi- label dataset
Residual-Sparse Fuzzy -Means Clustering Incorporating Morphological Reconstruction and Wavelet frames
Instead of directly utilizing an observed image including some outliers,
noise or intensity inhomogeneity, the use of its ideal value (e.g. noise-free
image) has a favorable impact on clustering. Hence, the accurate estimation of
the residual (e.g. unknown noise) between the observed image and its ideal
value is an important task. To do so, we propose an
regularization-based Fuzzy -Means (FCM) algorithm incorporating a
morphological reconstruction operation and a tight wavelet frame transform. To
achieve a sound trade-off between detail preservation and noise suppression,
morphological reconstruction is used to filter an observed image. By combining
the observed and filtered images, a weighted sum image is generated. Since a
tight wavelet frame system has sparse representations of an image, it is
employed to decompose the weighted sum image, thus forming its corresponding
feature set. Taking it as data for clustering, we present an improved FCM
algorithm by imposing an regularization term on the residual between
the feature set and its ideal value, which implies that the favorable
estimation of the residual is obtained and the ideal value participates in
clustering. Spatial information is also introduced into clustering since it is
naturally encountered in image segmentation. Furthermore, it makes the
estimation of the residual more reliable. To further enhance the segmentation
effects of the improved FCM algorithm, we also employ the morphological
reconstruction to smoothen the labels generated by clustering. Finally, based
on the prototypes and smoothed labels, the segmented image is reconstructed by
using a tight wavelet frame reconstruction operation. Experimental results
reported for synthetic, medical, and color images show that the proposed
algorithm is effective and efficient, and outperforms other algorithms.Comment: 12 pages, 11 figur
Informational Paradigm, management of uncertainty and theoretical formalisms in the clustering framework: A review
Fifty years have gone by since the publication of the first paper on clustering based on fuzzy sets theory. In 1965, L.A. Zadeh had published āFuzzy Setsā [335]. After only one year, the first effects of this seminal paper began to emerge, with the pioneering paper on clustering by Bellman, Kalaba, Zadeh [33], in which they proposed a prototypal of clustering algorithm based on the fuzzy sets theory