Two-Dimensional Clustering Algorithms for Image Segmentation
نویسنده
چکیده
This paper introduces modified versions of the K-Means (KM) and Moving K-Means (MKM) clustering algorithms, called the Two-Dimensional K-Means (2D-KM) and Two-Dimensional Moving KMeans (2D-MKM) algorithms respectively. The performances of these two proposed algorithms are compared with three of the commonly used conventional clustering algorithms, namely K-Means (KM), Fuzzy C-Means (FCM), and Moving K-Means (MKM). The new algorithms incorporate the median value of considered pixel intensity with its neighboring pixel; together with the pixel’s own intensity for the assigning process of the pixel to the nearest cluster. From the observed qualitative and quantitative results, it is proven that 2D-KM and 2D-MKM perform better than KM, FCM, and MKM in terms of producing more homogeneous segmentation results, while taking shorter time in executing the process as compared to FCM. Key-Words: Two-Dimensional K-Means (2D-KM), Two-Dimensional Moving K-Means (2D-MKM), Image Segmentation, Clustering.
منابع مشابه
High Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملHigh Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملAutomated two-dimensional K-means clustering algorithm for unsupervised image segmentation
This paper introduces the Automated Two-Dimensional K-Means (A2DKM) algorithm, a novel unsupervised clustering technique. The proposed technique differs from the conventional clustering techniques because it eliminates the need for users to determine the number of clusters. In addition, A2DKM incorporates local and spatial information of the data into the clustering analysis. A2DKM is qualitati...
متن کاملMinimizing Loss of Information at Competitive PLIP Algorithms for Image Segmentation with Noisy Back Ground
In this paper, two training systems for selecting PLIP parameters have been demonstrated. The first compares the MSE of a high precision result to that of a lower precision approximation in order to minimize loss of information. The second uses EMEE scores to maximize visual appeal and further reduce information loss. It was shown that, in the general case of basic addition, subtraction, or mul...
متن کاملA Novel Spot-Enhancement Anisotropic Diffusion Method for the Improvement of Segmentation in Two-dimensional Gel Electrophoresis Images, Based on the Watershed Transform Algorithm
Introduction Two-dimensional gel electrophoresis (2DGE) is a powerful technique in proteomics for protein separation. In this technique, spot segmentation is an essential stage, which can be challenging due to problems such as overlapping spots, streaks, artifacts and noise. Watershed transform is one of the common methods for image segmentation. Nevertheless, in 2DGE image segmentation, the no...
متن کامل