By Topic

A Lossless Color Image Compression Algorithm with Adaptive Arithmetic Coding Based on Adjacent Data Probability

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)
Chien-Pen Chuang ; Dept. of Appl. Electron. Technol., NTNU Taipei, Taipei, Taiwan ; Guan-Xian Chen ; Yi-Tsai Liao ; Chia-Chieh Lin

In this paper, we propose a simple loss less algorithm which can compress all types of images with the same high Compression Rate. The algorithm consists of two phases. First, it removes the correlation between pixels with Snake Scan to get residual of data. And then encode the residual of data with an Adaptive Arithmetic Coding. This Adaptive Arithmetic Coding only uses adjacent data to build the probability model. 24 color images provided by Kodak Company were used to test compression rate of this proposed algorithm. The results show the efficiency of this proposed algorithm is better than original Adaptive Arithmetic Coding method.

Published in:

Computer, Consumer and Control (IS3C), 2012 International Symposium on

Date of Conference:

4-6 June 2012