Linde–Buzo–Gray algorithm

Updated on Dec 04, 2023

Edit

Comment

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

Linde–Buzo–Gray algorithm Wikipedia

(Text) CC BY-SA