A Simple Algorithm for Fast Codebook Search in Image Vector Quantization

벡터 양자화에서 벡터의 특성을 이용한 단축 탐색방법

  • 고종석 (한국 과학 기술원, 전기 및 전자 공학과) ;
  • 김재균 (한국 과학 기술원, 전기 및 전자 공학과) ;
  • 김성대 (한국 과학 기술원, 전기 및 전자 공학과)
  • Published : 1987.07.03

Abstract

We present a very simple algorithm for reducing the encoding (codebook search) complexity of vector quantization (VQ), exploiting some features of a vector currently being encoded. A proposed VQ of 16 (=$4{\times}4$) vector dimension and 256 codewords shows a slight performance degradation of about 0.1-0.9 dB, however, with only 16 or 32 among 256 codeword searches, i.e., with just 1/16 or 1/8 search complexity compared to a full-search VQ. And the proposed VQ scheme is also compared to and shown to be a bit superior to tree-search VQ with regard to their SNR performance and memory requirement.

Keywords