Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems

DOI10.1109/TIT.2007.911170MaRDI QIDQ3604514zbMATH OpenOpenAlexFDO

Authors Dan Muresan, Michelle Effros

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.911170

zbMATH Keywords

multiple descriptionsmultiresolutionOptimal designscalar quantizersuccessive refinementWyner-Ziv

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Optimal two-description scalar quantizer design
• Quantizer monotonicities and globally optimal scalar quantizer design
• Network Vector Quantization
• Design of multiple description scalar quantizers
• Design of entropy-constrained multiple-description scalar quantizers

Cited in

(4)

• Optimal two-description scalar quantizer design
• An iterative method for optimal resolution-constrained polar quantizer design
• Algorithms for optimal multi-resolution quantization
• An effective method for initialization of Lloyd-Max's algorithm of optimal scalar quantization for Laplacian source

This page was built for publication: Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems

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