Share Email Print

Optical Engineering

Fast K-dimensional tree-structured vector quantization encoding method for image compression
Author(s): Anke Meyer-Bäse; Karsten Jancke; Axel Wismüller; Michael Georgiopoulos
Format Member Price Non-Member Price
PDF $20.00 $25.00

Paper 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

Paper Details

PDF: 2 pages
Opt. Eng. 43(5) doi: 10.1117/1.1683885
Published in: Optical Engineering Volume 43, Issue 5, May 2004
Show Author Affiliations
Anke Meyer-Bäse, Florida State Univ. (United States)
Karsten Jancke, Florida State Univ. (United States)
Axel Wismüller, Ludwig-Maximilians-Univ. München (Germany)
Michael Georgiopoulos, Univ. of Central Florida (United States)

© SPIE. Terms of Use
Back to Top