An integrated framework for adaptive subband image coding

Previous work on filter banks and related expansions has revealed an interesting insight: different filter bank trees can be regarded as different ways of constructing orthonormal bases for linear signal expansion. In particular, fast algorithms for finding best bases in an operational rate-distortion (R/D) sense have been successfully used in image coding. Independently of this work, other research has also explored the design of filter banks that optimize energy compaction for a single signal or a class of signals. In this paper, we integrate these two different but complementary approaches to best-basis design and propose a coding paradigm in which subband filters, tree structure, and quantizers are chosen to optimize the R/D performance. These coder attributes represent side information. They are selected from a codebook designed off-line from training data, using R/D as the design criterion. This approach provides a rational framework in which to explore alternatives to empirical design of filter banks, quantizers, and other coding parameters. The on-line coding algorithm is a relatively simple extension of current R/D-optimal coding algorithms that operate with fixed filter banks and empirically designed quantizer codebooks. In particular, it is shown that selection of the best adapted filter bank from the codebook is computationally elementary.

[1]  Henrique S. Malvar,et al.  On the asymptotic performance of hierarchical transforms , 1992, IEEE Trans. Signal Process..

[2]  K Ramchandran,et al.  Best wavelet packet bases in a rate-distortion sense , 1993, IEEE Trans. Image Process..

[3]  M. Effros,et al.  Weighted universal transform coding: universal image compression with the Karhunen-Loeve transform , 1995, Proceedings., International Conference on Image Processing.

[4]  Pierre Moulin A new look at signal-adapted QMF bank design , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[5]  Benoit M. Macq,et al.  Signal-adapted multiresolution transform for image coding , 1992, IEEE Trans. Inf. Theory.

[6]  Michael T. Orchard,et al.  Joint space-frequency segmentation using balanced wavelet packet trees for least-cost image representation , 1997, IEEE Trans. Image Process..

[7]  Carl Taswell,et al.  Satisficing search algorithms for selecting near-best bases in adaptive tree-structured wavelet transforms , 1996, IEEE Trans. Signal Process..

[8]  Mihai Anitescu,et al.  The role of linear semi-infinite programming in signal-adapted QMF bank design , 1997, IEEE Trans. Signal Process..

[9]  Michael T. Orchard,et al.  Wavelet packets-based image coding using joint space-frequency quantization , 1994, Proceedings of 1st International Conference on Image Processing.

[10]  Kannan Ramchandran,et al.  Tilings of the time-frequency plane: construction of arbitrary orthogonal bases and fast tiling algorithms , 1993, IEEE Trans. Signal Process..

[11]  Michael Unser Extension of the Karhunen-Loeve transform for wavelets and perfect reconstruction filterbanks , 1993, Optics & Photonics.

[12]  Michelle Effros,et al.  A vector quantization approach to universal noiseless coding and quantization , 1996, IEEE Trans. Inf. Theory.

[13]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

[14]  K. H. Barratt Digital Coding of Waveforms , 1985 .

[15]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[16]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[17]  Jelena Kovacevic,et al.  Wavelets and Subband Coding , 2013, Prentice Hall Signal Processing Series.

[18]  Yipeng Liu,et al.  Statistically optimized PR-QMF design , 1991, Other Conferences.

[19]  Peter No,et al.  Digital Coding of Waveforms , 1986 .

[20]  Philip A. Chou,et al.  Entropy-constrained vector quantization , 1989, IEEE Trans. Acoust. Speech Signal Process..