1 | initial version |
Another approach:
k=2
and cluster all colors (one 3-d color vector per pixel) based on the euclidean distance between the colors. The two resulting clusters then separate the colors within your image into two classes. 2 | added: A small number of iterations should be sufficient. |
Another approach:
k=2
and cluster all colors (one 3-d color vector per pixel) based on the euclidean distance between the colors. A small number of iterations should be sufficient. The two resulting clusters then separate the colors within your image into two classes. 3 | No.3 Revision |
Another approach:
k=2
and cluster all colors (one 3-d color vector per pixel) based on the euclidean distance between the colors. A small number of iterations should be sufficient. The two resulting clusters then separate the colors within your image into two classes.