1 May 2004 Fast K-dimensional tree-structured vector quantization encoding method for image compression
Author Affiliations +
Optical Engineering, 43(5), (2004). doi:10.1117/1.1683885
Abstract
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
Anke Meyer-Bäse, Karsten Jancke, Axel Wismüller, Michael Georgiopoulos, "Fast K-dimensional tree-structured vector quantization encoding method for image compression," Optical Engineering 43(5), (1 May 2004). http://dx.doi.org/10.1117/1.1683885
JOURNAL ARTICLE
2 PAGES


SHARE
Back to Top