Linde-Buzo-Gray algorithm
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.
[edit] 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 4 vectors;
- D initial estimation #2: code book of size 4;
- E final estimation after LGA: Optimal code book with 4 vectors;
[edit] See also
- Canopy clustering algorithm
- Data clustering
- K-means algorithm
- ELBG - Enhanced LBG
