Share Email Print

Proceedings Paper

Compression gain aspects of JPEG image compression
Author(s): Manyun Chang; Glen G. Langdon Jr.; James L. Murphy
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 19 May 1992
PDF: 10 pages
Proc. SPIE 1657, Image Processing Algorithms and Techniques III, (19 May 1992); doi: 10.1117/12.58315
Show Author Affiliations
Manyun Chang, Earthquest, Inc. (United States)
Glen G. Langdon Jr., Univ. of California/Santa Cruz (United States)
James L. Murphy, California State Univ./Chico (United States)

Published in SPIE Proceedings Vol. 1657:
Image Processing Algorithms and Techniques III
James R. Sullivan; Benjamin M. Dawson; Majid Rabbani, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?