Intrinsic stationarity for vector quantization: Foundation of dual quantization

Details Intrinsic stationarity for vector quantization: Foundation of dual quantization Intrinsic stationarity for vector quantization: Foundation of dual quantization

2010-10-22

arxiv.org/abs/1010.4642v2

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Intrinsic stationarity for vector quantization: Foundation of dual quantization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intrinsic stationarity for vector quantization: Foundation of dual quantization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intrinsic stationarity for vector quantization: Foundation of dual quantization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-659407