By Topic

Full Color Cartoon Image Lossless Compression Based on Region Segment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li Zhe-lin ; Sch. of Mech. & Automobile Eng., South China Univ. of Technol., Guangzhou, China ; Xia Qin-xiang ; Jiang Li-jun ; Wang Shi-zi

In accordance with the two-dimensional structural dependence of color cartoon image and the entropy coding theory in data compression, a method of color cartoon image lossless compression by eliminating the structural redundancy is presented. At first it is proved that the entropy of image can be reduced by way of removing the solid region. Then the method of removing the structural redundancy is discussed. The color image is divided into three kinds of region--background, solid region and gradient color region. In order to effectively recover data, the improved Freeman chain code and color seed are used to save the removed solid region information. We apply in sequence this method and the entropy coding method to eliminate the structural redundancy and the statistical redundancy for full color cartoon images. Experiments show that the proposed method results in reduction of bit rate by 25% compared to using directly universal methods of image lossless compression.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:6 )

Date of Conference:

March 31 2009-April 2 2009