Next: Mixture distributions [2* P]
Previous: Clustering: Face recognition [3
Apply the k-means algorithm for lossy image compression by means of vector quantization.
- Download the
image mandrill.tif.4Each pixel represents a point in a three dimensional (r,g,b) color space. Each color dimension encodes the corresponding intensity with an 8 bit integer.
- Cluster the pixels in color space using
clusters and replace the original color values with the indices of the closest cluster centers. Determine the compression factor for each value of
and relate it to the quality of the image. Apply an appropriate quality measure of you choice.