대한전자공학회논문지SP (Journal of the Institute of Electronics Engineers of Korea SP)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

고속 벡터 양자 부호화를 위한 $L_2$-평균 피라미드 기반 탐색 기법

$L_2$-Norm Pyramid--Based Search Algorithm for Fast VQ Encoding

  • 송병철 (한국과학기술원 전자전산학과) ;
  • 라종범 (한국과학기술원 전자전산학과)
  • Song, Byeong-Cheol (Dept. of Electronic Computer Science, Korea Advanced Institute of Science and Technology) ;
  • Ra, Jong-Beom (Dept. of Electronic Computer Science, Korea Advanced Institute of Science and Technology)
  • 발행 : 2002.01.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

영상 압축을 위한 기법인 벡터 양자 부호화는 입력 벡터와 가장 근사한 부호어를 찾기 위해 일반적으로 상당히 많은 계산량을 요구한다. 본 논문은 벡터 양자 부호화 과정을 고속 처리를 위한 새로운 탐색 기법을 제안한다. 먼저, 탐색 과정에서의 불필요한 정합 연산들을 대폭 줄이기 위해 부호책의 효과적인 기하학적 구조에 기반한 강력한 후보 제거 조간을 유도한다. 그런 다음, 그 후보 제거 조건을 이용한 고속 탐색 기법을 제안한다. 모의 실험 결과는 적은 전처리 연산과 메모리만을 사용하는 제안한 기법이 전역 탐색 기법과 동일한 부호화 성능을 유지하면서 부호화 시간을 대폭 줄일 수 있음을 보인다. 또한 기존 탐색 기법들과 비교할 때, 제안한 기법의 성능이 매우 우수함을 알 수 있다.

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.

키워드

참고문헌

  1. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression, Norwell, MA: Kluwer Academic Press, 1992
  2. Y. Linde, A. Buzo, and R. M. Gray, 'An algorithm for vector quantizer design,' IEEE Trans. Commun., Vol. Vom-28, No. 1, pp. 84-95, Jan. 1980 https://doi.org/10.1109/TCOM.1980.1094577
  3. R. M. Gray, 'Vector qunatization,' IEEE Acoust., Speech, Signal Process. Mag., pp.4-29, April 1984
  4. W. H. Equitz, 'A new vector quantization clustering algorithm,' IEEE Trans. Acoust., Speech, Signal Processing, Vol. 37, No. 10. pp. 1568-1575, Oct. 1989 https://doi.org/10.1109/29.35395
  5. H.Q. Cao and W. Li, 'A fast search algorithm for vector quantization using a directed graph,' IEEE Trans Cricuits Syst. Video Technol., Vol. 10, No. 4, pp. 585-593, June 2000 https://doi.org/10.1109/76.845003
  6. C.D. Bei and R.M. Gray, 'An improvement of the minimum distortion encoding algorithm for vector quantization,' IEEE Trans. Commun, Vol. COM-33, No. 10, pp. 1132-1133, Oct. 1985 https://doi.org/10.1109/TCOM.1985.1096214
  7. M.T. Orchard, 'A fast nearest neighbor search algorithm,' in Proc. IEEE ICASSP, pp. 2297-2300, 1991. https://doi.org/10.1109/ICASSP.1991.150755
  8. C.-M. Huang, Q. Bi, G. S. Stiles and R. W. Harris, 'Fast full search equivalent encoding algorithms for image compression using vector quantiaztion,' IEEE Trans. Image Processing, Vol. 1, No. 3, pp. 413-416, July 1992 https://doi.org/10.1109/83.148613
  9. S.W. Ra and J. K. Kim, 'A fast mean-distance-oriented partial codebook search algorithm for image vector quantization,' IEEE Trans Circuits Syst. Ⅱ: Analog and Digital Signal Processing, Vol. 40, No. 9, pp. 576-579, Sept. 1993 https://doi.org/10.1109/82.257335
  10. W. Li and E.Salari, 'A fast vector quantization encoding method for image compression,' IEEE Trans. Circuits Syst. Video Technol., Vol. 5, No. 2, pp. 119-123, April 1995 https://doi.org/10.1109/76.388060
  11. T. -S. Chen and C. -C. Chang, 'Diagonal axes method (DAM): a fast search algorithm for vector quantization,' IEEE Trans. Circuits Syst. Video Technol., Vol. 7, No. 3, pp. 555-559, June 1997 https://doi.org/10.1109/76.585935
  12. C. -H. Hsieh and Y. -J. Liu, 'Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform,' IEEE Trans. Image Processing, Vol. 9, No. 3, pp. 321-328, March 2000 https://doi.org/10.1109/83.826771
  13. M. H. Johnson, R. E. Ladner, and E.A. Riskin, 'Fast nearest neighbor search of entropy-constrained vector quantization,' IEEE Trans. Image Processing, Vol. 9, No. 8, pp. 1435-1437, August 2000. https://doi.org/10.1109/83.855438
  14. K.-S. Wu and J. -C. Lin, 'Fast VQ encoding by an efficient kick-out condition,' IEEE Trans. Circuits Syst. Video Technol., Vol. 10, No. 1, pp. 59-62, Feb. 2000 https://doi.org/10.1109/76.825859
  15. P.J. Burt and E. Adelson, 'The Laplacian pyramid as a compact image code,' IEEE Trans. Commun. Vol. COM-31, No. 4, pp. 532-540, April 1983 https://doi.org/10.1109/TCOM.1983.1095851