Highly scalable hybrid image coding scheme
Digital Signal Processing
The effects of multiview depth video compression on multiview rendering
Image Communication
Image and Vision Computing
On signal representations within the Bayes decision framework
Pattern Recognition
Risk bounds for CART classifiers under a margin condition
Pattern Recognition
| Hi-index | 754.84 |
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