By Topic

Fast entropy-constrained vector quantizer design

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
$33 $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

1 Author(s)
J. Cardinal ; Dept. of Comput. Sci., Brussels Free Univ., Belgium

Vector quantization is the process of encoding vector data as an index to a dictionary-or codebook-of representative vectors. Entropy-constrained vector quantizers (ECVQ) explicitly control the entropy of the output, and are superior to simple nearest-neighbor vector quantizers in terms of rate-distortion performances. ECVQ codebook design based on empirical data involves an expensive training phase in which a Lagrangian cost measure has to be minimized over the set of codebook vectors. In this paper, we describe two new general elimination rules allowing significant acceleration in the codebook design process. These rules use features of the codebook vectors in order to discard most of them as fast as possible during the search. Experimental results are presented on image block data. They show that those new rules perform slightly better than the previously known methods

Published in:

Information Intelligence and Systems, 1999. Proceedings. 1999 International Conference on

Date of Conference: