By Topic

A new efficient image compression technique with index-matching vector quantization

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)
Wen-Shiung Chen ; Dept. of Electr. Eng., Feng Chia Univ., Taichung, Taiwan ; En-hui Yang ; Zhen Zhang

A new efficient image compression technique is presented for low cost applications, such as multimedia and video-conferencing. Since address vector quantization (A-VQ) proposed by Nasrabadi and Feng (1990) for image coding, has the main disadvantage of high computational complexity of reordering the address codebook at the transmitter and the receiver during the encoding of each block, we propose a new efficient approach to overcome this disadvantage. The proposed algorithm is based on tree search vector quantization via, multi-path search and index matching in the index codebook, and may achieve a better performance as well as low computational complexity. We theoretically prove that the proposed algorithm is superior to the A-VQ algorithm and experimentally show that a lower bit rate than that of the A-VQ is obtained

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:43 ,  Issue: 2 )