A comparison of growing and pruning balanced and unbalanced tree-structured vector quantizers

Eve A. Riskin, Robert M. Gray

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

Abstract

We examine the question of whether growing and optimally pruning balanced or unbalanced tree-structured vector quantizers will result in lower average distortion. It is shown that growing an unbalanced tree will not always lead to lower distortion than growing a balanced tree, even though the balanced tree has more structure. Conditions are presented under which it is guaranteed that pruning an unbalanced tree will always outperform pruning a balanced tree of the same initial average bit rate. Finally, we present a case where pruning a balanced tree may outperform, at some bit rates, pruning an unbalanced tree of lower initial distortion.

Original languageEnglish
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Pages249
Number of pages1
ISBN (Electronic)0780300564
DOIs
StatePublished - 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: 24 Jun 199128 Jun 1991

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/TerritoryHungary
CityBudapest
Period24/06/9128/06/91

Fingerprint

Dive into the research topics of 'A comparison of growing and pruning balanced and unbalanced tree-structured vector quantizers'. Together they form a unique fingerprint.

Cite this