A Fast Encoding Method for Vector Quantization Based on 2-Pixel-Merging Sum Pyramid Data Structure

Zhibin Pan, Koji Kotani, Tadahiro Ohmi

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

A fast winner search method for VQ based on 2-pixel-merging sum pyramid is proposed in order to reject a codeword at an earlier stage to reduce the computational burden. The necessary search scope of promising codewords is meanwhile narrowed by using sorted real sums. The high search efficiency is confirmed by experimental results.

Original languageEnglish
Pages (from-to)2419-2423
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE86-A
Issue number9
Publication statusPublished - 2003 Sep

Keywords

  • 2-pixel-merging
  • Fast search
  • Sum pyramid
  • Vector quantization

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A Fast Encoding Method for Vector Quantization Based on 2-Pixel-Merging Sum Pyramid Data Structure'. Together they form a unique fingerprint.

Cite this