A fast method of designing better codebooks for image vector quantization

A maximum descent (MD) method is proposed as an alternative to the generalized Lloyd (LBG) algorithm for vector quantization codebook generation. Compared with the LBG algorithm, the MD algorithm requires far less computation and generates codebooks that are superior in quality. This paper investigates and compares the performances of various partition techniques in the MD algorithm. In image vector quantization, the MD algorithm can produce codebooks with about 1 dB improvement in peak signal to noise ratio in less than 1/100 of the time required by the LBG algorithm