This paper proposes an algorithm for improving the performance of standard block transform coding algorithms by better exploiting the correlations between transform coefficients. While standard algorithms focus on decorrelating coefficients within each block, the new approach focuses on exploiting correlations between coefficients of different blocks. Interblock correlations are minimized by linearly estimating coefficients from previously transmitted neighboring block coefficients. The use of linear estimators between blocks leads to a nonorthogonal representation of the image. Quantization issues relating to this nonorthogonal transform are addressed, and an image coding implementation is simulated. Simulations demonstrate that large improvements are observed over standard block transform coding systems, over a wide range of bitrates.
[1]
Gene H. Golub,et al.
Matrix computations
,
1983
.
[2]
Pierre Moulin.
Optimal L/sup 2/ approximation of images in nonorthogonal multiresolution bases
,
1993,
1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[3]
Stéphane Mallat,et al.
Matching pursuits with time-frequency dictionaries
,
1993,
IEEE Trans. Signal Process..
[4]
K. Ramchandran,et al.
Joint optimization of scalar and tree-structured quantization of wavelet image decompositions
,
1993,
Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[5]
Jerome M. Shapiro,et al.
Embedded image coding using zerotrees of wavelet coefficients
,
1993,
IEEE Trans. Signal Process..