AN ALGORITHM FOR SAR IMAGE

COMPRESSION BASED ON WAVELET

TRANSFORM
GUIDED BY

D.Leela Rani M.Tech., (Ph.d.,)

PRESENTED BY

K. Sai keerthi 07121A0495

S. Reddy vasudeva rao 07121A0493
K. Ashok Kumar 08125A0408
Y. Swetha Reddy 07121A04D0
M. Prathap 08125A0403
Introduction
 SAR image compression techniques are very important
and useful for remote sensing applications .

 SAR image compression is important in image

transmission and archiving.

In order to get reliable data interpretation and quantitative

spots measurements, it is recommended to apply speckle
filtering schemes in SAR image compression.
Block diagram
Speckle noise filtering
 Speckle noise is a kind of multiplicative noise and is
difficult to reduce by direct measure.

Speckle phenomenon results from the coherent

radiation which degrades the image quality and
appears as a granular signal dependent noise .

This multiplicative noise can be turned to additive

noise by pretreatment of logarithm transform.
Types of Transformations
Fourier transform
Short Fourier transform
Discrete wavelet transform
•Discrete Wavelet Transform used here is identical to hierarchial
subband system.

• The image is divided into four subbands and critically subsampled.

• The process continues until some final scale is reached.

first stage of Transforms A two scale DWT

• 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.

• Using an embedded code, an encoder can terminate the

encoding at any point thereby allowing a target rate or
distortion metric to be met exactly.

• When the target is met, the encoding simply stops.

• Similarly the Decoder can cease decoding at any point and

can produce reconstructions.
The EZW algorithm is based on four key steps:

1)A Discrete Wavelet Transform or hierarchical sub band

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.
Zerotree Coding
• Encoding
•The first step in this algorithm is setting up an initial
threshold.

•Any coefficient in the wavelet is said to be significant if its

absolute value is greater than the threshold.

•In a hierarchical sub-band system, every coefficient is

spatially related to a coefficient in the lower band. Such
coefficients in the higher bands are called ‘descendants’.

The relationship between wavelet coefficients

in different subbands as quad-trees
Arithmetic coding

Dynamic system for updating coding intervals

• SAR image compression is important in image
transmission
and archiving.

• Useful for remote sensing applications.

• Able to process even in general purpose application.

• Offer the reliable Scheme in application in GPS.

 
• The application can enhance to digital scheme
in video environment also.

• Creates the room in ADC processing.

It provides the noisy free image by making use of
filtering and EZW image compression algorithm.
[1] Xie H, Pierce LE , Fawwaz TU. SAR speckle
reduction using wavelet denosing and Markov
random field modeling. IEEE Transaction on
Geoscience and Remote Sensing, 2002, 40(10)

[2] Lee J S. Speckle Analysis and Smoothing of

Synthetic Aperture Radar Images. IEEE Computer
Graphics and Processing, 1981, 17 (1): 24232.