### ECE

## 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, 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 prestored 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,

4) Universal lossless data compression which is achieved via adaptive arithmetic coding.

EZW encoding does not really compress anything; it only reorders wavelet coefficients in such a way that they can be compressed very efficiently. An EZW encoder should therefore always be followed by a symbol encoder, for instance an arithmetic encoder.

Click Here to Download

## No comments:

## Post a Comment