期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2012
卷号：3
期号：1
页码：152-154
出版社：Technopark Publications
摘要：K – medoids clustering is used as a tool for clustering color space based on the distance criterion. This paper presents a color image segmentation method which divides colour space into clusters. Through this paper, using various colour images, we will try to prove that K – Medoids converges to approximate the optimal solution based on this criteria theoretically as well as experimentally. Here we will also compare the efficiency of available algorithm for segmentation of gray as well as noisy images
关键词：Color image segmentation; Clustering; K - Medoids; K - Means
