By Topic

Scalable vector quantization architecture for image compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cuhadar, A. ; Gaziantep Univ., Turkey ; Sampson, D. ; Downton, A.

Vector quantization is a popular data compression technique due to its theoretical advantage over scalar quantization which enables exploitation of the dependencies between neighboring samples. However, the complexity of the encoding process imposes certain limitations on the size of the codebook population and/or the dimensions of the processed blocks. The authors show that this complexity can be conveniently distributed as sub-codebooks over general purpose MIMD parallel processors, to provide almost linearly scalable throughput and flexible configurability. A particular advantage of this approach is that it makes feasible the use of the higher dimensional image blocks and/or larger codebooks, leading to improved coding performance with no penalty in execution speed compared with the original sequential implementation

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996