Linde–Buzo–Gray algorithm
From Wikipedia, the free encyclopedia
 |
This article has multiple issues. Please help improve it or discuss these issues on the talk page.
|
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 [edit]
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 [edit]
- The original paper describing the algorithm, as an extension to Lloyd's algorithm:
- Linde, Y., Buzo, A., Gray, R.M., An Algorithm for Vector Quantizer Design, IEEE Transactions on Communications, vol. 28, pp. 84–94, 1980. (Link)
External links [edit]
 |
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
