Low-Rate Entropy Coding Of Transformed Images

Sharaf E. Elnahas; Kou-Hu Tzou

doi:10.1117/12.976200

10 December 1986 Low-Rate Entropy Coding Of Transformed Images

Sharaf E. Elnahas, Kou-Hu Tzou

Proceedings Volume 0697, Applications of Digital Image Processing IX; (1986) https://doi.org/10.1117/12.976200
Event: 30th Annual Technical Symposium, 1986, San Diego, United States

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.

Citation Download Citation

Sharaf E. Elnahas and Kou-Hu Tzou "Low-Rate Entropy Coding Of Transformed Images", Proc. SPIE 0697, Applications of Digital Image Processing IX, (10 December 1986); https://doi.org/10.1117/12.976200

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available