Linde–Buzo–Gray algorithm: Difference between revisions

Revision as of 17:27, 6 January 2024

Revision as of 02:55, 9 January 2024

Line 11:

'''output''': codebook that is twice the size and better or as good as ''old-codebook''

''new-codebook'' ←← {}

'''for each''' ''old-codevector'' '''in''' ''old-codebook'' '''do'''

Line 24:

'''do'''

''previous-codebook'' ←← ''codebook''

''clusters'' ←← divide ''training'' into |''codebook''| clusters, where each cluster contains all vectors in ''training'' who are best represented by the corresponding vector in ''codebook''

'''for each''' cluster ''cluster'' in ''clusters'' '''do'''

the corresponding code vector in ''codebook'' ←← the centroid of all training vectors in ''cluster''

'''while''' difference in error representing ''training'' between ''codebook'' and ''previous-codebook'' > {{epsilon}}