By Topic

Joint optimization of scalar and tree-structured quantization of wavelet image decompositions

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)
Zixiang Xiong ; Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA ; Ramchandran, K. ; Orchard, M.T.

Wavelet image decompositions generate a tree-structured set of coefficients, providing an hierarchical data-structure for representing images. While early wavelet-based algorithms for image compression concentrated on optimal quantization of wavelet coefficients, several recent researchers have proposed approaches which couple coefficient quantization (either scalar or vector-based) with various strategies for quantizing the tree itself. This paper proposes an image compression algorithm based on optimal bit rate allocation between scalar and tree-structured quantizers. A predictive approach to representing the pruned tree structure is presented, and the entropy of this representation is included in the optimal allocation problem. The algorithm couples Lagrangian optimization of scalar quantizers with a marginal analysis approach for optimizing the tree structure, and achieves excellent coding efficiency in the rate-distortion sense

Published in:

Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on

Date of Conference:

1-3 Nov 1993