Vector quantization

This is an old revision of this page, as edited by CBM (talk | contribs) at 02:08, 20 July 2007 (Tagging Image:Vector quantization 2.gif which is up for deletion per CSD using TW). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In data compression, vector quantization is a quantization technique often used in lossy data compression in which the basic idea is to code or replace with a key, values from a multidimensional vector space into values from a discrete subspace of lower dimension.

Explanation

The lower-space vector requires less storage space and the data is thus compressed. The transformation into the subspace is usually achieved through projection, or by using a codebook. In some cases, a codebook implementation 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.

Vector quantization, also called block quantization or pattern matching quantization, is a process of compressing K dimensional vectors to a finite set of N dimensional vectors. Consider a K dimensional vector  . This vector (of amplitude levels) is compressed by choosing the nearest matching vector from a set of N dimensional vectors  .

All possible combinations of the N dimensional vector   form the codebook.

Block Diagram: A simple vector quantizer is shown below

File:Vector quantization.JPG

It is evident that only the index of the codeword in the codebook is sent instead of the quantized values. This conserves space and achieved more compression.

This file may be deleted after Friday, 27 July 2007.

Twin vector quantization (VQF) is part of the MPEG-4 standard dealing with time ___domain weighted interleaved vector quantization.

Video codecs based on vector quantization

Audio codecs based on vector quantization

See also

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.

References

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