# Speckle Noise Reduction via Nonconvex High Total Variation Approach

Authors: Yulian Wu; Xiangchu Feng
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

We address the problem of speckle noise removal. The classical total variation is extensively used in this field to solve such problem, but this method suffers from the staircase-like artifacts and the loss of image details. In order to resolve these problems, a nonconvex total generalized variation (TGV) regularization is used to preserve both edges and details of the images. The TGV regularization which is able to remove the staircase effect has strong theoretical guarantee by means of its high order smooth feature. Our method combines the merits of both the TGV method and the nonconvex variational method and avoids their main drawbacks. Furthermore, we develop an efficient algorithm for solving the nonconvex TGV-based optimization problem. We experimentally demonstrate the excellent performance of the technique, both visually and quantitatively.


---

## Body

## 1. Introduction

Images generated by coherent imaging modalities, for example, synthetic aperture radar (SAR), ultrasound, and laser imaging, inevitably come with multiplicative noise (also known as speckle), due to the coherent nature of the scattering phenomena. The speckle noise seriously interferes with the upper tasks, such as object recognition [1] and image segmentation [2]. Due to the coherent nature of the image acquisition process, in the speckle noise models, the noise field is multiplied by (not added to) the original image, and it is described by a non-Gaussian probability density function, with Rayleigh and Gamma being common models [3]. So it is signal independent, non-Gaussian, and spatially dependent. Hence, speckle denoising is a very challenging problem compared with additive Gaussian noise.Speckle noise removal methods have been discussed in many references. Popular methods include bilateral filtering for despeckling [4], wavelet based despeckling approaches [5], and nonlocal means (NL-means) [6]. We will focus on the variational approach for speckle noise removal.To the best of our knowledge, there exist several variational approaches devoted to speckle noise removal problem, which minimize some appropriate energy functionals, composing a regularization term and a data fitting term. The first total variation-based speckle noise removal method (RLO-method) was presented by Osher et al. [7], which used a constrained optimization approach with two Lagrange multipliers. Aubert and Aujol [8] propose their speckle noise removal method (AA method) in the framework of the maximum a posteriori probability (MAP) estimation. In [9], Huang et al. proposed a new total variation (TV) method for speckle noise removal based on the Aubert-Aujol (AA) method. Because of the nonconvexity of AA method, the global solution is hard to find. To resolve this problem, Bioucas-Dias and Figueiredo [10] apply the MAP estimation method in the log domain and propose a convex speckle noise removal method (BF method). In addition, Steidl and Teuber [11] also propose a convex method (ST method), in which the I-divergence is used as the fidelity term; the reason for this is that the Euler-Lagrange equation of the ST method is equivalent to that of the BF method in the sense of log transform [11].The methods mentioned above have a common feature that is using the convex TV regularization, which yields piecewise smooth estimates adapted to the structure of the underlying reflectance. Indeed, solutions of variational problems with TV regularization admit many desirable properties, most notably the appearance of sharp edges. However, the regularization with TV also has the so-called staircasing artifacts in the smooth image regions. To overcome the drawback, the total generalized variation (TGV) regularization [12] also has been investigated in the recent work [13], which incorporates the TGV penalty into the existing data fidelity term for the speckle noise removal, and develops two novel variational despeckling methods. TGV-based despeckling method outperforms the traditional TV methods by reducing the staircasing artifacts.Recently, the developments of nonconvex world involving a variety of applications show that nonconvex regularizer has advantages over convex regularization for restoring images with neat edges. Nikolova et al. [14] discuss the properties of the nonconvex regularizer for removing additive noise and then [15, 16] study l
1 data fitting and concave regularization for image recovery problem. Han et al. [17] apply nonconvex TV regularizer to the speckle noise removal, which better preserves edges of restored images compared to classical TV regularizer-based methods. Ochs et al. [18] combine nonconvexity with total generalized variation for reducing the additive noise, deconvolution, and some other applications.In this study, we incorporate the nonconvex TGV penalty into the existing data fidelity term for speckle removal and develop a novel variation despeckling method. A nonconvex TGV regularizer is used to make the whole regions of the image efficiently smoothed while it is used to make the edges well preserved. As demonstrated in our numerical experiments, the nonconvex TGV-based despeckling method not only outperforms the TGV methods (TGVSNR algorithm) [13] by better preserving edges of images but also is far better than the nonconvex TV-based method (NRSNR algorithm) [17] by removing the staircasing artifacts.The rest of this paper is organized as follows. In Section2, some related works are reviewed and discussed. In Section 3, we present a brief review of nonconvex TGV. Then, the new variational method for speckle removal is proposed. In Section 4, a fast algorithm corresponding to the new method is designed. Subsequently, Section 5 describes the experiment results. In Section 6, the final conclusions are drawn.


## 2. Related Work and Discussion

