By Topic

Two greedy tree growing algorithms for designing variable rate vector quantizers

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)
Zeng, W.J. ; Dept. of Electr. Eng., Notre Dame Univ., IN, USA ; Huang, Y.F. ; Huang, S.C.

This paper presents two variable rate vector quantization schemes for image compression. The idea is to designate more bits to regions of an image that are active or difficult to code, and fewer bits to less active regions. The proposed schemes design variable rate tree-structured vector quantizers by growing the tree one node at a time. Basing the decision to split on some min-max-like criteria other than the conventional mean-squared-error (MSE) measure, these two schemes aim to provide reconstructed images with less noticeable edge degradation. A comparison with a previously proposed scheme of Riskin and (see IEEE Trans. Signal Process., vol.39, no.11, p.2500-2507, 1991) shows that the proposed schemes have better performance in terms of image visual quality with reduced implementational complexity

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:5 ,  Issue: 3 )