The Full Wiki

More info on Linde-Buzo-Gray algorithm

Linde-Buzo-Gray algorithm: Wikis

Advertisements

Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.

Encyclopedia

From Wikipedia, the free encyclopedia

The Linde-Buzo-Gray algorithm is a vector quantization algorithm to derive a good codebook. It is similar to the k-means method in data clustering.

Contents

The algorithm

At each iteration, each vector is split into two new vectors.

  • A initial state: centroid of the training sequence;
  • B initial estimation #1: code book of size 2;
  • C final estimation after LGA: Optimal code book with 2 vectors;
  • D initial estimation #2: code book of size 4;
  • E final estimation after LGA: Optimal code book with 4 vectors;

See also

References

External links


Advertisements






Got something to say? Make a comment.
Your name
Your email address
Message