Paper
19 May 1992 Compression gain aspects of JPEG image compression
Manyun Chang, Glen G. Langdon Jr., James L. Murphy
Author Affiliations +
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.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Quantization

Image processing

Computer simulations

Image quality

Computer programming

Data modeling

RELATED CONTENT


Back to Top