September 10, 2007 / Vol. 5, No. 9 / CHINESE OPTICS LETTERS 509
Speckle reduction of SAR images using ICA basis
enhancement and separation
Yutong Li (
) and Yue Zhou (
)
Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200240
Received April 6, 2007
An approach for synthetic aperture radar (SAR) image de-noising based on independent component anal-
ysis (ICA) basis images is proposed. Firstly, the basis images and the code matrix of the original image
are obtained using ICA algorithm. Then, pointwise H¨older exponent of each basis is computed as a cost
criterion for basis enhancement, and then the enhanced basis images are classified into two sets according
to a separation rule which separates the clean basis from the original basis. After these key procedures
for speckle reduction, the clean image is finally obtained by reconstruction on the clean basis and original
code matrix. The reconstructed image shows better visual perception and image quality compared with
those obtained by other traditional techniques.
OCIS codes: 100.0100, 030.6140, 280.6730, 350.4600.
Synthetic aperture radar (SAR) sensors can produce
range imagery of high spatial resolution under different
conditions. However, the images suffer from the effects
of speckle noise. Thus, speckle reduction is a key step
for desirable image quality. For this application, Lee de-
veloped a linear approximation filter based on the min-
imum mean-square error (MMSE) criterion in 1980
[1]
,
and Kuan presented a generalized filter of Lee’s in
1985
[2]
. Wavelet thresholding shrinkage was proposed in
1995
[3]
. Taking advantage of the excellent performance
of independent component analysis (ICA), a method
namely sparse code shrinkage was proposed as a novel
improvement
[4]
. However, conventional algorithms lack
consideration on the basis information obtained by in-
dependent component analysis (ICA)
[5]
, which usually
contains substantial knowledge for our denoising work.
Based on extensive study on these meaningful basis, we
propose a novel theory for SAR image dispeckling in this
paper. The proposed method contains two key proce-
dures, basis enhancement and basis separation. As to the
former, we extend the signal enhancement algorithm by
Vehel
[6]
for image application and use pointwise H¨older
exponent as a criterion for basis enhancement; as to the
latter, based on the proposed separation theory and sep-
aration rule, we further classify the enhanced basis into
two types respectively called ‘clean’ basis and ‘noise’ ba-
sis, which belong to corresponding subspaces, ‘clean’ and
‘noise’. After these procedures, the clean image is ob-
tained by reconstruction on the clean basis.
ICA is a statistical method for transforming an ob-
served multi-dimensional random vector into components
that are mutually independent. Denoted by X the ob-
served matrix: X = {x
1
,x
2
,x
3
, ··· ,x
m
}
T
,byS the in-
dependent components matrix (or sparse code matrix):
S = {s
1
,s
2
,s
3
, ··· ,s
n
}
T
,andbyA(m × n, m > n)the
mixed matrix, the linear representation can be given by
X = AS or S = WX, (1)
where x
i
(i =1, ··· ,m) is the observed signal and s
i
(i =1, ··· ,n) is the independent component, W namely
demixed matrix or transformation matrix is the pseudo
inverse of A,thatisW = A
+
. In the following content,
we replace x
i
, s
i
with x, s for short.
The independent components in ICA are obtained by
maximizing non-Gaussianity measure, which is equiva-
lent to searching for sparse representation. Thus, ICA
gives sparse codes for natural images. According to
sparse coding theory
[4]
, the localized and compact dis-
tribution of energy in images suggests that they have a
“sparse structure”, which means any image can be repre-
sented by a relatively small number of descriptors out of
a much larger set to choose from. Thus, an image I(x, y)
can be modelled as a linear superposition of basis φ
k
,
which can be defined as
I(x, y)=[
k
s
k,b
φ
k
],k=1, ··· ,n, (2)
where s
k,b
is the element of code matrix S at row k,col-
umn b.Andφ
k
is the kth column vector of mixed matrix
A =[φ
1
, ··· ,φ
k
, ··· ,φ
n
].
If we use symbol ‘↔’ to define the mapping associa-
tion between a basis and the corresponding independent
component, we obtain s
k
↔ φ
k
, k =1, ··· ,n.
Measuring the local smoothness of functions is proved
to be an important task for many applications in mathe-
matical analysis and in signal and image processing. Such
a characterization is vital in multi-fractal analysis, and
is an instrumental tool for image segmentation and de-
noising. H¨older exponent is considered as a powerful pa-
rameter for studying the structure of singular signals
[7]
.
Let α ∈ (0, 1), and x
0
∈ K ⊂ R. A function f : K → R
is in C
α
x
0
(orhasapointwiseH¨older exponent α at x
0
),
if for all in a neighborhood x of x
0
,
|f(x) − f(x
0
)|≤c |x − x
0
|
α
, (3)
where c is a constant independent of x
0
and α.The
H¨older exponent α is computed as
α
f
(x) = lim inf
h→0
log |f (x + h) − f(x)|
log |h|
. (4)
Clearly, a function that is differentiable at x = x
0
has
aH¨older exponent α ≥ 1. Geometrically, this means that
the magnitude of oscillations of the function near x
0
de-
creases faster than the distance to x. In general, if this
1671-7694/2007/090509-04
c
2007 Chinese Optics Letters