Optimal Pruning with Applications to Tree-Structured Source Coding and Modeling

IEEE Transactions on Information Theory

Volumn 35, Issue 2, 1989, Pages 299-315

  Chou, Philip A ^a   Lookabaugh, Tom ^b   Gray, Robert M ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b Compression Labs Inc ^*  (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; IMAGE PROCESSING; MATHEMATICAL TECHNIQUES--TREES; SIGNAL PROCESSING--SIGNAL ENCODING; STATISTICAL METHODS--REGRESSION ANALYSIS;

OPTIMAL PRUNING; QUADTREES; REGRESSION TREES; TREE-STRUCTURED SOURCE CODING; TREE-STRUCTURED VECTOR QUANTIZATION;

INFORMATION THEORY;

EID: 0024626309     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.32124     Document Type: Article

References (38)

1. R. J. Higgins, Electronics with Digital and Analog Integrated Circuits. Englewood Cliffs, NJ: Prentice-Hall, 1983.
2. A. Buzo, A. H. Gray, Jr., R. M. Gray, and J. D. Markel, “Speech coding based upon vector quantization,” IEEE Trans. Inform. Theory, vol. IT-28, no. 5, pp. 562-574, Oct. 1980.
3. J. H. Friedman, J. L. Bentley, and R. A. Finkel, “An algorithm for finding best matches in logarithmic expected time,” ACM Trans. Math. Software, vol. 3, pp. 209-226, Sept. 1977.
4. D. Cheng and A. Gersho, “A fast codebook search algorithm for nearest neighbor pattern matching,” in Proc. ICASSP, IEEE Acoustics, Speech, and Signal Processing Society, 1986, pp. 265-268.
5. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. The Wadsworth Statistics/Probability Series. Belmont, CA: Wadsworth, 1984.
6. P. Chou and R. M. Gray, “On decision trees for pattern recognition,” presented at Int. Symp. on Information Theory, IEEE Information Theory Group, Oct. 1986.
7. R. G. Gallager, Information Theory and Reliable Communication. New York: John Wiley, 1968.
8. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
9. L. Hyafil and R. L. Rivest, “Constructing optimal binary decision trees is np-complete,” Inform. Process Lett., vol. 5, pp. 15-17, May 1976.
10. R. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 460-473, July 1972.
11. D. E. Knuth, The Art of Computer Programming, vol. 1. Reading, MA: Addison-Wesley, 1973.
12. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures andAlgorithms. Reading, MA: Addison-Wesley, 1983.
13. P. A. Chou, “A procedure to design efficient probabilistic decision trees,” Master's thesis, University of California, Berkeley, CA, May 1983.
14. Y. Ephraim and R. M. Gray, “A unified approach for encoding clean and noisy sources by means of waveform and autoregressive model vector quantization,” IEEE Trans. Inform. Theory, vol. 34, pp. 826-834, July 1988.
15. J. Rissanen, “A universal data compression system,” IEEE Trans. Inform. Theory, vol. IT-29, no. 5, pp. 656-664, Sept. 1983.
16. S. Itoh and T. Kawabata, “A universal data compression algorithmwith parameter variance estimates,” in Proc. VIIth Symposium onInformation Theory and Its Applications, Nara, Japan, Dec. 1985 (inJapanese), pp. 239-244.
17. S. E. Elnahas, K. Tzou, and J. G. Dunham, “Source modelling forarithmetic codes with applications to low-rate image coding,” Rep.TN 86-188.4, GTE Laboratories Inc., Waltham, MA, Apr. 1986.
18. D. J. Vaisey and A. Gersho, “Variable block-size image coding,” in Proc. ICASSP, Dallas, TX, IEEE Acoustics, Speech, and SignalProcessing Society, Apr. 1987, pp. 1051-1054.
19. B. Von Herzen and A. Barr, “Accurate triangulations of deformed, intersecting surfaces,” in Proc. SIGGRAPH, Anaheim, CA, ACMSpecial Interest Group on Computer Graphics, pp. 103-110, July1987.
20. Y. Shoham and A. Gersho, “Efficient codebook allocation for anarbitrary set of vector quantizers,” in Proc. ICASSP, IEEE Acoustics, Speech, and Signal Processing Society, 1985, pp. 1696-1699.
21. A. M. Bruckstein, “On ‘soft’ bit allocation,” IEEE Trans. Acoust.Speech Signal Process., vol. 35, pp. 614-617, May 1987.
22. A. Gersho and V. Cuperman, “Vector quantization: A patternmatching technique for speech coding,” IEEE Commun. Mag., vol. 21, pp. 15-21, Dec. 1983.
23. R. M. Gray, “Vector quantization,” IEEE ASSP Mag., vol. 1, pp. 4-29, Apr. 1984.
24. J. Makhoul, S. Roucos, and H. Gish, “Vector quantization inspeech coding,” Proc. IEEE, vol. 73, pp. 1551-1588, 1985.
25. S. P. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inform. Theory, vol. IT-28, no. 2, pp. 129-136, Mar. 1982.
26. Y. Linde, A. Buzo, and R. M. Gray, “An algorithm for vectorquantizer design,” IEEE Trans. Commun., vol. COM-28, pp. 84-95, Jan. 1980.
27. R. M. Gray and H. Abut, “Full search and tree searched vectorquantization of speech waveforms,” in Proc. ICASSP, IEEEAcoustics, Speech, and Signal Processing Society, 1982, pp. 593-596.
28. R. M. Gray and Y. Linde, “Vector quantizers and predictive vector quantizers for Gauss-Markov sources,” IEEE Trans. Commun., vol. COM-30, pp. 381-389, Feb. 1982.
29. D. Y. Wong, B. H. Juang, and A. H. Gray, Jr., “An 800 bit/s vector quantization LPC vocoder,” IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-30, pp. 770-780, Oct. 1982.
30. A. Haoui and D. G. Messerschmitt, “Embedded coding of speech: A vector quantization approach,” in Proc. ICASSP, IEEE Acoustics, Speech, and Signal Processing Society, 1985, pp. 1703-1706.
31. B. Hammer, A. V. Brandt, and M. Schielein, “Heirarchical encoding of image sequences using multistage vector quantization,” in Proc. ICASSP, Dallas, TX, IEEE Acoustics, Speech, and Signal Processing Society, Apr. 1987, pp. 1055-1058.
32. C. Yeh, “Color image-sequence compression using adaptive binary-tree vector quantization with codebook replenishment,” in Proc. ICAASP, Dallas, TX, IEEE Acoustics, Speech, and Signal Processing Society, Apr. 1987, pp. 1055-1058.
33. J. Barrilleaux, R. Hinkle, and S. Wells, “Efficient vector quantization for color image encoding,” in Proc. ICAASP, Dallas, TX, IEEE Acoustics, Speech, and Signal Processing Society, Apr. 1987, pp. 740-743.
34. G. Davidson and A. Gersho, “Application of a VLSI vector quantizer processor to Realtime speech coding,” IEEE J. Selected Areas Commun., vol. 4, pp. 112-124, Jan. 1986.
35. H. Abut, B. P. M. Tao, and J. L. Smith, “Vector quantizer architectures for speech and image coding,” in Proc. ICAASP, (Dallas, TX, IEEE Acoustics, Speech, and Signal Processing Society, Apr. 1987, pp. 756-759.
36. R. Dianysian and R. L. Baker, “A VLSI chip set for real time vector quantization of image sequences,” in Proc. ISCS, IEEE Circuits and Systems Society, May 1987.
37. R. J. Fontana, “A class of composite sources and their ergodic and information theoretic properties,” Ph.D. thesis, Stanford University, Stanford, CA, 1978.
38. P. A. Chou, T. Lookabaugh, and R. M. Gray, “Entropy-constrained vector quantization,” IEEE Trans. Acoust., Speech, Signal Process., vol. 37, pp. 31-42, Jan. 1989.