Joint optimization of scalar and tree-structured quantization of wavelet image decompositions
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.<<ETX>>