A near-lossless trellis-searched predictive image compression system

Author

Moayeri, Nader

Author_Institution

Hewlett-Packard Labs., Palo Alto, CA, USA

Volume

1

fYear

1996

fDate

16-19 Sep 1996

Firstpage

93

Abstract

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

Keywords

Huffman codes; Viterbi decoding; data compression; image coding; prediction theory; runlength codes; trellis codes; Huffman coding; ISO/IEC ITC Standards Committee; Viterbi algorithm; bit rate; coded image; context modeling; encoder; image row; maximum error; near-lossless trellis-searched predictive image compression system; performance; run-length coding; Context modeling; Huffman coding; IEC standards; ISO standards; Image coding; Laboratories; Milling machines; Pixel; Production systems; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1996. Proceedings., International Conference on

Conference_Location

Lausanne

Print_ISBN

0-7803-3259-8

Type

conf

DOI

10.1109/ICIP.1996.560610

Filename

560610