A new, fast, and efficient image codec based on set partitioning in hierarchical trees

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Most cited references 12

Record: found
Abstract: not found
Article: not found

Embedded image coding using zerotrees of wavelet coefficients

J.M. Shapiro (1993)

0 comments Cited 297 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: not found

Image coding using wavelet transform.

M. Antonini, M Barlaud, P. Mathieu … (1992)

A scheme for image compression that takes into account psychovisual features both in the space and frequency domains is proposed. This method involves two steps. First, a wavelet transform used in order to obtain a set of biorthogonal subclasses of images: the original image is decomposed at different scales using a pyramidal algorithm architecture. The decomposition is along the vertical and horizontal directions and maintains constant the number of pixels required to describe the image. Second, according to Shannon's rate distortion theory, the wavelet coefficients are vector quantized using a multiresolution codebook. To encode the wavelet coefficients, a noise shaping bit allocation procedure which assumes that details at high resolution are less visible to the human eye is proposed. In order to allow the receiver to recognize a picture as quickly as possible at minimum cost, a progressive transmission scheme is presented. It is shown that the wavelet transform is particularly well adapted to progressive transmission.