Tree-structured product-codebook vector quantization
β Scribed by Giovanni Poggi; Arturo R.P. Ragozini
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 554 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0923-5965
No coin nor oath required. For personal study only.
β¦ Synopsis
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 for progressive transmission. In this paper tree-structured product-codebook VQ is proposed to carry out low-complexity, low-memory storage VQ, with progressive transmission. The joint design of the tree-structured component codebooks is analyzed and a low-complexity greedy procedure is devised. The proposed approach has been implemented for two applications: the compression of gray-scale images, and the compression of multispectral images by means of the SPIHT algorithm, providing in both cases satisfactory experimental results.
π SIMILAR VOLUMES
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
A tabu search algorithm is proposed for the codebook generation in vector quantization. The key question is the definition of neighboring solution. Making random modifications to the current solution alone is not sufficient. The proposed algorithm first makes non-local changes to the codebook which
In this paper, a novel encoding algorithm for vector quantization is presented. Our method uses a set of transformed codewords and partial distortion rejection to determine the reproduction vector of an input vector. Experimental results show that our algorithm is superior to other methods in terms