Skip to Main content Skip to Navigation
Journal articles

Intrinsic stationarity for vector quantization: Foundation of dual quantization

Abstract : We develop a new approach to vector quantization, which guarantees an intrinsic stationarity property that also holds, in contrast to regular quantization, for non-optimal quantization grids. This goal is achieved by replacing the usual nearest neighbor projection operator for Voronoi quantization by a random splitting operator, which maps the random source to the vertices of a triangle of $d$-simplex. In the quadratic Euclidean case, it is shown that these triangles or $d$-simplices make up a Delaunay triangulation of the underlying grid. Furthermore, we prove the existence of an optimal grid for this Delaunay -- or dual -- quantization procedure. We also provide a stochastic optimization method to compute such optimal grids, here for higher dimensional uniform and normal distributions. A crucial feature of this new approach is the fact that it automatically leads to a second order quadrature formula for computing expectations, regardless of the optimality of the underlying grid.
Document type :
Journal articles
Complete list of metadata
Contributor : Benedikt Wilbertz Connect in order to contact the contributor
Submitted on : Monday, March 26, 2012 - 5:18:16 PM
Last modification on : Thursday, December 10, 2020 - 12:32:34 PM
Long-term archiving on: : Wednesday, June 27, 2012 - 2:41:30 AM


Files produced by the author(s)



Gilles Pagès, Benedikt Wilbertz. Intrinsic stationarity for vector quantization: Foundation of dual quantization. SIAM Journal on Numerical Analysis, Society for Industrial and Applied Mathematics, 2012, pp.50(2), 747-780. ⟨10.1137/110827041⟩. ⟨hal-00528485v2⟩



Les métriques sont temporairement indisponibles