By Topic

Low complexity index-compressed vector quantization 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

2 Author(s)
Yu-Chen Hu ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Taiwan, China ; Chin-Chen Chang

This paper proposes a novel lossless index compression algorithm that explores the interblock correlation in the index domain and the property of the codebook ordering. The goal of this algorithm is to improve the performance of the VQ scheme at a low bit rate while keeping low computation complexity. In this algorithm, the closest codeword in the codebook is searched for each input vector. Then, the resultant index is compared with the previously encoded indices in a predefined search order to see whether the same index value can be found in the neighboring region. Besides, the relative addressing technique is employed to encode the current index if the same index value can not be found in the region. According to the results, the newly proposed algorithm achieves significant reduction of bit rate without introducing extra coding distortion. It is concluded that our algorithm is very efficient and effective for image vector quantization

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:45 ,  Issue: 1 )