By Topic

A lossless image compression system using a binary arithmetic coder

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

3 Author(s)
Hua Ye ; Dept. of Electron. Eng., La Trobe Univ., Bundoora, Vic., Australia ; Guang Deng ; Devlin, J.C.

In this paper we incorporate a binary arithmetic coder into a predictive lossless image compression scheme. Its idea arises from the observation that a binary arithmetic coder needs much less computation than a multi-symbol one and therefore should run faster. To map the prediction errors to binary symbols which are fed into the arithmetic coder, Rice code has been adopted because of the Laplacian distribution for prediction errors. Experiments show that the compression performance of this scheme is better than that of LOCO and S+P and is close to that of CALIC

Published in:

Signal Processing Proceedings, 1998. ICSP '98. 1998 Fourth International Conference on

Date of Conference: