Abbreviated Journal Title
fast vector quantization; large codebooks; still image compression; Optics
This paper presents a fast K-dimensional tree-based search method to speed up the encoding process for vector quantization. The method is especially designed for very large codebooks and is based on a local search rather than on a global search including the whole feature space. The relations between the proposed method and several existing fast algorithms are discussed. Simulation results demonstrate that with little preprocessing and memory cost, the encoding time of the new algorithm has been reduced significantly while encoding quality remains the same with respect to other existing fast algorithms.
Meyer-Bäse, A.; Jancke, K.; Wismüller, A.; and Georgiopoulos, M., "Fast K-dimensional tree-structured vector quantization encoding method for image compression" (2004). Faculty Bibliography 2000s. 4588.