| 摘要 |
<p>A color image (1) is compressed by associating a variable length color code with each color of the image, and then forming bitplanes (51-54) each representing one bit position of the binary color codes for each pixel of the color image. The variable length codes are optimized, such as by a canonical Huffman algorithm. Compression is high, even for simple icons and special character images (e.g. 16 x 16 pixels). Decompression is simple, fast and resource inexpensive. Amongst many other uses, the image decompression is suitable for use in a cellular telephone having a color LCD display.</p> |
