By Topic

Lossless compression of color map images by context tree modeling

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)
Akimov, A. ; Dept. of Comput. Sci., Joensuu Univ. ; Kolesnikov, A. ; Franti, P.

Best lossless compression results of color map images have been obtained by dividing the color maps into layers, and by compressing the binary layers separately by using an optimized context tree model that exploits inter-layer dependencies. In this paper, we extend the previous context tree based method to operate on color values instead of the binary layers. We generate an n-ary context tree by constructing a complete tree up to a predefined depth, and then prune out nodes that do not provide improvement in compression to generate sub-optimal context tree with incomplete structure. Experiments show that the proposed method outperforms existing methods for a large set of different color map images

Published in:

Data Compression Conference, 2006. DCC 2006. Proceedings

Date of Conference:

28-30 March 2006