Abstract
To use wavelet packets for lossy data compression, the following issues must be addressed: quantization of the wavelet subbands, allocation of bits to each subband, and best-basis selection. We present an algorithm for wavelet packets that systematically identifies all bit allocations/best-basis selections on the lower convex hull of the rate-distortion curve. We demonstrate the algorithm on tree-structured vector quantizers used to code image subbands from the wavelet packet decomposition.
| Original language | English |
|---|---|
| Pages (from-to) | 1305-1309 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Image Processing |
| Volume | 8 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 1999 |
Keywords
- Best basis selection
- Bit allocation
- Compression
- Tree-structured vector quantization
- Wavelet packets
Fingerprint
Dive into the research topics of 'Optimal bit allocation and best-basis selection for wavelet packets and TSVQ'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver