原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
ation in part (k). Lloyd’s procedure then terminates with the clusters shown in part (l).
As Figure 33.2 shows, Lloyd’s procedure can also apply to “vector quantization.” Here, the goal is to reduce the number of distinct colors required to represent a photograph, thereby allowing the photograph to be greatly compressed (albeit in a lossy manner). In part (a) of the figure, an original photograph 700 pixels wide and 500 pixels high uses 24 bits (three bytes) per pixel to encode a triple of red, green, and blue (RGB) primary color intensities. Parts (b)–(e) of the figure show the results of using Lloyd’s procedure to compress the picture from a initial space of 224 possible values per pixel to a space of only k = 4, k = 16, k = 64, or k = 256 possible values per pixel; these k values are the cluster centers. The photograph can then be represented with only
2, 4, 6, or 8 bits per pixel, respectively, instead of the 24-bits per pixel needed by th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea