Optimum bit allocation via the generalized Breiman, Friedman, Olshen, and Stone algorithm

Eve A. Riskin, Robert M. Gray

Research output: Contribution to conferencePaperpeer-review

Abstract

Summary form only given, as follows. An extension of Breiman, Friedman, Olshen, and Stone's algorithm for optimal pruning in tree-structured classification and regression is applied to bit allocation. It uses a simple tree model to deallocate bits from classes of a coder, resulting in a set of variable-rate codes of different average rates. When applied to classified vector quantization, it leads to a 3.4-dB gain in the signal-to-noise ratio of a magnetic resonance image coded at 1 b/pixel over fixed-rate classified vector quantization at the same rate.

Original languageEnglish
Pages12-13
Number of pages2
StatePublished - 1990
Event1990 IEEE International Symposium on Information Theory - San Diego, CA, USA
Duration: 14 Jan 199019 Jan 1990

Conference

Conference1990 IEEE International Symposium on Information Theory
CitySan Diego, CA, USA
Period14/01/9019/01/90

Fingerprint

Dive into the research topics of 'Optimum bit allocation via the generalized Breiman, Friedman, Olshen, and Stone algorithm'. Together they form a unique fingerprint.

Cite this