Letf
∈
R
+
n denote an n-pixel observed image, assumed to be a sample of a random image F. It is known that F can be assumed to be the product of the underlying true image intensity z
∈
R
+
n and the speckle noise η
∈
R
+
n:
(1)
F
i
=
z
i
η
i
for
i
=
1
:
n
.
The probability density function of η for the L-look SAR image is given by the following Gamma distribution:
(2)
p
η
=
1
Γ
L
L
L
η
L
-
1
e
-
L
η
,
where Γ is the usual Gamma function. Several major TV-based variational methods are presented below.The MAP criterion is applied to (1); Aubert and Aujol [8] derived a new method (AA method):
(3)
z
*
=
arg
min
⁡
z
L
∑
i
=
1
n
log
⁡
z
i
+
f
i
z
i
-
1
+
λ
∑
i
=
1
n
|
∇
z
i
|
,
where z
* denotes the despeckled result and λ
>
0 denotes the regularization parameter.From the minimization problem (3), we can observe that the global solution of the AA method is hard to find because it has a nonconvex fidelity term. To resolve this problem, the authors in [10] take logarithmic transformation to convert (1) into an additive form:
(4)
log
⁡
F
︸
G
=
log
⁡
z
︸
U
+
log
⁡
η
︸
W
.For simplicity, the pixel subscript of (4) has been dropped. The probability density of the random variable W
=
log
⁡
η is
(5)
p
W
w
=
p
η
e
w
e
w
=
L
L
Γ
L
e
L
W
e
-
e
w
L
,
p
G
∣
U
g
∣
u
=
p
W
g
-
u
.Then, according to conditional independence assumption [10], the following equation is derived:
(6)
log
⁡
p
G
∣
U
g
∣
u
=
∑
i
=
1
n
log
⁡
p
W
(
g
i
-
u
i
)
=
C
-
L
∑
i
=
1
n
u
i
+
e
g
i
-
u
i
,
where C is a constant. Using the MAP criterion, the restored image of the BF method can be inferred by solving the following variational problem:
(7)
u
*
=
arg
min
⁡
u
-
log
⁡
p
G
∣
U
(
g
∣
u
)
-
log
⁡
p
U
(
u
)
=
arg
min
⁡
u
L
∑
i
=
1
n
u
i
+
e
g
i
-
u
i
+
λ
∑
i
=
1
n
∇
u
i
,
z
*
=
e
u
*
.However, since the logarithmic transformation is nonlinear, which results in luminance distortion of the image, to avoid this undesirable defect, Steidl and Teuber [11] showed that the classical I-divergence method given in (8) does not require nonlinear transformation and shares the same solution of method (7) theoretically:
(8)
z
*
=
arg
min
⁡
u
∑
i
=
1
n
(
z
i
-
f
i
log
⁡
z
i
)
+
λ
∑
i
=
1
n
∇
i
z
.


## 3. Problem Formulation

In this section, we begin with a brief tour of nonconvex TGV and then propose a new variational method based on it.


### 3.1. Nonconvex Total Generalized Variation

First, recall the definition of the total generalized variation. For convenience, we assume thatΩ
⊂
R
d is a nonempty, open, and connected set; here, d
∈
Z, d
≥
1, is a fixed space dimension. In this paper, we have d
=
2 for the images. The TGV of order m [12] and positive weights α
=
(
α
0
,
…
,
α
m
-
1
) is defined as
(9)
TG
V
α
m
u
=
sup
⁡
∫
Ω
u
div
m
ϑ
d
x
∣
ϑ
∈
C
c
m
Ω
,
Sy
m
m
R
d
,
h
h
h
h
h
i
h
h
∫
u
di
v
l
ϑ
∞
≤
α
l
,
l
=
0
,
…
,
m
-
1
,
where Sy
m
m
R
d denotes the space of symmetric tensors of order m with arguments in R
d. C
c
m
Ω
,
Sy
m
m
R
d denotes the vector space of compactly supported symmetric tensor field. Note that TG
V
α
m
(
u
) is a seminorm that equals 0 for all polynomials of degree less than m. Consequently, the image restoration with TGV regularization brings about piecewise polynomial intensities.Specifically, we use the second-order TGV based on the above definition throughout the paper:(10)
TG
V
α
2
(
u
)
=
sup
⁡
∫
Ω
u
di
v
2
ϑ
d
x
∣
ϑ
∈
C
c
2
Ω
,
Sy
m
2
R
d
,
h
h
h
h
i
h
h
h
∫
u
di
v
l
ϑ
∞
≤
α
l
,
l
=
0,1
.Definition (10) is generalized to represent minimization problem itself via Fenchel duality theory [12]:
(11)
TG
V
α
2
u
=
min
⁡
u
⁡
α
1
∫
Ω
∇
u
-
ϑ
d
x
+
α
0
∫
Ω
Ψ
ϑ
d
x
.Here,Ψ
(
ϑ
)
=
1
/
2
(
∇
ϑ
+
∇
ϑ
T
) denotes the symmetric derivative. Such a definition provides a way of balancing between the first and second derivatives of a function. More details on TGV can be found in [12, 19].Nonconvex variant of TGV, that is, nonconvex TGV, is introduced [18] by Ochs et al. who put forward this theory, which combines with total generalized variation and nonconvex regulation:
(12)
NCTG
V
α
2
u
=
min
⁡
u
,
ϑ
⁡
α
1
∇
u
-
ϑ
+
ε
p
+
α
0
Ψ
ϑ
+
ε
p
,
that is, the regularized p-norm, 0
<
p
<
1. The nonconvex regulation based upon the TGV can retain all the advantages of both the TGV and nonconvex property. In particular, the despeckling with nonconvex TGV regularization both can lead to piecewise polynomial smoothness and can preserve neat edges of the images. Experiment results in Section 5 can illustrate these facts.


### 3.2. New Nonconvex Variational Method

Following the MAP estimation process as BF method [10], we propose a novel variational method based on NCTG
V
α
2
(
u
) for removing speckle noise:
(13)
u
*
=
arg
min
⁡
u
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
NCTG
V
α
2
(
u
)
,
z
*
=
e
u
*
.Let the sum of data term and nonconvex TGV regularization term in formula (13) denote the following:
(14)
T
u
=
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
α
1
∑
i
=
1
n
∇
u
i
-
ϑ
i
+
ε
p
+
α
0
∑
i
=
1
n
Ψ
ϑ
i
+
ε
p
.The regularization term of formula (13) has the advantage of protecting edges of images, but because of the nonconvexity and nonlinearity of the energy function in method (13) classical optimization algorithms cannot be directly used to solve this problem. In the next section, we will design a new fast iteration algorithm.


## 3.1. Nonconvex Total Generalized Variation

