16 September 2005 A reduced color approach to high quality cartoon coding
Author Affiliations +
Proceedings Volume 5909, Applications of Digital Image Processing XXVIII; 59091Z (2005); doi: 10.1117/12.617424
Event: Optics and Photonics 2005, 2005, San Diego, California, United States
An algorithm that integrates table indexing and quad-tree decomposition is proposed for cartoon image compression in this work. The proposed method includes 3 steps. First, colors in the color palette are selected based on the input image and a set of training images. Second, the input image is divided into blocks of size 16 by 16. The number of colors inside each block is checked. If the block has one uniform color or exactly two colors, no further processing is required. Otherwise, quad-tree decomposition will be performed for this block. The subdivision continues until all subblocks have either one or two colors. Then, the code for each subblock will be output in a depth-first order. If the subblock size reaches 2 x 2 and the number of colors in that block is still more than 2, no further subdivision is performed and a code that indicates colors of 4 pixels are output. Finally, to further reduce the size, the data part of the output stream is losslessly compressed by the LZW method. Experimental results are given to demonstrate the superior performance of the proposed method for cartoon image compression.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen, C.-C. Jay Kuo, "A reduced color approach to high quality cartoon coding", Proc. SPIE 5909, Applications of Digital Image Processing XXVIII, 59091Z (16 September 2005); doi: 10.1117/12.617424; https://doi.org/10.1117/12.617424

Image compression

Computer programming

Binary data

Associative arrays


Image segmentation

RGB color model


Back to Top