Variable-rate tree-structured vector quantizers

Author

Balakrishnan, Mahesh ; Pearlman, William A. ; Lu, Ligang

Author_Institution

Video Commun. Dept., Philips Lab., Briarcliff Manor, NY, USA

Volume

41

Issue

4

fYear

1995

fDate

7/1/1995 12:00:00 AM

Firstpage

917

Lastpage

930

Abstract

In general, growth algorithms for optimal tree-structured vector quantizers do not exist. In this paper we show that if the source satisfies certain conditions; namely, that of diminishing marginal returns; optimal growth algorithms do exist. We present such an algorithm and compare its performance with that of other tree growth algorithms. Even for sources that do not meet the necessary conditions for the growth algorithm to be optimal, such as for speech with unknown statistics, it is seen by simulation that the algorithm outperforms other known growth algorithms, For sources that do not satisfy the required conditions, the algorithm presented here can also be used to grow the initial tree for the pruning process. The performance of such pruned trees is superior to that of trees pruned from full trees of the same rate

Keywords

trees (mathematics); vector quantisation; diminishing marginal returns; necessary conditions; optimal growth algorithms; optimal tree-structured vector quantizers; performance; pruned trees; pruning process; simulation; speech; tree growth algorithms; unknown statistics; variable-rate tree-structured VQ; Books; Laboratories; Performance loss; Rate-distortion; Speech; Statistics; Systems engineering and theory; Vector quantization; Videoconference;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.391239

Filename

391239