Optimal pruning with applications to tree-structured source coding and modeling
Philip A. Chou, T.D. Lookabaugh, Robert M. Gray · IEEE Transactions on Information Theory · 1989
An algorithm introduced by L. Breiman et al. (1984) in the context of classification and regression trees is reinterpreted and extended to cover a variety of applications in source coding and modeling in which trees are involved. These include variable-rate and minimum-entropy tree-structured vector quantization, minimum expected cost decision trees, variable-order Markov modeling, optimum bit allocation, and computer graphics and image processing using quadtrees. A concentration on the first of these and a detailed analysis of variable-rate tree-structured vector quantization are provided. It is found that variable-rate tree-structured vector quantization outperforms not only the fixed-rate variety but also full-search vector quantization. The successive approximation character of variable-rate tree-structured vector quantization permits it to degrade gracefully if the rate is reduced at the encoder. This has applications to the problem of buffer overflow.>
Cited by 407 works. doi:10.1109/18.32124
Authors
References
- The Art of Computer Programming
- Classification and Regression Trees.
- Neural networks and physical systems with emergent collective computational abilities.
- Information Theory and Reliable Communication
- Information Theory and Reliable Communication.
- Self-Organization and Associative Memory
- An introduction to computing with neural nets
- Neurons with graded response have collective computational properties like those of two-state neurons.
- An Algorithm for Vector Quantizer Design
- Least squares quantization in PCM