Linde–Buzo–Gray algorithm
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;
gollark: They have low margins on the products but charge a monthly subscription fee for access.
gollark: Costco is quite a cool model in general.
gollark: ddg! Bra-ket notation physics
gollark: In hypothetical ideal world™, you could remove all spending on marketing and such, stick all the people working on products into well-incentivized teams as is optimal for development, spread the best innovations everywhere without patent/IP hurdles, etc.
gollark: Unfortunately, good luck constructing that!
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.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.