Publication Type : Journal Article
Publisher : International Journal of Emerging Science and Engineering
Source : International Journal of Emerging Science and Engineering. Vol. 1(5), Pp. 27-32
Url : https://www.ijese.org/portfolio-item/e0210031513/
Campus : Amaravati
School : School of Computing
Department : Computer Science and Engineering
Abstract : As of now, several improvements have been carried out to increase the performance of previous conventional clustering algorithms for image segmentation. However, most of them tend to have met with unsatisfactory results. In order to overcome some of the drawback like dead centers and trapped centers, in this article presents a new clustering-based segmentation technique that may be able to overcome some of the drawbacks we are passing with conventional clustering algorithms. We named this clustering algorithm as optimized kmeans clustering algorithm for image segmentation. OKM algorithm that can homogenously segment an image into regions of interest with the capability of avoiding the dead centre and trapped centre problems. The robustness of the OKM algorithm can be observed from the qualitative and quantitative analyses.
Cite this Research Publication : Lakshmana Phaneendra Maguluri, Keshav Rajapanthula, P Naga Srinivasu (2013). A comparative analysis of clustering-based segmentation algorithms in microarray images, International Journal of Emerging Science and Engineering. Vol. 1(5), Pp. 27-32