A modified generalised Lloyd algorithm for VQ codebook design

The Linde-Buzo-Gray (LBG) algorithm, which consists of the splitting initialisation method and GLA, plays a basic and important role in codebook generation of VQ. Obviously, there are two approaches along which research efforts may be directed: (i) to improve GLA, and (ii) to improve the initialization procedure. In this paper, a selective GLA driven by a new specified organisation mechanism is proposed as an alternative to GLA. With the initial codebook obtained from a K-d tree based on the greatest co-ordinate variance, the selective GLA generates a better codebook than GLA and the splitting-initialized LBG algorithm. However, the improvement in performance is accompanied by a raise in the computational complexity involved in the design process. A novel version of partial GLA, whose framework is similar to that of the selective GLA, is also described in this paper. It is found to outperform GLA at the expense of an increased amount of computation.