๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal pruning for tree-structured vector quantization

โœ Scribed by Jianhua Lin; James A. Storer; Martin Cohn

Book ID
113330457
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
718 KB
Volume
28
Category
Article
ISSN
0306-4573

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tree-structured vector quantization for
Tree-structured vector quantization for speech recognition
โœ M. Barszcz; W. Chen; G. Boulianne; P. Kenny ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 90 KB

We describe some new methods for constructing discrete acoustic phonetic hidden Markov models (HMMs) using tree quantizers having very large numbers (16-64 K) of leaf nodes and tree-structured smoothing techniques. We consider two criteria for constructing tree quantizers (minimum distortion and min

Tree-structured product-codebook vector
Tree-structured product-codebook vector quantization
โœ Giovanni Poggi; Arturo R.P. Ragozini ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 554 KB

To carry out vector quantization (VQ) on large vectors, and hence obtain a good performance, it is necessary to introduce some structural constraint in the encoder. Product-codebook VQ reduces memory storage and encoding complexity. Tree-structured VQ reduces encoding complexity as well, and allows