Optimal Coding of Quantized Laplacian Sources for Predictive Image Compression
Journal of Mathematical Imaging and Vision
Algorithms for infinite huffman-codes
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The construction of codes for infinite sets
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Efficient high-performance ASIC implementation of JPEG-LS encoder
Proceedings of the conference on Design, automation and test in Europe
Lossless image compression using adjustable fractional line-buffer
Image Communication
Lossless asymmetric single instruction multiple data codec
Software—Practice & Experience
| Hi-index | 754.84 |
A complete characterization of optimal prefix codes for off-centered, two-sided geometric distributions of the integers is presented. These distributions are often encountered in lossless image compression applications, as probabilistic models for image prediction residuals. The family of optimal codes described is an extension of the Golomb codes, which are optimal for one-sided geometric distributions. The new family of codes allows for encoding of prediction residuals at a complexity similar to that of Golomb codes, without recourse to the heuristic approximations frequently used when modifying a code designed for nonnegative integers so as to apply to the encoding of any integer. Optimal decision rules for choosing among a lower complexity subset of the optimal codes, given the distribution parameters, are also investigated, and the relative redundancy of the subset with respect to the full family of optimal codes is bounded