Share Email Print

Proceedings Paper

Low-Rate Entropy Coding Of Transformed Images
Author(s): Sharaf E. Elnahas; Kou-Hu Tzou
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

TWo entropy coding schemes are investigated in this paper by estimating the entropies that specify the lower bounds of their coding rates. In the firSt scheme, we use a traditional combination of runlength and Huffman codes. Arithmetic codes are used in the second scheme. The results indicate that binary arithmetic codes outperform runlength codes by a factor of 34 % for low-rate coding of the zero-valued coefficients of the cosine transform of digital images. Hexadecimal truncated arithmetic codes provided a coding rate improvement as high as 28 % over truncated Huffman codes at low rates. The complexity of these arithmetic codes is suitable for practical implementation.

Paper Details

Date Published: 10 December 1986
PDF: 4 pages
Proc. SPIE 0697, Applications of Digital Image Processing IX, (10 December 1986); doi: 10.1117/12.976200
Show Author Affiliations
Sharaf E. Elnahas, GTE Laboratories Incorporated (United States)
Kou-Hu Tzou, GTE Laboratories Incorporated (United States)

Published in SPIE Proceedings Vol. 0697:
Applications of Digital Image Processing IX
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top