Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Parametric Comparison of K-means and Adaptive K-means Clustering Performance on Different Images

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 7 No. 2 (2017)

DOI
10.11591/ijece.v7i2.pp810-817
ISSN
2088-8708, 2088-8708
Published
2017-04-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

Image segmentation takes a major role to analyzing the area of interest in image processing. Many researchers have used different types of techniques to analyzing the image. One of the widely used techniques is K-means clustering. In this paper we use two algorithms K-means and the advance of K-means is called as adaptive K-means clustering. Both the algorithms are using in different types of image and got a successful result. By comparing the Time period, PSNR and RMSE value from the result of both algorithms we prove that the Adaptive K-means clustering algorithm gives a best result as compard to K-means clustering in image segmentation.

Collaboration network of the authors

3 authors · 3 co-authorship links · 2 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Centurion University of Technology and Management
  • KIIT University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Parametric Comparison of K-means and Adaptive K-means Clustering Performance on Different Images</dc:title><dc:creator>Sahu, Madhusmita</dc:creator><dc:creator>Parvathi, K.</dc:creator><dc:creator>Krishna, M. Vamsi</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;Image segmentation takes a major role to analyzing the area of interest in image processing. Many researchers have used different types of techniques to analyzing the image. One of the widely used techniques is K-means clustering. In this paper we use two algorithms K-means and the advance of K-means is called as adaptive K-means clustering. Both the algorithms are using in different types of image and got a successful result. By comparing the Time period, PSNR and RMSE value from the result of both algorithms we prove that the Adaptive K-means clustering algorithm gives a best result as compard to K-means clustering in image segmentation.    &amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2017-04-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v7i2.pp810-817</dc:identifier><dc:identifier>10.11591/ijece.v7i2.pp810-817</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 7 No 2 (2017); 810</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/6428/6299</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>