<title>Analysis-based coding of image transform and subband coefficients</title>

Abstract

Image coding requires an e ective representation of images to provide dimensionality reduction, a quantization strategy to maintain image quality, and nally the error free encoding of quantized coe cients. In the coding of quantized coe cients, Hu man coding and arithmetic coding have been used most commonly and are suggested as alternatives in the JPEG standard. In some recent w ork, zerotree coding has been proposed as an alternate method, that considers the dependence of of quantized coe cients from subband to subband, and thus appears as a generalization of the context-based approach often used with arithmetic coding. In this paper, we propose to review these approaches and discuss them as special cases of an analysis based approach to the coding of coe cients. The requirements on causality and computational complexity implied by arithmetic and zero-tree coding will be studied and other schemes proposed for the choice of the predictive coe cient c o n texts that are suggested by image analysis.

A Fast and Memory Efficient SPIHT Image Encoder

“…Depth-first search approaches [13]- [15] implement a regular SPIHTlike coder but the coding efficiency also decreases. An alternative scan order based upon Morton Order is used in [16]- [20]. Though, they provide less trade-off between rate and image quality, loss in image quality is still a problem.…”

Survey of progressive image transmission methods

“…By omitting intersubband dependencies, a low-complexity and parallel implementation that delivers multiscale decoding is possible (Taubman and Zakhor, 1994). An analysis of EZW that compares a large number of different coding algorithms can also be found in Algazi and Estes (1995). They pointed out the inefficiencies of Shapiro's coder by showing that spatial dependencies can be better exploited by using a larger number of conditioning states for arithmetic coding.…”

Improved RSA Encryption based Medical Image Compression using Fractional Fourier Transform and Modified SPIHT Encoding Scheme

“…BPS first decomposes the whole bitplane into 4 × 4 bit blocks and processes each 4 × 4-bit block at a time. After one 4 × 4-bit block is processed, the next 4×4 bit block is processed in the Morton scanning order [23].…”