Bit allocation via recursive optimal pruning with applications to wavelet/VQ image compression

Author

Goldschneider, Jill R. ; Riskin, Eve A.

Author_Institution

Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA

Volume

4

fYear

1996

fDate

7-10 May 1996

Firstpage

2339

Abstract

We address the problem of bit allocation to wavelet subbands by extending the recursive optimal pruning algorithm of Kiang, Baker, Sullivan and Chiu (see IEEE Transactions on Image Processing, vol.1, no.4, p.162-9, 1992) to 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 the GBFOS algorithm, that is, the generalized Breiman, Friedman, Olshen, and Stone (1984) bit allocation, and show that it produces many additional bit allocations that lie close to the rate-distortion curve

Keywords

image coding; optimisation; rate distortion theory; vector quantisation; wavelet transforms; GBFOS algorithm; bit allocation; image coding; image subbands; rate distortion curve; recursive optimal pruning algorithm; tree-structured vector quantizers; wavelet decomposition; wavelet subbands; wavelet/VQ image compression; Bit rate; Code standards; Image coding; Propagation losses; Rate-distortion; Speech; Time sharing computer systems; Vector quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on

Conference_Location

Atlanta, GA

ISSN

1520-6149

Print_ISBN

0-7803-3192-3

Type

conf

DOI

10.1109/ICASSP.1996.547751

Filename

547751