First, recall the definition of the total generalized variation. For convenience, we assume thatΩ
⊂
R
d is a nonempty, open, and connected set; here, d
∈
Z, d
≥
1, is a fixed space dimension. In this paper, we have d
=
2 for the images. The TGV of order m [12] and positive weights α
=
(
α
0
,
…
,
α
m
-
1
) is defined as
(9)
TG
V
α
m
u
=
sup
⁡
∫
Ω
u
div
m
ϑ
d
x
∣
ϑ
∈
C
c
m
Ω
,
Sy
m
m
R
d
,
h
h
h
h
h
i
h
h
∫
u
di
v
l
ϑ
∞
≤
α
l
,
l
=
0
,
…
,
m
-
1
,
where Sy
m
m
R
d denotes the space of symmetric tensors of order m with arguments in R
d. C
c
m
Ω
,
Sy
m
m
R
d denotes the vector space of compactly supported symmetric tensor field. Note that TG
V
α
m
(
u
) is a seminorm that equals 0 for all polynomials of degree less than m. Consequently, the image restoration with TGV regularization brings about piecewise polynomial intensities.Specifically, we use the second-order TGV based on the above definition throughout the paper:(10)
TG
V
α
2
(
u
)
=
sup
⁡
∫
Ω
u
di
v
2
ϑ
d
x
∣
ϑ
∈
C
c
2
Ω
,
Sy
m
2
R
d
,
h
h
h
h
i
h
h
h
∫
u
di
v
l
ϑ
∞
≤
α
l
,
l
=
0,1
.Definition (10) is generalized to represent minimization problem itself via Fenchel duality theory [12]:
(11)
TG
V
α
2
u
=
min
⁡
u
⁡
α
1
∫
Ω
∇
u
-
ϑ
d
x
+
α
0
∫
Ω
Ψ
ϑ
d
x
.Here,Ψ
(
ϑ
)
=
1
/
2
(
∇
ϑ
+
∇
ϑ
T
) denotes the symmetric derivative. Such a definition provides a way of balancing between the first and second derivatives of a function. More details on TGV can be found in [12, 19].Nonconvex variant of TGV, that is, nonconvex TGV, is introduced [18] by Ochs et al. who put forward this theory, which combines with total generalized variation and nonconvex regulation:
(12)
NCTG
V
α
2
u
=
min
⁡
u
,
ϑ
⁡
α
1
∇
u
-
ϑ
+
ε
p
+
α
0
Ψ
ϑ
+
ε
p
,
that is, the regularized p-norm, 0
<
p
<
1. The nonconvex regulation based upon the TGV can retain all the advantages of both the TGV and nonconvex property. In particular, the despeckling with nonconvex TGV regularization both can lead to piecewise polynomial smoothness and can preserve neat edges of the images. Experiment results in Section 5 can illustrate these facts.


## 3.2. New Nonconvex Variational Method

Following the MAP estimation process as BF method [10], we propose a novel variational method based on NCTG
V
α
2
(
u
) for removing speckle noise:
(13)
u
*
=
arg
min
⁡
u
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
NCTG
V
α
2
(
u
)
,
z
*
=
e
u
*
.Let the sum of data term and nonconvex TGV regularization term in formula (13) denote the following:
(14)
T
u
=
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
α
1
∑
i
=
1
n
∇
u
i
-
ϑ
i
+
ε
p
+
α
0
∑
i
=
1
n
Ψ
ϑ
i
+
ε
p
.The regularization term of formula (13) has the advantage of protecting edges of images, but because of the nonconvexity and nonlinearity of the energy function in method (13) classical optimization algorithms cannot be directly used to solve this problem. In the next section, we will design a new fast iteration algorithm.


## 4. Explicit Numerical Scheme

In the following, to compute the minimizer of (13), we first convert the unconstrained problem (13) into an equivalent constrained one in order to resolve the equivalent problem into two subproblems by the fast augmented Lagrange multiplier (ALM) method. For the first subproblem, as its convexity, the Newton method can be used to solve it. As the second subproblem is nonconvex, we use the iteratively reweighted method for resolving the nonconvex subproblem.


### 4.1. The ALM Method

Through the introduction of an auxiliary variablev
∈
R
n, we transform formula (13) to a constrained form:
(15)
min
⁡
u
,
v
,
ϑ
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
α
1
∑
i
=
1
n
∇
v
i
-
ϑ
i
+
ε
p
h
h
h
h
h
h
+
α
0
∑
i
=
1
n
Ψ
ϑ
i
+
ε
p
s
.
t
.
u
=
v
.In the following, to compute the minimizers of formula (15), we adopt the ALM algorithm because of its fast convergence applicability for many problems; the “allowance” variable r
∈
R
n is merged it into the above objective function, which leads to solving the following minimization problem:
(16)
(
u
^
,
v
^
,
ϑ
)
=
arg
min
⁡
u
,
v
,
ϑ
L
∑
i
=
1
n
u
i
+
e
g
i
-
u
i
+
α
1
∑
i
=
1
n
∇
v
i
-
ϑ
i
+
ε
p
h
h
h
h
h
h
h
h
h
h
h
h
+
α
0
∑
i
=
1
n
Ψ
ϑ
i
+
ε
p
h
h
h
h
h
h
h
h
h
h
h
h
+
λ
2
∑
i
=
1
n
u
i
-
v
i
+
r
i
2
,
r
i
k
=
r
i
k
-
1
+
u
i
k
-
v
i
k
.The parameterλ of formulation (16) does not need to be set large enough; it demonstrates that the ALM method is more robust to the choice of parameters. With regard to our nonconvex case, although there is no strict proof to guarantee the convergence of our iteration process, numerical experiments in Section 5 will demonstrate that our method can produce better denoising results than nonconvex TV regularizer-based method and TGV regularizer-based method.To solve the minimization problem (16), we use the alternating iteration algorithm. Firstly, we fix v and ϑ to solve u, and then we fix u to solve v and ϑ. More precisely, the alternating iteration algorithm is equivalent to iteratively solving the following two subproblems:
(17)
u
^
=
arg
min
⁡
u
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
,
(18)
v
^
,
ϑ
^
=
argmin
v
,
ϑ
α
1
∑
i
=
1
n
∇
v
i
-
ϑ
i
+
ε
p
hhhhhhhhhh
+
α
0
∑
i
=
1
n
Ψ
(
ϑ
i
)
+
ε
p
hhhhhhhhhh
+
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
.Let the first-order derivative of formula (17) be equal to zero, leading to the following equation:
(19)
L
(
1
-
e
g
i
-
u
i
)
+
λ
(
u
i
-
v
i
k
-
1
+
r
i
k
-
1
)
=
0
.The minimization problem can be solved by using the Newton iteration of (19). For solving the nonconvex minimization problem (18), we propose the iteratively reweighted method.


