Deterministic Annealing for Entropy-Constrained Vector Quantizer Design

DOI10.1109/TIT.2008.928262MaRDI QIDQ3604809zbMATH OpenFDO

Authors Kevin M. Holt, David L. Neuhoff

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.2008.928262

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Recommendations

• Vector quantization by deterministic annealing
• Conditional entropy-constrained vector quantization: high-rate theory and design algorithms
• A Rigorous Approach to High-Resolution Entropy-Constrained Vector Quantization
• Multiple description quantization by deterministic annealing
• Vector quantization based on genetic simulated annealing
• scientific article; zbMATH DE number 1135099
• A novel entropy-constrained competitive learning algorithm for vector quantization
• A review on deterministic annealing algorithms based on entropy constraints
• New results on optimal entropy-constrained quantization
• Codecell convexity in optimal entropy-constrained vector quantization

Cited in

(4)

• Multiple description quantization by deterministic annealing
• Vector quantization by deterministic annealing
• Conditional entropy-constrained vector quantization: high-rate theory and design algorithms
• Deterministic generative models for fast feature discovery

This page was built for publication: Deterministic Annealing for Entropy-Constrained Vector Quantizer Design

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