Cart (Loading....) | Create Account
Close category search window

A near-lossless trellis-searched predictive image compression system

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)
Moayeri, N. ; Hewlett-Packard Labs., Palo Alto, CA, USA

This paper presents a near-lossless image compression system where the coded image is within some prespecified maximum error of the original image at each and every pixel. The system is predictive and codes the image one row at a time. The encoder uses the Viterbi algorithm to choose among all admissible reproductions for the given image row the one that can be described with the fewest number of bits. In this paper we present a version of the system which employs run-length and Huffman coding to describe the reproductions for an image row. In addition, the system uses context modeling to further reduce the bit rate. Experimental results are presented showing the performance of the system on the large set of images provided by the ISO/IEC ITC Standards Committee

Published in:

Image Processing, 1996. Proceedings., International Conference on  (Volume:1 )

Date of Conference:

16-19 Sep 1996

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.