Abstract: Architecture that utilizes characteristics of high spatial redundancy and few colors in few-colored images to compress the image data in a hierarchical manner, and store block level information. The entire image is decomposed into fixed-size blocks, and the block color information (single-colored or multi-colored) is stored. All multi-colored blocks are further divided into smaller blocks (sub-blocks) in a lower level, and the sub-block information is stored as well. The process is performed recursively until there are no more multi-colored blocks, or until the block size reaches a minimum size (e.g., a 1×1 block or one pixel). The information is then entropy coded.

Abstract: Architecture that utilizes characteristics of high spatial redundancy and few colors in few-colored images to compress the image data in a hierarchical manner, and store block level information. The entire image is decomposed into fixed-size blocks, and the block color information (single-colored or multi-colored) is stored. All multi-colored blocks are further divided into smaller blocks (sub-blocks) in a lower level, and the sub-block information is stored as well. The process is performed recursively until there are no more multi-colored blocks, or until the block size reaches a minimum size (e.g., a 1×1 block or one pixel). The information is then entropy coded.