By Topic

A greedy tree growing algorithm for the design of variable rate vector quantizers [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)
Riskin, E.A. ; Inf. Syst. Lab., Stanford Univ., CA, USA ; Gray, R.M.

A technique for directly designing a variable-rate tree-structured vector quantizer by growing the tree one node at a time rather than one layer at time is presented. The technique is a natural extension of a tree growing method for decision trees. When the tree is pruned with a generalized algorithm for optimally pruning trees, improvement is measured in the signal-to-noise ratio at high rates over pruning a fixed-rate tree-structured vector quantizer of the same initial rate. The growing algorithm can be interpreted as a constrained inverse of the pruning algorithm

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 11 )