Skip to content

Embedded image coding using zerotrees of wavelet coefficients

J.M. Shapiro

IEEE Transactions on Signal Processing · 1993 · 4,816 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Shapiro, J. (1993). Embedded image coding using zerotrees of wavelet coefficients. IEEE Transactions on Signal Processing, 41(12), 3445–3462. https://doi.org/10.1109/78.258085

In text: (Shapiro, 1993)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkably effective, image compression algorithm, having the property that the bits in the bit stream are generated in order of importance, yielding a fully embedded code. The embedded code represents a sequence of binary decisions that distinguish an image from the "null" image. Using an embedded coding algorithm, an encoder can terminate the encoding at any point thereby allowing a target rate or target distortion metric to be met exactly. Also, given a bit stream, the decoder can cease decoding at any point in the bit stream and still produce exactly the same image that would have been encoded at the bit rate corresponding to the truncated bit stream. In addition to producing a fully embedded bit stream, the EZW consistently produces compression results that are competitive with virtually all known compression algorithms on standard test images. Yet this performance is achieved with a technique that requires absolutely no training, no pre-stored tables or codebooks, and requires no prior knowledge of the image source. The EZW algorithm is based on four key concepts: (1) a discrete wavelet transform or hierarchical subband decomposition, (2) prediction of the absence of significant information across scales by exploiting the self-similarity inherent in images, (3) entropy-coded successive-approximation quantization, and (4) universal lossless data compression which is achieved via adaptive arithmetic coding.>

  1. Image quality assessment: from error visibility to structural similarity2004
  2. Textural Features for Image Classification1973
  3. Multiresolution gray-scale and rotation invariant texture classification with local binary patterns2002
  4. Radiomics: Images Are More than Pictures, They Are Data2015
  5. Visual pattern recognition by moment invariants1962

Metadata from OpenAlex (CC0). Citations are generated from the published record.