Abstract
We study the design of entropy-constrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rates. Both algorithms can be easily extended to design vector quantizers.
| Original language | English |
|---|---|
| Pages (from-to) | 337-346 |
| Number of pages | 10 |
| Journal | Data Compression Conference Proceedings |
| State | Published - 1997 |
| Event | Proceedings of the 1997 Data Compression Conference, DCC'97 - Snowbird, UT, USA Duration: 25 Mar 1997 → 27 Mar 1997 |