How does K-mean Clustering Work?K-means partitions all data points into k number of clusters according to there "closeness" to the centroid assigned to the cluster. Then you take the averages of all of the points in each cluster to form a new centroid for that cluster. Rinse and repeat until there is no change in the centroids. In this case, our data points is the RGB data of each point and we calculate the closeness by using the euclidean distance formula for 3d space. The position of the pixel in the image has nothing to do with how the pixels are grouped. You can see this rgb distance relationship in the graph.
I want to be able to find the dominant color through kmean of any image, not just a favicon. Can you make an app for that? Or at least direct me on how to go about that. Preferably in a way similar to your color stripe app. It works the best out of anything I try
Thank you
Thank you, how do you use it?