Jump to content

Linde–Buzo–Gray algorithm

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 17:44, 27 February 2020 (Removed URL that duplicated unique identifier. | You can use this bot yourself. Report bugs here. | Activated by User:AManWithNoPlan | via #UCB_toolbar). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Linde–Buzo–Gray algorithm (introduced by Yoseph Linde, Andrés Buzo and Robert M. Gray in 1980) is a vector quantization algorithm to derive a good codebook.

It is similar to the k-means method in data clustering.

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;

References

  • The original paper describing the algorithm, as an extension to Lloyd's algorithm:
    • Linde, Y.; Buzo, A.; Gray, R. (1980). "An Algorithm for Vector Quantizer Design". IEEE Transactions on Communications. 28: 84–95. doi:10.1109/TCOM.1980.1094577.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Linde–Buzo–Gray_algorithm&oldid=942915618"