Nondegeneracy and Weak Global Convergence of the Lloyd Algorithm in $\mathbb{R}^d$

DOI10.1137/070691334zbMath1171.65012OpenAlexW2009803967WikidataQ29036896 ScholiaQ29036896MaRDI QIDQ3631922

Alexander Rand, Maria Emelianenko, Lili Ju

Publication date: 22 June 2009

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070691334

zbMATH Keywords

global convergencepattern recognitiondensity functionoptimal quantizationcentroidal Voronoi tessellationLloyd algorithmdata communicationimage renderingimage and data compression

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (6)

Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems ⋮ A versatile technique for the optimal approximation of random processes by functional quantization ⋮ Pointwise Convergence of the Lloyd I Algorithm in Higher Dimension ⋮ A Simple Geometric Method for Navigating the Energy Landscape of Centroidal Voronoi Tessellations ⋮ Fast methods for computing centroidal Voronoi tessellations ⋮ On The Characterization and Uniqueness of Centroidal Voronoi Tessellations

This page was built for publication: Nondegeneracy and Weak Global Convergence of the Lloyd Algorithm in $\mathbb{R}^d$