Convergence of the Lloyd algorithm for computing centroidal voronoi tessellations

SIAM Journal on Numerical Analysis

Volumn 44, Issue 1, 2006, Pages 102-119

  Du, Qiang ^a   Emelianenko, Maria ^b   Ju, Lili ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Centroidal voronoi tessellations; Convergence rate; Global convergence; K means; Lloyd algorithm; Optimal vector quantizer

Indexed keywords

CENTROIDAL VORONOI TESSELLATIONS; CONVERGENCE RATE; GLOBAL CONVERGENCE; K-MEANS; LLOYD ALGORITHM;

ALGORITHMS; COMPUTATIONAL GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; NUMERICAL METHODS; PROBABILITY DENSITY FUNCTION; VECTOR QUANTIZATION;

GRAPH THEORY;

EID: 33847681941     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/040617364     Document Type: Article

References (45)

1. J. BURKARDT, M. GUNZBURGER, AND H.-C. LEE, Centroidal Voronoi tessellation-based reduced-order modeling of complex systems, to appear.
2. M. CAPPELLARI AND Y. COPIN, Adaptive spatial binning of integral-field spectroscopic data using Voronoi tessellations, Monthly Notices Roy. Astronom. Soc., 342 (2003), pp. 345-354.
3. D. COHEN-STEINER, P. ALLIEZ, AND M. DESBRUN, Variational shape approximation, ACM Trans. Graphics, 23 (2004), pp. 905-914.
4. J. CORTES, S. MARTINEZ, T. KARATAS, AND F. BULLO, Coverage control for mobile sensing networks, IEEE Tran. Robotics and Automation, 20 (2004), pp. 243-255.
5. Q. DU AND M. EMELIANENKO, Uniform Convergence of a Multilevel Energy-Based Quantization Scheme, to appear in Proceedings of the 16th International Conference on Domain Decomposition Methods, Lecture Notes Comput. Sci. Engrg., Springer.
6. Q. DU AND M. EMELIANENKO, Acceleration Schemes for Computing Centroidal Voronoi Tessellations, to appear in Proceedings of the 12th Annual Copper Mountain Conference on Multigrid Methods, Special Issue of Numer. Linear Algebra Appl.
7. Q. DU, V. FABER, AND M. GUNZBURGER, Centroidal Voronoi tessellations: Applications and algorithms, SIAM Rev., 41 (1999), pp. 637-676.
8. Q. DU AND M. GUNZBURGER, Grid generation and optimization based on centroidal Voronoi tessellations, Appl. Math. Comput., 133 (2002), pp. 591-607.
9. Q. DU AND M. GUNZBURGER, Centroidal Voronoi tessellation based proper orthogonal decomposition analysis, in Control and Estimation of Distributed Parameter Systems, Internat. Ser. Numer. Math. 143, Birkhäuser, 2002, pp. 137-150.
10. Q. DU, M. GUNZBURGER, AND L. JU, Meshfree, probabilistic determination of point sets and support regions for meshless computing, Comput. Methods Appl. Mech. Engrg., 191 (2002), pp. 1349-1366.
11. Q. DU, M. GUNZBURGER, AND L. JU, Voronoi-based finite volume methods, optimal Voronoi meshes, and PDEs on the sphere, Comput. Methods Appl. Mech. Engrg., 192 (2003), pp. 3933-3957.
12. Q. DU, M. GUNZBURGER, AND L. JU, Constrained centroidal Voronoi tessellations on general surfaces, SIAM J. Sci. Comput., 24 (2003), pp. 1488-1506.
13. Q. DU, M. GUNZBURGER, L. JU, AND X. WANG, Centroidal Voronoi tessellation algorithms for image processing, 3. Math. Imaging Vision, to appear.
14. Q. DU AND L. JU, Finite volume methods and spherical centroidal Voronoi tessellations, SIAM J. Numer. Anal., 43 (2005), pp. 1673-1692.
15. Q. DU AND D. WANG, Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations, Internat. J. Numer. Methods Engrg., 56 (2003), pp. 1355-1373.
16. Q. DU AND D. WANG, Anisotropic centroidal Voronoi tessellations and their applications, SIAM J. Sci. Comput., 26 (2005), pp. 737-761.
17. Q. DU AND D. WANG, New progress in robust and quality Delaunay mesh generation, J. Comput. Appl. Math., to appear.
18. Q. DU AND X. WANG, Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation, in Proceedings of the IEEE Conference on Visualization, Austin, TX, 2004, pp. 43-50.
19. Q. DU AND T. WONG, Numerical studies of the MacQueen's algorithm for computing the centroidal Voronoi tessellations, Comput. Math. Appl., 44 (2002), pp. 511-523.
20. M. EMELIANENKO, Multilevel and Adaptive Methods for Some Nonlinear Optimization Problems, Ph.D. thesis, Penn State University, University Park, PA, 2005.
21. P. FLEISCHER, Sufficient conditions for achieving minimum distortion in a quantizer I, IEEE Int. Convention Record, 1964, pp. 104-111.
22. S. FORTUNE, Voronoi Diagrams and Delaunay Triangulations in Computing in Euclidean Geometry, World Scientific, River Edge, NJ, 1992.
23. A. GERSHO AND R. GRAY, Vector Quantization and Signal Compression, Kluwer, Boston, 1992.
24. R. GRAY, J. KIEFFER, AND Y. LINDE, Locally optimal block quantizer design, Inform, and Control, 45 (1980), pp. 178-198.
25. R. GRAY AND D. NEUHOFF, Quantization, IEEE Trans. Inform. Theory, 44 (1998), pp. 2325-2383.
26. P. GRUBER, Optimum quantization and its applications, Adv. in Math., 186 (2004), pp. 456-497.
27. J. HARTIGAN AND M. WONG, A k-means clustering algorithm, Appl. Stat., 28 (1979), pp. 100-108.
28. P. HECKERT, Color image quantization frame buffer display, ACM Trans. Comput. Graph., 16 (1982), pp. 297-304.
29. S. HILLER, H. HELLWIG, AND O. DEUSSEN, Beyond stippling - methods for distributing objects on the plane, Computer Graphics Forum, 22 (2003), pp. 515-522.
30. L. JU, Q. DU, AND M. GUNZBURGER, Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations, Parallel Comput., 28 (2002), pp. 1477-1500.
31. T. KANUNGO, D. MOUNT, N. NETANYAHU, C. PIATKO, R. SILVERMAN, AND A. WU, An efficient k-means clustering algorithm: Analysis and implementation, IEEE Trans. Pattern Analysis and Machine Intelligence, 24 (2002), pp. 881-892.
32. J. KIEFFER, Uniqueness of locally optimal quantizer for log-concave density and convex error function, IEEE Trans. Inform. Theory, 29 (1983), pp. 42-47.
33. R. KLEIN, Concrete and Abstract Voronoi Diagrams, Lecture Notes in Comput. Sci. 400, Springer, Berlin, 1989.
34. Y. LINDE, A. BUZO, AND R. GRAY, An algorithm for vector quantizer design, IEEE Trans. Comm., 28 (1980), pp. 84-95.
35. S. LLOYD, Least square quantization in PCM, IEEE Trans. Inform. Theory, 28 (1982), pp. 129-137.
36. 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, IL, 1983, pp. 481-490.
37. D. G. LUENBERGER, Linear and Nonlinear Programming, Addison-Wesley, Reading, MA, 1984.
38. J. MACQUEEN, Some methods for classification and analysis of multivariate observations, in Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. I: Statistics, L. Le Cam and J. Neyman, ed., University of California Press, Berkeley, CA, 1967, pp. 281-297.
39. A. MENDES AND I. THEMIDO, Multi-outlet retail site location assessment, Internat. Trans. Oper. Res., 11 (2004), pp. 1-18.
40. U. MOLLER, M. GALICKI, E. BARESOVA, AND H. WITTE, An efficient vector quantizer providing globally optimal-solutions, IEEE Trans. Signal Process., 46 (1998), pp. 2515-2529.
41. A. OKABE, B. BOOTS, AND K. SUGIHARA, Spatial Tessellations; Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, 1992.
42. J. SABIN AND R. GRAY, Global convergence and empirical consistency of the generalized Lloyd algorithm, IEEE Trans. Inform. Theory, 32 (1986), pp. 148-155.
43. A. TRUSHKIN, On the design of an optimal quantizer, IEEE Trans. Inform. Theory, 39 (1993), pp. 1180-1194.
44. S. VALETTE AND J. CHASSERY, Approximated centroidal Voronoi diagrams for uniform polygonal mesh coarsening, Computer Graphics Forum, 23 (2004), pp. 381-390.
45. C. WAGER, B. COULL, AND N. LANGE, Modelling spatial intensity for replicated inhomogeneous point patterns in brain imaging, J. R. Stat. Soc. B Stat. Methodol., 66 (2004), pp. 429-446.