A High-Speed Closest Codeword Search Algorithm for Vector Quantization Using the Pyramid Structure of Codewords

DOI Web Site
  • SWILEM Ahmed
    Graduate School of Natural Science Technology, Kanazawa University
  • IMAMURA Kousuke
    Department of Information and Systems Engineering, Kanazawa University
  • HASHIMOTO Hideo
    Department of Information and Systems Engineering, Kanazawa University

Bibliographic Information

Other Title
  • High Speed Closest Codeword Search Algorithm for Vector Quantization Using the Pyramid Structure of Codewords

Search this article

Abstract

Vector quantization (VQ) for image compression requires expensive time to find the closest codeword in both encoding and codebook design. In this paper, we propose a high-speed closest codeword search algorithm applicable to both encoding and codebook design for VQ including entropy-constrained vector quantization (ECVQ). By using a lighter modified distortion measure, we propose an appropriate topological structure of training vectors and codewords to eliminate unnecessary matching operations from the search procedure. This algorithm allows significant acceleration in the codebook design process. Experimental results are presented on image block data. These results confirm the effectiveness of our proposed algorithm.

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top