Compression of palettized color images with variable length color codes
A color image is compressed by associating a variable length color code with each color of the original colour image, and then forming bitplanes (-) 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 c...
Saved in:
| Main Author | |
|---|---|
| Format | Patent |
| Language | English |
| Published |
19.08.2008
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | A color image is compressed by associating a variable length color code with each color of the original colour image, and then forming bitplanes (-) 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×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. |
|---|