Authors : Koushik Mukherjee; Soumen Bhowmik

Volume/Issue : Volume 10 - 2025, Issue 6 - June

Google Scholar : https://tinyurl.com/52dbatsm

Scribd : https://tinyurl.com/ydet96r3

DOI : https://doi.org/10.38124/ijisrt/25jun1813

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.

Note : Google Scholar may take 30 to 40 days to display the article.

Abstract : In this survey paper we have tried to identify the necessity and advantages and disadvantages of different approaches of different researchers. We know the process of grouping objects or datasets with comparable data points is called clustering. Groups of items are as similar as they can be. Each group's points are as dissimilar as possible. One well- liked algorithm for classifying and dividing data is K-means clustering. It facilitates the separation of objects from their surroundings. According to K-means clustering, every feature point has a distinct location in space. In a multidimensional measurement space, a predetermined number of cluster centers are chosen at random by the fundamental K-means algorithm. The cluster with the closest mean vector is assigned to each pixel in the picture. This procedure continues until the cluster mean vector positions between iterations vary as little as possible. The K-means algorithm is significantly impacted by the initial starting points. Initial clusters are randomly generated by K-means. When these starting points are chosen close to the final solution, K-means can usually find the cluster center effectively. Otherwise, it could lead to poor clustering results. K-means clustering is one method for classifying data. The K-means function yields the cluster index for each observation following the division of the data into k distinct clusters.

Keywords : K-means Clustering; Segmentation; Pixel.

References :

1. A.T. Michailovich, Oleg, Yogesh Rathi, “"Image segmentation using active contours driven by the Bhattacharyya gradient flow.,” IEEE Trans. Image Process., vol. 16.11, pp. 2787–2801, 2007.
2. F.jian. and M.R.Frater, “Threshold-based image segmentation through an improved particle swarm optimization,” in Digital image computing techniques and applications (DICTA), 2012.
3. P. Y. and G. R. Reddy, “Segmentation of noisy images using improved distance regularized level set evolution,” in IEEE International conference on circuits, power and computing technologies, 2017.
4. A. S. Jumb, Vijay, Mandar Sohani, “"Color image segmentation using K-means clustering and Otsu’s adaptive thresholding.",” Int. J. Innov. Technol. Explor. Eng., vol. 3.9, pp. 72–76, 2014.
5. E. Deligiannidis, Leonidas, and Hamid R. Arabnia, “Emerging trends in image processing, computer vision and pattern recognition.,” in Morgan Kaufmann, 2014.
6. S. B.-A. Al Bashish, Dheeb, Malik Braik, “Detection and classification of leaf diseases using K-means-based segmentation and.,” Inf. Technol. J., vol. 10.2, pp. 267–275, 2011.
7. H. K. H. Wong, Stephen TC, “Design methods and architectural issues of integrated medical image data base systems.,” in Computerized Medical Imaging and Graphics, 1996, p. 285–299.
8. K. V. and B. K. Singh, “An enhancement in adaptive median filter for edge preservation,” in ScienceDirect, Computer science procedia, 2015, pp. 29–36.
9. P. Vijayalakshmi, “Segmentation of Brain MRI using K-means Clustering Algorithm,” Int. J. Eng. Trends Technol., pp. 113–115, 2011.
10. K. M. and Y. J. chanu N. Dhanachandra, “ Image segmentation using K-means clustering algorithm and subtractive clustering algorithm”, 2015, pp. 764- 771.,” in ScienceDirect, Computer science procedia, 2015, pp. 764–771.