28 May 2003 Context-based lossless image compression with optimal codes for discretized Laplacian distributions
Author Affiliations +
Abstract
Lossless image compression has become an important research topic, especially in relation with the JPEG-LS standard. Recently, the techniques known for designing optimal codes for sources with infinite alphabets have been applied for the quantized Laplacian sources which have probability mass functions with two geometrically decaying tails. Due to the simple parametric model of the source distribution the Huffman iterations are possible to be carried out analytically, using the concept of reduced source, and the final codes are obtained as a sequence of very simple arithmetic operations, avoiding the need to store coding tables. We propose the use of these (optimal) codes in conjunction with context-based prediction, for noiseless compression of images. To reduce further the average code length, we design Escape sequences to be employed when the estimation of the distribution parameter is unreliable. Results on standard test files show improvements in compression ratio when comparing with JPEG-LS.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ciprian Doru Giurcaneanu, Ciprian Doru Giurcaneanu, Ioan Tabus, Ioan Tabus, Cosmin Stanciu, Cosmin Stanciu, } "Context-based lossless image compression with optimal codes for discretized Laplacian distributions", Proc. SPIE 5014, Image Processing: Algorithms and Systems II, (28 May 2003); doi: 10.1117/12.481916; https://doi.org/10.1117/12.481916
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT


Back to Top