Image compression through wavelet transform coding
Ronald DeVore, Bjorn D. Jawerth, Bradley J. Lucier · IEEE Transactions on Information Theory · 1992
A novel theory is introduced for analyzing image compression methods that are based on compression of wavelet decompositions. This theory precisely relates (a) the rate of decay in the error between the original image and the compressed image as the size of the compressed image representation increases (i.e., as the amount of compression decreases) to (b) the smoothness of the image in certain smoothness classes called Besov spaces. Within this theory, the error incurred by the quantization of wavelet transform coefficients is explained. Several compression algorithms based on piecewise constant approximations are analyzed in some detail. It is shown that, if pictures can be characterized by their membership in the smoothness classes considered, then wavelet-based methods are near-optimal within a larger class of stable transform-based, nonlinear methods of image compression. Based on previous experimental research it is argued that in most instances the error incurred in image compression should be measured in the integral sense instead of the mean-square sense.>
Cited by 910 works. doi:10.1109/18.119733
Authors
References
- A Practical Guide to Splines
- Orthonormal bases of compactly supported wavelets
- The Laplacian Pyramid as a Compact Image Code
- Multiresolution approximations and wavelet orthonormal bases of 𝐿²(𝑅)
- A block spin construction of ondelettes. Part I: Lemari� functions
- Wavelets and Operators
- Multiresolution Approximations and Wavelet Orthonormal Bases of L 2 (R)
- An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder
- A discrete transform and decompositions of distribution spaces
- Compression of wavelet decompositions