Lagrangian empirical design of variable-rate vector quantizers: Consistency and convergence rates

IEEE Transactions on Information Theory

Volumn 48, Issue 11, 2002, Pages 2998-3003

  Linder, Tamás ^a,b  

^a IEEE   (Canada)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Consistency; Convergence rates; Empirical design; Lagrangian performance; Variable rate quantization

Indexed keywords

LLOYD ALGORITHMS; VARIABLE RATE QUANTIZATION;

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; LAGRANGE MULTIPLIERS; OPTIMIZATION; RANDOM PROCESSES;

VECTOR QUANTIZATION;

EID: 0036846974     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.804114     Document Type: Letter

References (23)

1. D. Pollard, "Quantization and the method of k-means," IEEE Trans. Inform. Theory, vol. IT-28, pp. 199-205, Mar. 1982.
2. T. Linder, G. Lugosi, and K. Zeger, "Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding," IEEE Trans. Inform. Theory, vol. 40, pp. 1728-1740, Nov. 1994.
3. P. Bartlett, T. Linder, and G. Lugosi, "The minimax distortion redundancy in empirical quantizer design," IEEE Trans. Inform. Theory, vol. 44, pp. 1802-1813, Sept. 1998.
4. D. Pollard, "Strong consistency of k-means clustering," Ann. Statist., vol. 9, no. 1, pp. 135-140, 1981.
5. ____ "A central limit theorem for k-means clustering," Ann. Probab., vol. 10, no. 4, pp. 919-926, 1982.
6. E. A. Abaya and G. L. Wise, "On the existence of optimal quantizers," IEEE Trans. Inform. Theory, vol. IT-28, pp. 937-940, Nov. 1982.
7. A. J. Zeevi, "On the performance of vector quantizers empirically designed from dependent sources," in Proc. Data Compression Conf. (DCC'98), J. Storer and M. Cohm, Eds. Los Alamitos, CA: IEEE Computer Society Press, 1998, pp. 73-82.
8. S. Graf and H. Luschgy, Foundations of Quantization for Probability Distributions. Berlin, Heidelberg, Germany: Springer-Verlag, 2000.
9. A. György and T. Linder, "On the structure of optimal entropy-constrained scalar quantizers," IEEE Trans. Inform. Theory, vol. 48, pp. 416-427, Feb. 2002.
10. P. A. Chou, T. Lookabaugh, and R. M. Gray, "Entropy-constrained vector quantization," IEEE Trans. Acoust. Speech, Signal Processing, vol. 37, pp. 31-42, Jan. 1989.
11. R. M. Gray, T. Linder, and J. Li, "A Lagrangian formulation of Zador's entropy-constrained quantization theorem," IEEE Trans. Inform. Theory, vol. 48, pp. 695-707, Mar. 2002.
12. R. M. Gray and D. L. Neuhoff. "Quantization," IEEE Trans. Inform. Theory, (Special Commemorative Issue), vol. 44, pp. 2325-2383, Oct. 1998.
13. T. Cover and J. A. Thomas, Elements of Information Theory, New York: Wiley, 1991.
14. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Boston, MA: Kluwer, 1992.
15. A. Gÿrgy and T. Linder, "A note on the existence of optimal entropy-constrained vector quantizers," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, 2002.
16. P. Papantoni-Kazakos and R. M. Gray, "Robustness of estimators on stationary observations," Ann. Probab., vol. 7, pp. 989-1002, 1979.
17. T. Linder, V. Tarokh, and K. Zeger, "Existence of optimal prefix codes for infinite source alphabets," IEEE Trans. Inform. Theory, vol. 43, pp. 2026-2028, Nov. 1997.
18. T. Linder, "On the training distortion of vector quantizers," IEEE Trans. Inform. Theory, vol. 46, pp. 1617-1623, July 2000.
19. P. A. Chou and B. J. Betts, "When optimal entropy-constrained quantizers have only a finite number of codewords," in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 16-21, 1998, p. 97.
20. L. Devroye and G. Lugosi, Combinatorial Methods in Density Estimation. new York: Springer-Verlag, 2000.
21. V. N. Vapnik, Statistical Learning Theory. New York: Wiley, 1998.
22. M. Anthony and P. L. Bartlett, Neural Network Learning: Theoretical Foundations. Cambridge, U.K.: Cambridge Univ. Press, 1999.
23. k do not cut all subsets of k + 2 points," Adv. Math., vol. 31, no. 3, pp. 306-308, 1979.