The well-known LEG algorithm uses binary splitting for generating an i
nitial codebook, which is then iteratively improved by the generalized
Lloyd algorithm (GLA). We study different variants of the splitting m
ethod and its application to codebook generation with and without the
GLA, A new iterative splitting method is proposed, which is applicable
to codebook generation without the GLA, Experiments show that the imp
roved splitting method outperforms both the GLA and the other existing
splitting-based algorithms, The best combination uses hyperplane part
itioning of the clusters along the principal axis as proposed by Wu an
d Zhang, integrated with a local repartitioning phase at each step of
the algorithm. (C) 1997 Society of Photo-Optical Instrumentation Engin
eers.