Vector quantization

 http://en.wikipedia.org/wiki/Vector_quantization

Vector quantization

From Wikipedia, the free encyclopedia

Please expand this article. More information might be found in a section of the talk page. (February 2009)

Vector quantization is a classical quantization technique from signal processing which allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of points (vectors) into groups having approximately the same number of points closest to them. Each group is represented by its centroid point, as in k-means and some other clustering algorithms.
The density matching property of vector quantization is powerful, especially for identifying the density of large and high-dimensioned data. Since data points are represented by the index of their closest centroid, commonly occurring data have low error, and rare data high error. This is why VQ is suitable for lossy data compression. It can also be used for lossy data correction and density estimation.
Vector quantization is based on the competitive learning paradigm, so it is closely related to the self-organizing map model.

Contents  [hide]  1 Training 2 Applications 2.1 Use in data compression 2.2 Video codecs based on vector quantization 2.3 Audio codecs based on vector quantization 3 See also 4 References 5 External links

[edit] Training

A simple training algorithm for vector quantization is:

1. Pick a sample point at random
2. Move the nearest quantization vector centroid towards this sample point, by a small fraction of the distance
3. Repeat

A more sophisticated algorithm reduces the bias in the density matching estimation, and ensures that all points are used, by including an extra sensitivity parameter:

1. Increase each centroid's sensitivity by a small amount
2. Pick a sample point at random
3. Find the quantization vector centroid with the smallest <distance-sensitivity>
   1. Move the chosen centroid toward the sample point by a small fraction of the distance
   2. Set the chosen centroid's sensitivity to zero
4. Repeat

It is desirable to use a cooling schedule to produce convergence: see Simulated annealing.
The algorithm can be iteratively updated with 'live' data, rather than by picking random points from a data set, but this will introduce some bias if the data is temporally correlated over many samples.

[edit] Applications

Vector quantization is used for lossy data compression, lossy data correction and density estimation.
Lossy data correction, or prediction, is used to recover data missing from some dimensions. It is done by finding the nearest group with the data dimensions available, then predicting the result based on the values for the missing dimensions, assuming that they will have the same value as the group's centroid.
For density estimation, the area/volume that is closer to a particular centroid than to any other is inversely proportional to the density (due to the density matching property of the algorithm).

[edit] Use in data compression

Vector quantization, also called "block quantization" or "pattern matching quantization" is often used in lossy data compression. It works by encoding values from a multidimensional vector space into a finite set of values from a discrete subspace of lower dimension. A lower-space vector requires less storage space, so the data is compressed. Due to the density matching property of vector quantization, the compressed data have errors that are inversely proportional to their density.
The transformation is usually done by projection or by using a codebook. In some cases, a codebook can be also used to entropy code the discrete value in the same step, by generating a prefix coded variable-length encoded value as its output.
The set of discrete amplitude levels is quantized jointly rather than each sample being quantized separately. Consider a K-dimensional vector [x₁,x₂,...,x_k] of amplitude levels. It is compressed by choosing the nearest matching vector from a set of N-dimensional vectors [y₁,y₂,...,y_n].
All possible combinations of the N-dimensional vector [y₁,y₂,...,y_n] form the vector space to which all the quantized vectors belong.
Block Diagram: A simple vector quantizer is shown below

Only the index of the codeword in the codebook is sent instead of the quantized values. This conserves space and achieves more compression.
Twin vector quantization (VQF) is part of the MPEG-4 standard dealing with time domain weighted interleaved vector quantization.

[edit] Video codecs based on vector quantization

This list is incomplete; you can help by expanding it.

• Cinepak

and old versions of its spiritual successors:

• Sorenson codec
• Indeo
• VQA format, used in many games

All of which are superseded by the MPEG family.

[edit] Audio codecs based on vector quantization

This list is incomplete; you can help by expanding it.

• CELP
• G.729
• TwinVQ
• Ogg Vorbis ^[1]
• AMR-WB+
• DTS

[edit] See also

• speech coding
• Ogg Vorbis
• Voronoi diagram
• rate-distortion function
• data clustering
• Learning Vector Quantization
• Centroidal Voronoi tessellation
• Growing Neural Gas, a neural network-like system for vector quantization

Part of this article was originally based on material from the Free On-line Dictionary of Computing and is used with permission under the GFDL.

[edit] References

1. ^ "Vorbis I Specification". Xiph.org. 2007-03-09. Retrieved 2007-03-09.

[edit] External links

• http://www.data-compression.com/vq.html
• QccPack — Quantization, Compression, and Coding Library (open source)
• http://www.mqasem.net/vectorquantization/vq.html
• VQ Indexes Compression and Information Hiding Using Hybrid Lossless Index Coding, Wen-Jan Chen and Wen-Tsung Huang

View page ratings

Rate this page

What's this?

Trustworthy

Objective

Complete

Well-written

I am highly knowledgeable about this topic (optional)

Categories:

• Lossy compression algorithms