K-MEANS WITH SAMPLING FOR DETERMINING PROMINENT COLORS IN IMAGES

ICTACT Journal on Soft Computing ( Volume: 13 , Issue: 1 )

Abstract

vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff3ab62e000000707d100001000700
A tool that quickly calculates the dominant colors of an image can be very useful in image processing. The k-means clustering algorithm has this potential since it partitions a set of data into n clusters and returns a representative data point from each cluster. We discuss k-means with sampling for images, which applies k-means clustering to a random sample of image pixels. We found that even with a small random sample of pixels from the image, k-means with sampling exhibits no significant loss of correctness. We examine the usefulness and limitations of k-means clustering in determining the prominent colors of an image and identifying trends in large sets of image data.

Authors

Angelina Cheng1, Eric Rosenberg2, Alina Gorbunova3
Rutgers University, United States1,3, Georgian Court University, United States2

Keywords

K-Means, Clustering, Color, Image

Published By
ICTACT
Published In
ICTACT Journal on Soft Computing
( Volume: 13 , Issue: 1 )
Date of Publication
October 2022
Pages
2813 - 2819

ICT Academy is an initiative of the Government of India in collaboration with the state Governments and Industries. ICT Academy is a not-for-profit society, the first of its kind pioneer venture under the Public-Private-Partnership (PPP) model

Contact Us

ICT Academy
Module No E6 -03, 6th floor Block - E
IIT Madras Research Park
Kanagam Road, Taramani,
Chennai 600 113,
Tamil Nadu, India

For Journal Subscription: journalsales@ictacademy.in

For further Queries and Assistance, write to us at: ictacademy.journal@ictacademy.in