Optimal coding of quantized Laplacian sources for predictive image compression

DOI10.1023/A:1020333827888MaRDI QIDQ1851095zbMATH OpenWikidataFDO

Authors Ciprian Doru Giurcăneanu, Ioan Tabus

Publication date 15 December 2002

Published in Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

zbMATH Keywords

Huffman codesinfinite alphabetspredictive image codingGolomb codesLaplacian source

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Simple compression algorithm for memoryless Laplacian source based on the optimal companding technique
• Design of a hybrid quantizer with variable length code
• Efficient scalar quantization of exponential and Laplacian random variables
• Optimal prefix codes for sources with two-sided geometric distributions
• Permutation codes for the Laplacian source (Corresp.)

Cited in

(8)

• Analysis of joint predictive-transform coding for still image compression
• Multidimensional rotations for robust quantization of image data
• Coding algorithm for grayscale images based on piecewise uniform quantizers
• scientific article; zbMATH DE number 5186268 (Why is no real title available?)
• Design of a hybrid quantizer with variable length code
• Simple compression algorithm for memoryless Laplacian source based on the optimal companding technique
• Image coding with an L/sup ∞/ norm and confidence interval criteria
• Optimization of Packetization Masks for Image Coding Based on an Objective Cost Function for Desired Packet Spreading

This page was built for publication: Optimal coding of quantized Laplacian sources for predictive image compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1851095)