The minimax distortion redundancy in empirical quantizer design

IEEE Transactions on Information Theory

Volumn 44, Issue 5, 1998, Pages 1802-1813

  Bartlett, Peter L ^a,b   Linder, Tarnas ^a,b   Lugosi, Gabor ^a,b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distortion redundancy, empirical quantizer design, lower bounds, minimax convergence rate, vector quantization

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; SET THEORY; VECTOR QUANTIZATION;

MINIMAX DISTORTION REDUNDANCY;

DATA COMPRESSION;

EID: 0032167175     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.705560     Document Type: Article

References (23)

1. K. Alexander, "Probability inequalities for empirical processes and a law of the iterated logarithm," Ann. Prob., vol. 4, pp. 1041-1067, 1984.
2. S. N. Bernstein, The Theory of Probabilities. Moscow, USSR: Gastehizdat, 1946.
3. P. A. Chou, "The distortion of vector quantizers trained on n vectors decreases to the optimum as Op(l/n)," in Proc. IEEE Int. Symp. Information Theory, (Trondheim, Norway, 1994).
4. Y. S. Chow and H. Teicher, Probability Theory, Independence, Interchangeability, Martingales. New York: Springer-Verlag, 1978.
5. L. D. Davisson, "Universal lossless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
6. L. Devroye, L. Györfi, and G. Lugosi, A Probabilistic Theory of Pattern Recognition. New York: Springer-Verlag, 1996.
7. R. M. Gray, J. C. Kieffer, and Y. Linde, "Locally optimum block quantizer design," Inform. Contr., vol. 45, pp. 178-198, 1980.
8. A. N. Kolmogorov and V. M. Tikhomirov, "ε-entropy and ε-capacity of sets in function spaces," Transi. Amer. Math. Soc., vol. 17, pp. 277-364, 1961.
9. Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., vol. COM28, pp. 84-95, 1980.
10. T. Linder, G. Lugosi, and K. Zeger, "Rates of convergence in thé source coding theorem, in empirical quantizer design, and in universal lossy source coding," IEEE Trans. Inform. Theory, vol. 40, pp. 1728-1740, Nov. 1994.
11. _, "Empirical quantizer design in the presence of source noise or channel noise," IEEE Trans. Inform. Theory, vol. 43, pp. 612-623, Mar. 1997.
12. C. L. Mallows, "An inequality involving multinomial probabilities," Biometrika, vol. 55, pp. 422-424, 1968.
13. N. Merhav and J. Ziv, "On the amount of side information required for lossy data compression," IEEE Trans. Inform. Theory, vol. 43, pp. 1112-1121, July 1997.
14. D. L. Neuhoff, R. M. Gray, and L. D. Davisson, "Fixed rate universal block source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-21, pp. 511-523, Sept. 1975.
15. A. Nobel and R. Olshen, personal communication.
16. D. Pollard, "Strong consistency of fc-means clustering," Ann. Statist., vol. 9, pp. 135-140, 1981.
17. _, "A central limit theorem for fc-means clustering," Ann. Prob., vol. 10, pp. 919-926, 1982.
18. _, "Quantization and the method of fc-means," IEEE Trans. Inform. Theory, vol. IT-28, pp. 199-205, 1982.
19. K. Rose, E. Gurewitz, and G. C. Fox, "Vector quantization by deterministic annealing," IEEE Trans. Inform. Theory, vol. 38, pp. 1249-1257, July 1992.
20. P. C. Shields, "When is the weak rate equal to the strong rate?" in Proc. 1994 IEEE-IMS Workshop on Information Theory and Statistics. New York: IEEE, 1994, p. 16.
21. M. Talagrand, "Sharper bounds for Gaussian and empirical processes," Ann. Prob., vol. 22, pp. 28-76, 1994.
22. V. N. Vapnik and A. Ya. Chervonenkis, Theory of Pattern Recognition. Moscow, USSR: Nauka, 1974, in Russian. (German translation: Theorie der Zeichenerkennung. Berlin: Akademie Verlag, 1979.)
23. E. Yair, K. Zeger, and A. Gersho, "Competitive learning and soft competition for vector quantizer design," IEEE Trans. Signal Processing, vol. 40, pp. 294-309, Feb. 1992.