Vector quantization codebook generation using simulated annealing

Abstract

The authors present an algorithm for the generation of codebooks from a set of training vectors using simulated annealing. Convergence of the algorithm to the globally optimal codebook in finite time is proved, and experimental results comparing simulated annealing with Lloyd algorithms for image quantization are presented. The experimental results indicate that the proposed algorithm obtains the best known codebook for the experimental situation described by R.M. Gray and E.D. Karnin (IEEE Trans. on Inf. Theory, vol.IT-28, no.2, p.256-61, Mar. 1982). It has also been demonstrated that this technique works well for the construction of codebooks from real image data.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>