### 4.2. The Iteratively Reweighted Method

Originally, the iteratively reweighted algorithm proceeds by iteratively solvingl
1 problems which approximate the original problem [17, 20, 21], which was proposed to improve the sparsity in l
1 regularized compressed sensing problems, but it turns out that this algorithm is also useful for computer vision applications.For solving the optimization problem (18), we transform it into the following equivalent energy minimization problem:
(20)
v
^
,
ϑ
^
=
argmin
v
,
ϑ
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
h
h
h
h
h
h
h
h
h
h
+
∑
i
=
1
n
α
1
w
i
k
-
1
∇
v
i
-
ϑ
i
h
h
h
h
h
h
h
h
h
h
+
∑
i
=
1
n
α
0
w
~
i
k
-
1
Ψ
ϑ
i
,
w
i
k
=
p
∇
v
i
k
+
ε
1
-
p
,
w
~
i
k
=
p
Ψ
ϑ
i
k
+
ε
1
-
p
.As the inner problem (20) is a convex minimization problem, it can be solved efficiently by the primal-dual algorithms [22, 23]. In particular, primal-dual form of problem (20) is derived by the duality principles:
(21)
min
⁡
v
,
ϑ
max
⁡
p
∈
P
,
q
∈
Q
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
+
∑
i
=
1
n
∇
v
i
-
ϑ
i
,
p
i
+
∑
i
=
1
n
Ψ
ϑ
i
,
q
i
,
where
(22)
P
=
{
p
i
=
p
i
1
,
p
i
2
∣
p
i
∞
≤
α
1
w
i
}
,
Q
=
q
i
=
q
i
11
,
q
i
12
q
i
21
,
q
i
22
∣
q
i
∞
≤
α
0
w
~
i
.The primal-dual algorithm for problem (21) reads as follows.Algorithm 1.
The primal-dual algorithm for nonconvex TGV denoising is as follows.(1)
Initialization(23)
g
=
u
+
r
0
,
v
0
=
f
,
v
-
0
=
v
0
,
ϑ
0
,
ϑ
-
0
=
0
,
p
0
=
0
,
q
0
=
0
,
σ
,
λ
,
τ
,
α
1
,
α
0
,
M
>
0
,
l
=
0
.
Whilel
<
M do
(2)
p
l
+
1
=
Pro
j
P
(
p
l
+
σ
(
∇
v
-
l
-
ϑ
¯
l
)
)
(3)
q
l
+
1
=
Pro
j
Q
(
q
l
+
σ
(
Ψ
(
ϑ
¯
l
)
)
(4)
v
0
=
v
,
v
=
v
+
τ
div
p
+
λ
g
/
1
+
τ
λ
v
-
=
2
v
-
v
0
(5)
ϑ
0
=
ϑ
,
ϑ
=
ϑ
+
τ
(
p
+
di
v
2
q
)
ϑ
¯
=
2
ϑ
-
ϑ
0
end while.
Set the following:(24)
Pro
j
P
(
p
i
l
)
=
p
i
l
max
⁡
(
1
,
p
i
l
/
α
1
w
i
)
,
Pro
j
Q
(
q
i
l
)
=
q
i
l
max
⁡
(
1
,
q
i
l
/
α
0
w
^
i
)
,
and di
v
2 is negative conjugate of Ψ, di
v
2
=
-
Ψ
*.
For the (outer) nonconvex problem, let(
u
k
,
l
) be the sequence generated by the problem (20), where the index l refers to the inner iterations for solving the convex problem and k to the outer iterations. According to Proposition 1 [18], (
F
(
u
k
,
0
)
) will be monotonically decreasing and provides a natural stopping criterion for the inner and outer problem.
The inner iterations are stopped whenl
>
M, where M is the maximal number of inner iterations; we set M
=
400
,
else
,
700. Then, we stop the outer iterations as soon as
(25)
T
(
u
k
,
0
)
-
T
(
u
k
+
1,0
)
T
(
u
0,0
)
<
μ
,
where μ is a threshold indicating the required accuracy. In our experiments, we use μ
=
1
0
-
6.
Integrating the ALM process and the iteratively reweighted iteration, the whole speckle noise removal algorithm can be found in Algorithm2.Algorithm 2.
The nonconvex TGV regularizer-based speckle noise removal algorithm is as follows.(1)
Initialization is as follows: give parametersσ
,
τ
,
λ
,
α
1
,
α
0
>
0
,
k
=
0;
initializer
i
0
=
0
,
u
i
0
=
v
i
0
=
log
⁡
f, p
0
=
0
,
q
0
=
0.
(2)
Repeat.
(3)
Apply Newton method to solve foru
i
k by formula (19).
(4)
Apply primal-dual method to solve forv
i
k
,
ϑ
i
k by Algorithm 1.
(5)
k
=
k
+
1.
(6)
Until a stopping criterion is satisfied,
final restored imagez
^
=
exp
⁡
(
u
^
).


## 4.1. The ALM Method

Through the introduction of an auxiliary variablev
∈
R
n, we transform formula (13) to a constrained form:
(15)
min
⁡
u
,
v
,
ϑ
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
α
1
∑
i
=
1
n
∇
v
i
-
ϑ
i
+
ε
p
h
h
h
h
h
h
+
α
0
∑
i
=
1
n
Ψ
ϑ
i
+
ε
p
s
.
t
.
u
=
v
.In the following, to compute the minimizers of formula (15), we adopt the ALM algorithm because of its fast convergence applicability for many problems; the “allowance” variable r
∈
R
n is merged it into the above objective function, which leads to solving the following minimization problem:
(16)
(
u
^
,
v
^
,
ϑ
)
=
arg
min
⁡
u
,
v
,
ϑ
L
∑
i
=
1
n
u
i
+
e
g
i
-
u
i
+
α
1
∑
i
=
1
n
∇
v
i
-
ϑ
i
+
ε
p
h
h
h
h
h
h
h
h
h
h
h
h
+
α
0
∑
i
=
1
n
Ψ
ϑ
i
+
ε
p
h
h
h
h
h
h
h
h
h
h
h
h
+
λ
2
∑
i
=
1
n
u
i
-
v
i
+
r
i
2
,
r
i
k
=
r
i
k
-
1
+
u
i
k
-
v
i
k
.The parameterλ of formulation (16) does not need to be set large enough; it demonstrates that the ALM method is more robust to the choice of parameters. With regard to our nonconvex case, although there is no strict proof to guarantee the convergence of our iteration process, numerical experiments in Section 5 will demonstrate that our method can produce better denoising results than nonconvex TV regularizer-based method and TGV regularizer-based method.To solve the minimization problem (16), we use the alternating iteration algorithm. Firstly, we fix v and ϑ to solve u, and then we fix u to solve v and ϑ. More precisely, the alternating iteration algorithm is equivalent to iteratively solving the following two subproblems:
(17)
u
^
=
arg
min
⁡
u
L
∑
i
=
1
n
(
u
i
+
e
g
i
-
u
i
)
+
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
,
(18)
v
^
,
ϑ
^
=
argmin
v
,
ϑ
α
1
∑
i
=
1
n
∇
v
i
-
ϑ
i
+
ε
p
hhhhhhhhhh
+
α
0
∑
i
=
1
n
Ψ
(
ϑ
i
)
+
ε
p
hhhhhhhhhh
+
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
.Let the first-order derivative of formula (17) be equal to zero, leading to the following equation:
(19)
L
(
1
-
e
g
i
-
u
i
)
+
λ
(
u
i
-
v
i
k
-
1
+
r
i
k
-
1
)
=
0
.The minimization problem can be solved by using the Newton iteration of (19). For solving the nonconvex minimization problem (18), we propose the iteratively reweighted method.


## 4.2. The Iteratively Reweighted Method

Originally, the iteratively reweighted algorithm proceeds by iteratively solvingl
1 problems which approximate the original problem [17, 20, 21], which was proposed to improve the sparsity in l
1 regularized compressed sensing problems, but it turns out that this algorithm is also useful for computer vision applications.For solving the optimization problem (18), we transform it into the following equivalent energy minimization problem:
(20)
v
^
,
ϑ
^
=
argmin
v
,
ϑ
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
h
h
h
h
h
h
h
h
h
h
+
∑
i
=
1
n
α
1
w
i
k
-
1
∇
v
i
-
ϑ
i
h
h
h
h
h
h
h
h
h
h
+
∑
i
=
1
n
α
0
w
~
i
k
-
1
Ψ
ϑ
i
,
w
i
k
=
p
∇
v
i
k
+
ε
1
-
p
,
w
~
i
k
=
p
Ψ
ϑ
i
k
+
ε
1
-
p
.As the inner problem (20) is a convex minimization problem, it can be solved efficiently by the primal-dual algorithms [22, 23]. In particular, primal-dual form of problem (20) is derived by the duality principles:
(21)
min
⁡
v
,
ϑ
max
⁡
p
∈
P
,
q
∈
Q
λ
2
∑
i
=
1
n
u
i
-
v
i
k
-
1
+
r
i
k
-
1
2
+
∑
i
=
1
n
∇
v
i
-
ϑ
i
,
p
i
+
∑
i
=
1
n
Ψ
ϑ
i
,
q
i
,
where
(22)
P
=
{
p
i
=
p
i
1
,
p
i
2
∣
p
i
∞
≤
α
1
w
i
}
,
Q
=
q
i
=
q
i
11
,
q
i
12
q
i
21
,
q
i
22
∣
q
i
∞
≤
α
0
w
~
i
.The primal-dual algorithm for problem (21) reads as follows.Algorithm 1.
The primal-dual algorithm for nonconvex TGV denoising is as follows.(1)
Initialization(23)
g
=
u
+
r
0
,
v
0
=
f
,
v
-
0
=
v
0
,
ϑ
0
,
ϑ
-
0
=
0
,
p
0
=
0
,
q
0
=
0
,
σ
,
λ
,
τ
,
α
1
,
α
0
,
M
>
0
,
l
=
0
.
Whilel
<
M do
(2)
p
l
+
1
=
Pro
j
P
(
p
l
+
σ
(
∇
v
-
l
-
ϑ
¯
l
)
)
(3)
q
l
+
1
=
Pro
j
Q
(
q
l
+
σ
(
Ψ
(
ϑ
¯
l
)
)
(4)
v
0
=
v
,
v
=
v
+
τ
div
p
+
λ
g
/
1
+
τ
λ
v
-
=
2
v
-
v
0
(5)
ϑ
0
=
ϑ
,
ϑ
=
ϑ
+
τ
(
p
+
di
v
2
q
)
ϑ
¯
=
2
ϑ
-
ϑ
0
end while.
Set the following:(24)
Pro
j
P
(
p
i
l
)
=
p
i
l
max
⁡
(
1
,
p
i
l
/
α
1
w
i
)
,
Pro
j
Q
(
q
i
l
)
=
q
i
l
max
⁡
(
1
,
q
i
l
/
α
0
w
^
i
)
,
and di
v
2 is negative conjugate of Ψ, di
v
2
=
-
Ψ
*.
For the (outer) nonconvex problem, let(
u
k
,
l
) be the sequence generated by the problem (20), where the index l refers to the inner iterations for solving the convex problem and k to the outer iterations. According to Proposition 1 [18], (
F
(
u
k
,
0
)
) will be monotonically decreasing and provides a natural stopping criterion for the inner and outer problem.
The inner iterations are stopped whenl
>
M, where M is the maximal number of inner iterations; we set M
=
400
,
else
,
700. Then, we stop the outer iterations as soon as
(25)
T
(
u
k
,
0
)
-
T
(
u
k
+
1,0
)
T
(
u
0,0
)
<
μ
,
where μ is a threshold indicating the required accuracy. In our experiments, we use μ
=
1
0
-
6.
Integrating the ALM process and the iteratively reweighted iteration, the whole speckle noise removal algorithm can be found in Algorithm2.Algorithm 2.
The nonconvex TGV regularizer-based speckle noise removal algorithm is as follows.(1)
Initialization is as follows: give parametersσ
,
τ
,
λ
,
α
1
,
α
0
>
0
,
k
=
0;
initializer
i
0
=
0
,
u
i
0
=
v
i
0
=
log
⁡
f, p
0
=
0
,
q
0
=
0.
(2)
Repeat.
(3)
Apply Newton method to solve foru
i
k by formula (19).
(4)
Apply primal-dual method to solve forv
i
k
,
ϑ
i
k by Algorithm 1.
(5)
k
=
k
+
1.
(6)
Until a stopping criterion is satisfied,
final restored imagez
^
=
exp
⁡
(
u
^
).


## 5. Numerical Results

In this section, we report numerical experiments on speckle reduction to validate the efficiency of the proposed method with 10 test images whose sizes are all 256*256 shown in Figure1, including six “standard” test images and four some synthetic images used in [13, 17, 24]. Finally, we test three real SAR images used in [13]. During the evaluation, we compare the proposed algorithm with two recent speckle noise removal algorithms which include NRSNR algorithms [17] and TGVSNR algorithms [13].Ten different test images. (a) House. (b) Peppers. (c) Lena. (d) Livingroom. (e) Rem1. (f) Boat. (g) Cameraman. (h) Fields. (i) Nimes. (j) Phantom.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)The evaluating indicator is SNR which is measured between noise-free and restored noisy images. Ifz
^ and z are the estimated and noise-free images and σ
-
z
2 is the average variance of the noise-free image z, the SNR is defined as
(26)
SNR
=
10
lo
g
10
σ
-
z
2
MSE
,
where MSE is the mean-square error which is given by MSE
=
1
/
n
∑
i
=
1
n
(
z
i
-
z
^
i
)
2.All simulations listed here are implemented in Matlab R2009a on a laptop equipped with 1.60 GHz CPU and 4 G RAM memory.


### 5.1. Choice of the Regularization Parameters

Some required parametersσ
,
τ
,
λ
,
α
1, and α
0 need to be given to begin with our nonconvex TGV regularization algorithm. The parameter λ is used to approximate to the constraint u
=
v in mode (15). In all our experiments, we find the best λ of each image from a search interval [5, 9]. It is worth noting that the impact of parameter λ is not great; the choices of λ
=
5 are proper for most cases. The parameters σ and τ are used to make the primal-dual algorithm’s converging. The two parameters are set too small; the algorithm will be too slow; if the two parameters are set too large, the algorithm will not be robust. We find that σ
=
τ
=
0.3 will yield good results empirically. The parameters α
1
,
α
0 in the primal-dual algorithm have a strong impact on the denoising results. The adjustment of these parameters not only is concerned with noise but also depends on images. We have to turn them manually. We search for the best α
1 of each image from a 0.5-step interval [
1.2,6
], and the best α
0 of each image from a 0.3-step interval [
0.6,3
]. As two parameters α
1
,
α
0 act on the regularization term, we can fix one of them to tune the other one. Generally, the values of these two regularization parameters are set smaller with the decreasing of the number of looks L.


### 5.2. Influence of the Parametersp

Parametersp of nonconvex TGV regularization term have an important influence on the performance of the proposed algorithm. Experimental results caused by the different parameters p are not the same. We test many images and obtain similar experimental result as in Figure 2. The curves in Figure 2 are based on “House” image. Final SNR of restoration images firstly increases and then decreases with the increasing of p value shown in Figure 2, so p value for all the experiments is set to 0.7.Figure 2
Change curve of parametersp on SNR.


### 5.3. Results with Known Image

In this section, we measure the despeckling capability on experimental speckled images whose reference originals are known. Table1 presents the comparison with only two recent speckle noise removal methods, because these two recent algorithms which include NRSNR algorithms [17] and TGVSNR algorithms [13] are superior to many results before obtained including the algorithms of the AA method and the BF method. The best SNR of different algorithms are listed in Table 1. From the data in the table, we can find that for almost all the denoising results the proposed algorithm achieves higher values of SNR (averagely exceeding about 0.49 db over the TGVSNR method and 0.53 db over the NRSNR method). Even for the “worst” result, our algorithm yields comparable SNR compared with the best values obtained from the latter two methods. Consequently, we believe that the proposed method can averagely perform better than the other two methods. In Figures 3 and 4, we display four representative denoising results to manifest denoising effect and the edge-preserving capability of the proposed method. From observation, we can find that the images restored from the proposed method (shown in Figure 3(b)) are better than those restored from the TGVSNR method (shown in Figure 3(c)) and the NRSNR method (shown in Figure 3(d)). As a matter of fact, in Figure 3(d), we observe that severe staircasing artifacts occur in the restored images of the NRSNR method. In some ways, the TGVSNR method generates better denoising results than the NRSNR method; particularly, staircasing artifacts are weakened greatly. However, some slight residual noise is visible in the restored images of the TGVSNR method. Compared with the NRSNR method and the TGVSNR method, the proposed method generates better denoising results; not only is the speckle noise well cleaned but also the details of the images are well preserved. The above arguments can be also verified from the amplification of the despeckled images shown in Figure 4. From the local zoomed results, we can take a closer look at the advantage of our method more directly. The proposed method can remove the staircasing artifacts better which exist in the areas of the NRSNR method compared to TGVSNR method; meanwhile, it maintains better denoising capability and neat edges.Table 1
Quantitative denoising comparison among the proposed method (P
=
0.7), the TGVSNR method, and the NRSNR method. The best values of SNR (db) of each row are displayed in bold.
Image
L
Noise index
Proposed method
TGVSNR
NRSNR
SNR
SNR
SNR
SNR
House
3
-
3.46
12.15
11.18
10.80
9
1.26
14.65
13.92
13.74
15
3.49
15.81
15.25
15.17
21
4.96
16.79
16.15
16.04
Livingroom
3
-
5.10
7.63
7.28
6.65
9
-
0.33
9.72
9.43
9.05
15
3.37
10.75
10.53
10.30
21
1.89
11.46
11.29
11.06
Lena
3
-
2.72
10.65
10.13
9.72
9
2.06
13.35
12.73
12.48
15
4.26
14.46
14.01
13.82
21
5.72
15.44
14.89
14.69
Cameraman
3
-
1.49
11.27
11.05
11.16
9
3.25
13.87
13.39
13.71
15
5.47
15.02
14.60
14.91
21
6.95
15.86
15.40
15.75
Boat
3
-
4.16
8.44
8.12
7.80
9
0.59
10.38
10.11
10.25
15
2.81
11.60
11.47
11.56
21
4.28
12.40
12.24
12.40
Nimes
3
-
3.36
4.37
3.96
4.02
9
1.40
6.80
6.26
6.26
15
3.64
8.03
7.56
7.53
21
5.09
9.00
8.45
8.42
Phantom
3
3.62
12.38
10.72
12.08
9
8.32
16.67
14.51
16.09
15
10.53
18.76
16.63
18.28
21
11.96
20.41
17.92
19.61
Fields
3
-
2.56
10.38
10.08
9.50
9
2.22
12.07
11.90
11.56
15
4.42
13.06
12.89
12.68
21
5.87
13.85
13.56
13.41
Peppers
3
-
2.88
11.46
10.90
10.07
9
10.07
13.96
13.57
13.01
15
4.09
15.05
14.86
14.40
21
5.56
16.03
15.69
15.21
Rem1
3
-
2.61
8.18
7.97
7.91
9
2.15
10.47
10.22
10.37
15
4.38
11.70
11.47
11.65
21
5.82
12.53
12.30
12.47Denoising results of different methods. (a) shows the noisy images. From left to right, the noise is indicated byL
=
3,9
,
15,21, respectively; from (b) to (d), the results are obtained by the proposed method, the TGVSNR method, and the NRSNR method, respectively. Note that all of the denoising results are generated when they reach the highest SNR of their corresponding denoising methods.
(a)
(b)
(c)
(d)Local zoomed denoising results. From (a) to (d), the number of looks the denoising results refer to is indicated byL
=
3,9
,
15,21, respectively. In (a), (b), (c), and (d), from left to right, we list the clean image, the denoising result of the proposed method, the denoising result of the TGVSNR method, and the denoising of the NRSNR method.
(a)
(b)
(c)
(d)


### 5.4. Results on Real SAR Images

In this subsection, we test three real SAR images to observe the performance of the proposed method. As the clean image is unknown, the corresponding algorithms will be terminated when the algorithm reaches the stopping criterion. All of the three methods remove the speckle in homogeneous regions and preserve edges well. By observation, the nonconvex TV-based NRSNR method result as the last column in Figure5 introduces visible staircasing artifacts; we can find that the details of the images restored by our method are clearer than those of the TGVSNR method and the NRSNR method. It further demonstrates that the proposed nonconvex TGV regularizer-based method can better preserve details of images compared to the other two methods.Performance comparison of different algorithms on the real images. In (a), (b), and (c), from left to right, we list the speckled image, the denoising result of the proposed method, the denoising result of the TGVSNR method, and the denoising of the NRSNR method. In (d), we show the local zoomed results, each of which corresponds to the results shown in (c).
(a)
(b)
(c)
(d)


## 5.1. Choice of the Regularization Parameters

Some required parametersσ
,
τ
,
λ
,
α
1, and α
0 need to be given to begin with our nonconvex TGV regularization algorithm. The parameter λ is used to approximate to the constraint u
=
v in mode (15). In all our experiments, we find the best λ of each image from a search interval [5, 9]. It is worth noting that the impact of parameter λ is not great; the choices of λ
=
5 are proper for most cases. The parameters σ and τ are used to make the primal-dual algorithm’s converging. The two parameters are set too small; the algorithm will be too slow; if the two parameters are set too large, the algorithm will not be robust. We find that σ
=
τ
=
0.3 will yield good results empirically. The parameters α
1
,
α
0 in the primal-dual algorithm have a strong impact on the denoising results. The adjustment of these parameters not only is concerned with noise but also depends on images. We have to turn them manually. We search for the best α
1 of each image from a 0.5-step interval [
1.2,6
], and the best α
0 of each image from a 0.3-step interval [
0.6,3
]. As two parameters α
1
,
α
0 act on the regularization term, we can fix one of them to tune the other one. Generally, the values of these two regularization parameters are set smaller with the decreasing of the number of looks L.


## 5.2. Influence of the Parametersp

Parametersp of nonconvex TGV regularization term have an important influence on the performance of the proposed algorithm. Experimental results caused by the different parameters p are not the same. We test many images and obtain similar experimental result as in Figure 2. The curves in Figure 2 are based on “House” image. Final SNR of restoration images firstly increases and then decreases with the increasing of p value shown in Figure 2, so p value for all the experiments is set to 0.7.Figure 2
Change curve of parametersp on SNR.


## 5.3. Results with Known Image

In this section, we measure the despeckling capability on experimental speckled images whose reference originals are known. Table1 presents the comparison with only two recent speckle noise removal methods, because these two recent algorithms which include NRSNR algorithms [17] and TGVSNR algorithms [13] are superior to many results before obtained including the algorithms of the AA method and the BF method. The best SNR of different algorithms are listed in Table 1. From the data in the table, we can find that for almost all the denoising results the proposed algorithm achieves higher values of SNR (averagely exceeding about 0.49 db over the TGVSNR method and 0.53 db over the NRSNR method). Even for the “worst” result, our algorithm yields comparable SNR compared with the best values obtained from the latter two methods. Consequently, we believe that the proposed method can averagely perform better than the other two methods. In Figures 3 and 4, we display four representative denoising results to manifest denoising effect and the edge-preserving capability of the proposed method. From observation, we can find that the images restored from the proposed method (shown in Figure 3(b)) are better than those restored from the TGVSNR method (shown in Figure 3(c)) and the NRSNR method (shown in Figure 3(d)). As a matter of fact, in Figure 3(d), we observe that severe staircasing artifacts occur in the restored images of the NRSNR method. In some ways, the TGVSNR method generates better denoising results than the NRSNR method; particularly, staircasing artifacts are weakened greatly. However, some slight residual noise is visible in the restored images of the TGVSNR method. Compared with the NRSNR method and the TGVSNR method, the proposed method generates better denoising results; not only is the speckle noise well cleaned but also the details of the images are well preserved. The above arguments can be also verified from the amplification of the despeckled images shown in Figure 4. From the local zoomed results, we can take a closer look at the advantage of our method more directly. The proposed method can remove the staircasing artifacts better which exist in the areas of the NRSNR method compared to TGVSNR method; meanwhile, it maintains better denoising capability and neat edges.Table 1
Quantitative denoising comparison among the proposed method (P
=
0.7), the TGVSNR method, and the NRSNR method. The best values of SNR (db) of each row are displayed in bold.
Image
L
Noise index
Proposed method
TGVSNR
NRSNR
SNR
SNR
SNR
SNR
House
3
-
3.46
12.15
11.18
10.80
9
1.26
14.65
13.92
13.74
15
3.49
15.81
15.25
15.17
21
4.96
16.79
16.15
16.04
Livingroom
3
-
5.10
7.63
7.28
6.65
9
-
0.33
9.72
9.43
9.05
15
3.37
10.75
10.53
10.30
21
1.89
11.46
11.29
11.06
Lena
3
-
2.72
10.65
10.13
9.72
9
2.06
13.35
12.73
12.48
15
4.26
14.46
14.01
13.82
21
5.72
15.44
14.89
14.69
Cameraman
3
-
1.49
11.27
11.05
11.16
9
3.25
13.87
13.39
13.71
15
5.47
15.02
14.60
14.91
21
6.95
15.86
15.40
15.75
Boat
3
-
4.16
8.44
8.12
7.80
9
0.59
10.38
10.11
10.25
15
2.81
11.60
11.47
11.56
21
4.28
12.40
12.24
12.40
Nimes
3
-
3.36
4.37
3.96
4.02
9
1.40
6.80
6.26
6.26
15
3.64
8.03
7.56
7.53
21
5.09
9.00
8.45
8.42
Phantom
3
3.62
12.38
10.72
12.08
9
8.32
16.67
14.51
16.09
15
10.53
18.76
16.63
18.28
21
11.96
20.41
17.92
19.61
Fields
3
-
2.56
10.38
10.08
9.50
9
2.22
12.07
11.90
11.56
15
4.42
13.06
12.89
12.68
21
5.87
13.85
13.56
13.41
Peppers
3
-
2.88
11.46
10.90
10.07
9
10.07
13.96
13.57
13.01
15
4.09
15.05
14.86
14.40
21
5.56
16.03
15.69
15.21
Rem1
3
-
2.61
8.18
7.97
7.91
9
2.15
10.47
10.22
10.37
15
4.38
11.70
11.47
11.65
21
5.82
12.53
12.30
12.47Denoising results of different methods. (a) shows the noisy images. From left to right, the noise is indicated byL
=
3,9
,
15,21, respectively; from (b) to (d), the results are obtained by the proposed method, the TGVSNR method, and the NRSNR method, respectively. Note that all of the denoising results are generated when they reach the highest SNR of their corresponding denoising methods.
(a)
(b)
(c)
(d)Local zoomed denoising results. From (a) to (d), the number of looks the denoising results refer to is indicated byL
=
3,9
,
15,21, respectively. In (a), (b), (c), and (d), from left to right, we list the clean image, the denoising result of the proposed method, the denoising result of the TGVSNR method, and the denoising of the NRSNR method.
(a)
(b)
(c)
(d)


## 5.4. Results on Real SAR Images

In this subsection, we test three real SAR images to observe the performance of the proposed method. As the clean image is unknown, the corresponding algorithms will be terminated when the algorithm reaches the stopping criterion. All of the three methods remove the speckle in homogeneous regions and preserve edges well. By observation, the nonconvex TV-based NRSNR method result as the last column in Figure5 introduces visible staircasing artifacts; we can find that the details of the images restored by our method are clearer than those of the TGVSNR method and the NRSNR method. It further demonstrates that the proposed nonconvex TGV regularizer-based method can better preserve details of images compared to the other two methods.Performance comparison of different algorithms on the real images. In (a), (b), and (c), from left to right, we list the speckled image, the denoising result of the proposed method, the denoising result of the TGVSNR method, and the denoising of the NRSNR method. In (d), we show the local zoomed results, each of which corresponds to the results shown in (c).
(a)
(b)
(c)
(d)


## 6. Conclusions

In this paper, we propose a novel despeckling variation method based on nonconvex TGV regularization, and an efficient solving algorithm originated from the ALM iteration and the iteratively reweighted primal-dual method is used in our method. Numerical experiments demonstrate that the proposed denoising method based on the nonconvex TGV regularizer shows better performance than nonconvex TV regularizer-based method and TGV regularizer-based method in the ways of preserving the details and edges of images.In addition, our proposed algorithm is not perfect; one drawback is that its running time is longer than the other compared algorithms, so more rapid algorithm is necessary to be hope for in the future.



---

*Source: 627417-2015-02-18.xml*