Abstract
This paper presents a novel algorithm, which combines both the merits of clustering and integral projections, to solve the entropy-constrained codebook design problem. The experimental results indicate that the proposed algorithm is very efficient and is capable of generating better codebooks than the ECVQ algorithm.