Nondegeneracy and weak global convergence of the Lloyd algorithm in ℝD

SIAM Journal on Numerical Analysis

Volumn 46, Issue 3, 2008, Pages 1423-1441

  Emelianenko, Maria ^a   Ju, Lili ^b   Rand, Alexander ^c  

^a GEORGE MASON UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Centroidal Voronoi tessellations; Global convergence; Lloyd algorithm; Quantization

Indexed keywords

CENTERS OF MASSES; CENTROIDAL VORONOI TESSELLATIONS; CONVERGENCE PROPERTIES; CONVERGENCE THEORIES; DENSITY FUNCTIONS; DESCENT METHODS; DIMENSIONAL SPACES; DO-MAINS; ENGINEERING COMMUNITIES; FIXED POINT ITERATIONS; FIXED POINTS; GLOBAL CONVERGENCE; GLOBAL CONVERGENCES; LIMIT POINTS; LLOYD ALGORITHM; LLOYD ALGORITHMS; NON DEGENERACIES; OPTIMAL QUANTIZATIONS; OPTIMAL QUANTIZER; QUANTIZATION; QUANTIZERS; REGULARITY ASSUMPTIONS; STANDARD THEORIES; VORONOI CELLS; VORONOI DIAGRAMS; VORONOI PARTITIONS; VORONOI TESSELLATIONS;

ALGORITHMS; OBJECT RECOGNITION;

CONVERGENCE OF NUMERICAL METHODS;

EID: 55349141820     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/070691334     Document Type: Article

References (25)

1. E. F. ABAYA AND G. L. WISE, Convergence of vector quantizers with applications to optimal quantization, SIAM J. Appl. Math., 44 (1984), pp. 183-189.
2. E. S. BARNES AND N. J. SLOANE, The optimal lattice quantizer in three dimensions, SIAM J. Algebraic Discrete Methods, 4 (1983), pp. 30-41.
3. J. H. CONWAY AND N. J. SLOANE, Sphere Packings, Lattices and Groups, Springer-Verlag, New York, 1988.
4. Q. DU AND M. EMELIANENKO, Uniform convergence of a nonlinear energy-based multilevel quantization scheme via centroidal Voronoi tessellations, SIAM J. Numer. Anal., to appear.
5. Q. DU, M. EMELIANENKO, AND L. JU, Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations, SIAM J. Numer. Anal., 44 (2006), pp. 102-119.
6. Q. DU, V. FABER, AND M. GUNZBURGER, Centroidal Voronoi tessellations: Applications and algorithms, SIAM Rev., 41 (1999), pp. 637-676.
7. Q. DU, M. D. GUNZBURGER, AND L. JU, Constrained centroidal Voronoi tessellations for surfaces, SIAM J. Sci. Comput., 24 (2003), pp. 1488-1506.
8. Q. DU AND D. WANG, Anisotropic centroidal Voronoi tessellations and their applications, SIAM. J. Sci. Comput., 26 (2006), pp. 737-761.
9. P. FLEISCHER, Sufficient conditions for achieving minimum distortion in a quantizer, in IEEE International Convention Record, I, IEEE, Washington, D.C., 1964, pp. 104-111.
10. A. GERSHO AND R. GRAY, Vector Quantization and Signal Compression, Kluwer, Boston, 1992.
11. R. GRAY, J. KIEFFER, AND Y. LINDE, Locally optimal block quantizer design, Inform. and Control, 45 (1980), pp. 178-198.
12. R. GRAY AND D. NEUHOFF, Quantization, IEEE Trans. Inform. Theory, 44 (1998), pp. 2325-2383.
13. P. M. GRUBER, Optimum quantization and its applications, Adv. Math., 186 (2004), pp. 456-497.
14. L. JU, Q. DU, AND M. GUNZBURGER, Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations, Parallel Comput., 28 (2002), pp. 1477-1500.
15. T. KANUNGO, D. M. MOUNT, N. S. NETANYAHU, C. D. PIATKO, R. SILVERMAN, AND A. Y. WU, An efficient k-means clustering algorithm: Analysis and implementation, IEEE Trans. Pattern Anal. Machine Intell., 24 (2002), pp. 881-892.
16. J. KIEFFER, Uniqueness of locally optimal quantizer for log-concave density and convex error function, IEEE Trans. Inform. Theory, 29 (1983), pp. 42-47.
17. Y. LINDE, A. BUZO, AND R. GRAY, An algorithm for vector quantizer design, IEEE Trans. Commun., 28 (1980), pp. 84-95.
18. S. LLOYD, Least squares quantization in PCM, IEEE Trans. Inform. Theory, 28 (1982), pp. 129-137.
19. F. LU AND G. WISE, A further investigation of the Lloyd-Max algorithm for quantizer design, in Proceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Monticello, IL, 1983, pp. 481-490.
20. D. G. LUENBERGER, Linear and Nonlinear Programming, Addison-Wesley, Reading, MA, 1984.
21. D. NEWMAN, The hexagon theorem, IEEE Trans. Inform. Theory, 28 (1982), pp. 137-139.
22. J. SABIN AND R. GRAY, Global convergence and empirical consistency of the generalized Lloyd algorithm, IEEE Trans. Inform. Theory, 32 (1986), pp. 148-155.
23. S. Z. SELIM AND M. A. ISMAIL, K-means-type algorithms: A generalized convergence theorem and characterization of local optimality, IEEE Trans. Pattern Anal. Machine Intell., 6 (1984), pp. 81-87.
24. A. V. TRUSHKIN, Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions, IEEE Trans. Inform. Theory, 28 (1982), pp. 187-198.
25. X. WU, On convergence of Lloyd's method I, IEEE Trans. Inform. Theory, 38 (1992), pp. 171-174.