Compression gain aspects of JPEG image compression

Manyun Chang; Glen G. Langdon Jr.; James L. Murphy

doi:10.1117/12.58315

19 May 1992 Compression gain aspects of JPEG image compression

Manyun Chang, Glen G. Langdon Jr., James L. Murphy

Proceedings Volume 1657, Image Processing Algorithms and Techniques III; (1992) https://doi.org/10.1117/12.58315
Event: SPIE/IS&T 1992 Symposium on Electronic Imaging: Science and Technology, 1992, San Jose, CA, United States

Abstract

A set of still image compression algorithms developed by the Joint Photographic Experts Group (JPEG) is becoming an international standard. Here we apply a methodology to study the compression obtained by each step of the three-step baseline sequential algorithm. We present results, observations, and analysis on simulating the JPEG sequential baseline system. The primary compression gain comes from run-length coding of zero coefficients. Based on our simulator, a comparison of Huffman coding, WNC arithmetic coding, and the LZW algorithm is also included.

Citation Download Citation

Manyun Chang, Glen G. Langdon Jr., and James L. Murphy "Compression gain aspects of JPEG image compression", Proc. SPIE 1657, Image Processing Algorithms and Techniques III, (19 May 1992); https://doi.org/10.1117/12.58315

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