Joint optimal bit allocation and best-basis selection for wavelet packet trees

Jill R. Goldschneider, Eve A. Riskin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper, an algorithm for wavelet packet trees that can systematically identify all bit allocations/best-basis selections on the lower convex hull of the rate-distortion curve is presented. The algorithm is applied to tree-structured vector quantizers used to code image subbands that result from the wavelet packet decomposition. This method is compared to optimal bit allocation for the discrete wavelet transform.

Original languageEnglish
Title of host publicationProceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998
Pages2693-2696
Number of pages4
DOIs
StatePublished - 1998
Event1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 - Seattle, WA, United States
Duration: 12 May 199815 May 1998

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume5
ISSN (Print)1520-6149

Conference

Conference1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998
Country/TerritoryUnited States
CitySeattle, WA
Period12/05/9815/05/98

Fingerprint

Dive into the research topics of 'Joint optimal bit allocation and best-basis selection for wavelet packet trees'. Together they form a unique fingerprint.

Cite this