Abstract
We address the problem of bit allocation to wavelet subbands by extending the Recursive Optimal Pruning algorithm of Kiang, Baker, Sullivan and Chiu to do bit allocation. We apply the algorithm to tree-structured vector quantizers used to code image subbands that result from the wavelet decomposition. We compare this method to GBFOS bit allocation and show that it produces many additional bit allocations that lie close to the rate-distortion curve.
Original language | English |
---|---|
Pages (from-to) | 2339-2342 |
Number of pages | 4 |
Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
Volume | 4 |
State | Published - 1996 |
Event | Proceedings of the 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP. Part 1 (of 6) - Atlanta, GA, USA Duration: 7 May 1996 → 10 May 1996 |