Design of a hybrid quantizer with variable length code

DOI10.3233/FI-2010-225MaRDI QIDQ3560557zbMATH OpenOpenAlexFDO

Authors Milan R. Dinčić, Marko D. Petković, Zoran H. Perić

Publication date 14 May 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-225

zbMATH Keywords

lossy compressionuniform quantizercompanding nonuniform quantizerGolomb-Rice codehybrid quantizer

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Simple compression algorithm for memoryless Laplacian source based on the optimal companding technique
• Optimal coding of quantized Laplacian sources for predictive image compression
• scientific article; zbMATH DE number 6174028
• New coding algorithm based on variable-length codewords for piecewise uniform quantizers
• Uniform and piecewise uniform lattice vector quantization for memoryless Gaussian and Laplacian sources

Cited in

(7)

• Optimal coding of quantized Laplacian sources for predictive image compression
• Coding algorithm for grayscale images based on piecewise uniform quantizers
• Simple compression algorithm for memoryless Laplacian source based on the optimal companding technique
• New coding algorithm based on variable-length codewords for piecewise uniform quantizers
• Symmetric quantile quantizer parameterization for the Laplacian source: qualification for contemporary quantization solutions
• Analysis of switched quantizer based on the quadratic spline functions
• scientific article; zbMATH DE number 6174028 (Why is no real title available?)

This page was built for publication: Design of a hybrid quantizer with variable length code

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