By Topic

Symbol mapping and context filtering for lossless image compression

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

1 Author(s)
Guang Deng ; Dept. of Electron. Eng., La Trobe Univ., Bundoora, Vic., Australia

Key building blocks of lossless image compression algorithms include adaptive prediction, context-based error feedback and adaptive entropy coding. This paper presents a new algorithm which includes two other building blocks-symbol mapping and context filtering. Experimental results show that the compression performance of the proposed algorithm is very close to that of CALIC and is better than that of LOGO and S+P. It is different from CALIC in the following aspects: (1) an adaptive median-FIR predictor, (2) a new error representation scheme using symbol mapping, (3) a different context calculation scheme for the prediction error, and (4) a new context filtering scheme

Published in:

Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on  (Volume:1 )

Date of Conference:

4-7 Oct 1998