1 October 2004 Remodeling JPEG arithmetic coder for improved end-of-block marker coding
Gopal Lakhani
Author Affiliations +
Abstract
In JPEG image compression algorithms, an entropy coder encodes an end-of-block (EOB) marker for each discrete cosine transform (DCT) block. The well-known Huffman coder encodes one such marker for each block. However, the binary arithmetic coder, which provides greater compression but is not as well known, encodes several EOB tests, one after each nonzero ac coefficient of the block. We present a modification to the JPEG arithmetic coding algorithm to reduce the number of EOB tests. Our algorithm encodes two extra zero ac coefficients for a small percentage of blocks, but it encodes fewer EOB tests. As a result, we reduce the total image code size by about 1.4% on average. In this process, we also study the effectiveness of the DCT and statistical models of this coder.
©(2004) Society of Photo-Optical Instrumentation Engineers (SPIE)
Gopal Lakhani "Remodeling JPEG arithmetic coder for improved end-of-block marker coding," Optical Engineering 43(10), (1 October 2004). https://doi.org/10.1117/1.1787836
Published: 1 October 2004
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Binary data

Statistical analysis

Computer programming

Optical engineering

Photography

Algorithm development

RELATED CONTENT

Variable-rate predictive residual vector quantization
Proceedings of SPIE (April 21 1995)
Hardware-friendly mixed content compression algorithm
Proceedings of SPIE (January 19 2009)
Software tools and test data for research and testing of...
Proceedings of SPIE (January 17 2005)

Back to Top