Complexity-constrained tree-structured vector quantizers
Signal Processing
Tree-Structured Multiple Description Coding
Journal of VLSI Signal Processing Systems
Design of Tree-Structured Multiple Description Vector Quantizers
DCC '01 Proceedings of the Data Compression Conference
Maxdiff kd-trees for data condensation
Pattern Recognition Letters
Entropy constrained color splitting for palette images
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Side-Match predictive vector quantization
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
| Hi-index | 754.84 |
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