Image compression through wavelet transform coding (Q3989577)

A new 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 (measured in one of a family of so-called \(L^ p\) norms) 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 here, then wavelet-based methods are near optimal within a larger class of stable (in a particular mathematical sense) transform-based, nonlinear methods of image compression. Based on previous experimental research on the spatial-frequency-intensity response of the human visual system, it is argued that in most instances the error incurred in image compression should be measured in the integral \((L^ 1)\) sense instead of the mean-square \((L^ 2)\) sense.