Conditional entropy-constrained vector quantization: high-rate theory and design algorithms
From MaRDI portal
Recommendations
- A novel entropy-constrained competitive learning algorithm for vector quantization
- A Lagrangian formulation of Zador's entropy-constrained quantization theorem
- Deterministic Annealing for Entropy-Constrained Vector Quantizer Design
- Conditional entropy coding of VQ indexes for image compression
- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
Cited in
(11)- Distortion-rate models for entropy-coded lattice vector quantization
- n-channel entropy-constrained multiple-description lattice vector quantization
- Redesigning vector quantizers using implicitly estimated probability density functions
- Conditional entropy coding of VQ indexes for image compression
- Constrained-storage vector quantization with a universal codebook
- Codecell convexity in optimal entropy-constrained vector quantization
- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
- A Lagrangian formulation of Zador's entropy-constrained quantization theorem
- On the structure of optimal entropy-constrained scalar quantizers
- n-Channel Asymmetric Entropy-Constrained Multiple-Description Lattice Vector Quantization
- Deterministic Annealing for Entropy-Constrained Vector Quantizer Design
This page was built for publication: Conditional entropy-constrained vector quantization: high-rate theory and design algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857493)