We describe a new image coding approach in which a 4-ary arithmetic coder is used to represent signiicant coeecient values and the lengths of zero runs between coeecients. This algorithm works by raster scanning within subbands, and therefore involves much lower addressing complexity than other algorithms such as zerotree coding that require the creation and maintenance of lists of dependencies...

This paper investigates the use of fractal coding for image compression and reconstruction. The encoder exploits self-similarity of the image at different resolutions, mapping larger blocks of the image to similar smaller blocks through a series of contractive transformations. The decoder can apply these transformations iteratively to any image, and recover the original. We show that varying th...

In recent work, various fractal image coding methods are reported, which adopt the selfsimilarity of images to compress the size of images. However, till now, no solutions for the security of fractal encoded images have been provided. In this paper, a secure fractal image coding scheme is proposed and evaluated, which encrypts some of the fractal parameters during fractal encoding, and thus, pr...

This monograph describes current-day wavelet transform image coding systems. As in the first part, steps of the algorithms are explained thoroughly and set apart. An image coding system consists of several stages: transformation, quantization, set partition or adaptive entropy coding or both, decoding including rate control, inverse transformation, de-quantization, and optional processing (see ...

This paper discusses a method for stereo image coding. We assume stereo images that try to imitate the human visual system, i.e. the two camera planes must be coplanar. First we apply an intensity based stereo algorithm using cooperative bidirectional matching with a hierarchical multilevel structure that returns depth eld and occlusion information. This information can be used to estimate the ...

Most state-of-the-art image compression techniques exploit the dependencies between the subbands in a wavelet transformed image. We propose a progressive image coding technique which is based upon the augmented zerotrees of wavelet coeecients. An augmented zerotree can be regarded as a spatial orientation tree with some extended characteristics. Both the coder and decoder require to maintain on...

Today, in the multimedia encoding technology, fractal image coding is an effective coding method without resolution. The effectiveness is because of the high compressing ratio of fractal image coding. But the computational complexity of this coding method is so high that it needs long encoding time. In this paper, a novel fast fractal coding method is constructed to decrease the coding time by ...

In this correspondence, we present a fast and efficient coding algorithm for compound images. Unlike popular mixture raster content (MRC) based approaches, we propose to attack compound image coding problem from the perspective of modeling location uncertainty of image singularities. We suggest that a computationally simple two-class segmentation strategy is sufficient for the coding of compoun...

In order to represent a television image sequence with a minimal number of bits, it is necessary to perform efficient image coding. Transform coding, subband coding, and vector quantization are examples of popular techniques that have been applied to the coding of still and moving images. In the case of moving image sequences, these techniques are often combined with frame-differencing or motio...