# A Regulark-Shrinkage Thresholding Operator for the Removal of Mixed Gaussian-Impulse Noise

Authors: Han Pan; Zhongliang Jing; Lingfeng Qiao; Minzhe Li
Journal: Applied Computational Intelligence and Soft Computing
 (2017)

---

## Abstract

The removal of mixed Gaussian-impulse noise plays an important role in many areas, such as remote sensing. However, traditional methods may be unaware of promoting the degree of the sparsity adaptively after decomposing into low rank component and sparse component. In this paper, a new problem formulation with regular spectralk-support norm and regular k-support l1 norm is proposed. A unified framework is developed to capture the intrinsic sparsity structure of all two components. To address the resulting problem, an efficient minimization scheme within the framework of accelerated proximal gradient is proposed. This scheme is achieved by alternating regular k-shrinkage thresholding operator. Experimental comparison with the other state-of-the-art methods demonstrates the efficacy of the proposed method.


---

## Body

## 1. Introduction

Image restoration [1–4] attempts to recover a clear image from the observations of real scenes. As a fundamental procedure, it has been applied to various application areas, such as image fusion [5] and action recognition [6]. However, typically, the noise characteristics of imaging camera is completely or partially unknown. Among these, the removal of mixed noise has not been investigated because the noise model is not easy to establish accurately.Recently, a patch based method [7] for video restoration has attracted much attention [8–10]. This method also is extended to video in-painting for archived films. However, the mechanisms of modeling the sparsity level of the grouping patches remain unclear.To deal with the lack of adaptivity in sparsity level [7], a robust video restoration algorithm is proposed. The main idea of the proposed method is to model the sparsity levels of the low rank component by regular spectral k-support norm and sparse component by regular k-support l1 norm. Specially, a new problem formulation is presented, where the objective function is minimized under an upper bound constraint on the regularization term. However, it is not easy to solve the resulting problem. Some recent progress [11] in the theory of optimization on iterative shrinkage thresholding method is considered. And, an efficient alternating minimization scheme is proposed to solve the new objective.


### 1.1. Related Works

Recently, the problem of denoising image corrupted by mixed Gaussian-impulse noise has been studied in many different contexts [8–10, 12, 13]. These methods fall into three categories: variational methods [9, 12], sparse representation [8, 10], and patch based method [7].Variational methods are a new class of the solutions to promote edge-preservation, such as total variation [14]. These methods first utilized some spatial filters to detect and remove the corrupted pixels, for example, adaptive center-weighted median filter [15] (ACWMF) or rank order absolute differences [16] (ROAD) detector. In [12], Cai et al. employed Mumford-Shah regularization term to encourage sparsity in gradient domain. In [9], Rodríguez et al. presented a novel optimization method for the generalized total variation regularization method. It can be seen that the denoised performance of these methods relies on the detection for the damaged candidates. The adaptivity of sparsity level of the regularization terms has not been investigated carefully.Sparse representation based methods have been extended to this problem. In the main idea of this scheme, it is assumed that the signal can be described by linear combination of a spare number of elements or atoms of an overcomplete dictionary. In [8], an efficient image reconstruction method by posing l1 norm on the error, and l0 norm on image patches in learned dictionary, was proposed. In [10], Filipovic and Jukic reformulated a new problem formulation by enforcing l0-l1 sparsity constraints. The resulting problem is solved by a mixed soft-hard thresholding method. However, it should be noted that these methods are time-consuming.Patch based method is proven to be a state-of-the-art denoising scheme. In [7], Ji et al. approximated the patch stack by reformulating the problem as a low rank matrix completion problem. Despite its efficacy, one of the limitations of patch based method in [7] is that the degree of sparsity has not been considered carefully. When the underlying sparsity level is unknown, we may obtain a bias estimate, considerably. To alleviate these issues in a unified formulation, a new problem formulation is proposed.


### 1.2. Contributions

The main idea of this paper is to deal with the weakness of the approach in [7]. Existing methods, such as l1 norm and trace norm, can not promote the sparsity level of all two components adaptively. The details or local fine content can not be represented and described well. To deal with these issues, a new problem formulation incorporating correlated and adaptive sparsity is proposed.Our contributions can be summarized as follows.(1)
A new problem formulation to model the sparsity level of the patches is proposed. A new norm extended fromk-support norm and ordered l1 norm is presented.(2)
An efficient minimization scheme with regulark-shrinkage thresholding operator is proposed, which is based on the optimization framework of accelerated proximal gradient (APG) method.(3)
Numerical experiments, compared to other state-of-the-art methods, demonstrate that the proposed method outperforms the related restoration methods.


### 1.3. Organization

The remainder of this paper is presented as follows. In Section2, some basic notations are provided. In Section 3, a detailed description about the proposed objective function is given. In Section 4, an efficient minimization scheme within the framework of APG is proposed. Then, some experiments are conducted to validate the effectiveness of the proposed method in Section 5. Finally, we conclude the paper in Section 6.


## 1.1. Related Works

Recently, the problem of denoising image corrupted by mixed Gaussian-impulse noise has been studied in many different contexts [8–10, 12, 13]. These methods fall into three categories: variational methods [9, 12], sparse representation [8, 10], and patch based method [7].Variational methods are a new class of the solutions to promote edge-preservation, such as total variation [14]. These methods first utilized some spatial filters to detect and remove the corrupted pixels, for example, adaptive center-weighted median filter [15] (ACWMF) or rank order absolute differences [16] (ROAD) detector. In [12], Cai et al. employed Mumford-Shah regularization term to encourage sparsity in gradient domain. In [9], Rodríguez et al. presented a novel optimization method for the generalized total variation regularization method. It can be seen that the denoised performance of these methods relies on the detection for the damaged candidates. The adaptivity of sparsity level of the regularization terms has not been investigated carefully.Sparse representation based methods have been extended to this problem. In the main idea of this scheme, it is assumed that the signal can be described by linear combination of a spare number of elements or atoms of an overcomplete dictionary. In [8], an efficient image reconstruction method by posing l1 norm on the error, and l0 norm on image patches in learned dictionary, was proposed. In [10], Filipovic and Jukic reformulated a new problem formulation by enforcing l0-l1 sparsity constraints. The resulting problem is solved by a mixed soft-hard thresholding method. However, it should be noted that these methods are time-consuming.Patch based method is proven to be a state-of-the-art denoising scheme. In [7], Ji et al. approximated the patch stack by reformulating the problem as a low rank matrix completion problem. Despite its efficacy, one of the limitations of patch based method in [7] is that the degree of sparsity has not been considered carefully. When the underlying sparsity level is unknown, we may obtain a bias estimate, considerably. To alleviate these issues in a unified formulation, a new problem formulation is proposed.


## 1.2. Contributions

The main idea of this paper is to deal with the weakness of the approach in [7]. Existing methods, such as l1 norm and trace norm, can not promote the sparsity level of all two components adaptively. The details or local fine content can not be represented and described well. To deal with these issues, a new problem formulation incorporating correlated and adaptive sparsity is proposed.Our contributions can be summarized as follows.(1)
A new problem formulation to model the sparsity level of the patches is proposed. A new norm extended fromk-support norm and ordered l1 norm is presented.(2)
An efficient minimization scheme with regulark-shrinkage thresholding operator is proposed, which is based on the optimization framework of accelerated proximal gradient (APG) method.(3)
Numerical experiments, compared to other state-of-the-art methods, demonstrate that the proposed method outperforms the related restoration methods.


## 1.3. Organization

The remainder of this paper is presented as follows. In Section2, some basic notations are provided. In Section 3, a detailed description about the proposed objective function is given. In Section 4, an efficient minimization scheme within the framework of APG is proposed. Then, some experiments are conducted to validate the effectiveness of the proposed method in Section 5. Finally, we conclude the paper in Section 6.


## 2. Preliminaries

There are some notations presented for the simplicity of discussions. Frobenius norm andl1 norm of a matrix X∈Rm×n are defined by XF and X1, respectively. For a scalar τ, the shrinkage operator [17] Sτx for l1 norm minimization problem is defined as follows: (1)Sτx=sgn⁡xmax⁡x-τ,0,where sgn is a signum function; · calculates the absolute value.Assuming thatX is of rank r, the singular value decomposition (SVD) of X with nonnegative singular values is defined by X=UΣVT, where Σ denotes a diagonal matrix with the singular values. Based on the SVD computation, the nuclear norm is defined in the following way:(2)X∗=tr⁡XtX=tr⁡VΣ2VT=∑i=1rσi,where σi is the ith largest singular value of X. A solution with shrinkage operator to the nuclear norm is singular value shrinkage operator [18] DτX, which can be expressed as follows:(3)DτX=UΣτVT,where Στ:R→R is defined as follows:(4)Στ=diag⁡sgn⁡σimax⁡σi-τ,0.However, it should be noted that the shrinkage operator for l1 norm is different from singular value shrinkage operator for nuclear norm. There operators play an important role in joint sparse and low rank matrix approximation.In this paper, orderedl1-norm [19] is provided as follows:(5)lO1=∑i=1nwxi,where x is sorted in decreasing order. xi denotes the ith largest element of the magnitude vector x=x1,…,xnT. w is a trade-off vector in nonincreasing order. When w is a constant vector, (5) reduces to l1 norm. When w1>0 and w2≤i≤n=0, then (5) reduces to l∞-norm.k-support norm [20] is defined as follows:(6)ksx=x∈Rn:x0≤S,x2≤1,where S denotes the bound of the sparsity level of x, which is a positive integer. The details of k-support norm are in traduced in [20, 21]. It has been extended to the case of matrix, which named by regular spectral k-support norm. Although this norm provides the number of elements of the sparsity level, it lacks of efficient mechanism to promote the sparsity adaptively.After taking advantage of both orderedl1 norm and k-support norm, regular k-support l1 norm is defined as follows:(7)λx1,k=∑i=1kλixi,where λ is a positive regularization vector in nonincreasing order. And 1≤k≤n, where n is the size of vector x.For the case of matrix, regular spectralk-support norm is proposed, which can be expressed as follows:(8)λXk∗=∑i=1kλiσi,X∈Rm×n,where 1≤k≤min⁡m,n. It can be noted that the singular values are arranged in nonincreasing order.


## 3. Problem Setup

This section introduces the objective function in detail. For each reference patchp, similar patches in the spatial- and temporal-domain are obtained by utilizing the patch matching algorithm. The matched patches are denoted as pii=1m, where m stands for the size. It can be noted that each patch pi is rearranged as a vector with size Rn2 through concatenating all columns into a column vector. At last, a matrix O∈n2×m is generated after considering all the m patches, which can be represented as follows:(9)O=p1,p2,…,pm.In this paper, we assumed that the observed patch matrix O can be decomposed into three components:(10)O=L+S+N,where L stands for low rank component, S is sparse component, and N is additive noise. There are some regularization methods for (10), such as L with nuclear norm (also known as the trace norm) and S with l1 norm. The problem formulation in [7] can be expressed as follows:(11)minL,SL∗+λS1,s.t.O-L-SF≤ϵ,where ·∗ is nuclear norm, and ·1 for l1 norm.However, these norms may lead to a large estimation bias [19] but can not promote the sparsity level adaptively. For example, the limitations of l1 norm have been investigated in [22, 23]. Similarly, some alternative cases, such as the lp quasinorm, also have been discussed in [24–26]. Thus, a suitable solution is required to recover these components.To alleviate these limitations, a new problem formulation is proposed to model the sparsity levels both onL and S. Moreover, a unified formulation to describe the correlated variables is considered. To estimate the underlying structures of L and S, we focus on the following minimization function:(12)minL,Sλ1Lk∗+λ2S1,k,s.t.O-L-SF≤ϵ,where λ1 and λ2 are two positive regularization vectors in a nondecreasing order. λ1Lk∗ stands for regular spectral k-support norm on L. λ2S1,k denotes regular k-support l1 norm on S. And ϵ is the standard deviation of noise N.The above formulation amounts to the constraintO-L-SF≤ϵ, which is considered more natural than usual formulation because it stands for the tolerance on the error.After choosing a suitableϵ, (12) can be reformulated as follows:(13)minL,Sλ1Lk∗+λ2S1,k+12μO-L-SF2,where μ is a suitable positive value. It can be seen that these are some challenges to solve (13). First, regular k-support l1-norm is posed on sparse component S. Second, the low rank component L is penalized by regular spectral k-support norm.There are several properties of our problem formulation in (13). First, the proposed regular spectral k-support norm on L and regular k-support l1 norm on S aim to reconstruct the local structures clearly. It should be noted that these modeling strategies can adaptively promote the sparsity level with an upper bound. Second, to the best of our knowledge, this is the first time of combining the advantages of both ordered l1 norm and k-support norm to yield a robust subspaces estimation against noise. Third, although the optimization method in [27] is very similar to the proposed method, the proposed method can deal with more complex situations. Moreover, the proposed method can adopt the more challenging situations, such as the removal of mixed Gaussian, salt-and-pepper noise, and random value impulse noise. It should be noted that this noisy situation has not been explored in [7].


## 4. Proposed Method

### 4.1. Proposed Framework

In this section, an optimization framework using regulark-shrinkage thresholding operator is presented. First, accelerated proximal gradient method (APG) is applied to the resulting problem because of its simplicity and popularity in imaging applications [28, 29]. Second, the proposed regular k-shrinkage thresholding operator is applied to the two resulting subproblems. As showed in [22, 23], nonconvex regularization functions have been shown both theoretically and experimentally to provide better results than l1 norm. Then, some explicit proximal mappings are developed.APG based scheme aims to solve an unconstrained minimization problem by(14)minXgX+fX,where g is assumed to be a nonsmooth function and f for a smooth function. Here, Lf denotes the Lipschitz constant of the gradient of f.Applying the framework of APG to problem (13), we have the following expressions:(15)X=S,L,gX=μλ1Lk∗+μλ2S1,k,fX=12O-L-SF2.Setting Lf=1, then we have the following objective function:(16)minL,Sμλ1Lk∗+μλ2S1,k+L-GkLF2+S-GkSF2,where the proximal points GkL and GkS in the framework of APG are defined in Algorithm 1. It can be noted that both the variables L and S are separable. Thus, there are two subproblems, which can be represented as follows:(17)minLμλ1Lk∗+L-GkLF2,(18)minSμλ2S1,k+S-GkSF2.It can be seen that (17) is a minimization problem with regular spectral k-support norm and (18) with regular k-support l1-norm. To deal with these problems, regular k-shrinkage thresholding operator (RK) is defined as follows:(19)RKk,τx=sgn⁡xmax⁡x⊖τ,0,x0≤k,where ⊖ denotes an operation of direct minus in nonincreasing order. k denotes the sparsity level of the input vector. τ also is a vector in a nonincreasing order.Algorithm 1:An efficient minimization scheme with regular k-shrinkage thresholding operator.
Require: L0=L-1=0; S0=S-1=0; t0=t-1=1;
μ
0
>
μ
-
>
0, ρ<1;
repeat
Y
k
L
=
L
k
+
t
k
-
1
-
1
t
k
L
k
-
L
k
-
1;
Y
k
S
=
S
k
+
t
k
-
1
-
1
t
k
S
k
-
S
k
-
1;
G
k
L
=
Y
k
L
-
1
2
Y
k
L
+
Y
k
S
-
O;
G
k
S
=
Y
k
S
-
1
2
Y
k
L
+
Y
k
S
-
O;
U
,
Σ
,
V
=
svd
⁡
G
k
L;
L
k
+
1
=
U
R
K
k
,
λ
1
μ
/
2
Σ
V
T
S
k
+
1
=
R
K
k
,
λ
2
μ
/
2
G
k
S;
t
k
+
1
=
1
+
4
t
k
2
+
1
2
;
μ
k
+
1
=
max
⁡
ρ
,
μ
k
,
μ
-
;
k
⟵
k
+
1;
untilconvergedRemark 1.
There are some differences between regulark-shrinkage thresholding operator and shrinkage operator [17]. First, the proposed operator models the sparsity level by the procedure of regular shrinkage adaptively. Second, the introduction of k-support constraint can bound the degree of the sparsity. Third, the combination of regular shrinkage and k-support leads to the modeling of the correlated variables robustly.When applying the proposed operator toGkL and GkS, we have(20)Lk+1=URKk,λ1μ/2ΣVT,Sk+1=RKk,λ2μ/2GkS,where Σ denotes the eigenvalues of GkL. It should be noted that the solution to Lk+1 can be viewed as a generalization of singular value shrinkage operator. Based on the framework of APG, an optimization framework for the objective function (16) is presented in Algorithm 1. The detailed procedures for the two subproblems are provided in Algorithm 1.


### 4.2. Some Implementation Details

In our implementation, the sampled image patches with overlapping regions are considered. Then, each frame of the restored video may be replaced by the recovered patches. For the synthesis process, the outcome of each selected pixel is accomplished by calculating the average of multiple estimates from the related patches. This procedure could deal with the artifacts along the boundaries of patches and restore fine details locally.


## 4.1. Proposed Framework

In this section, an optimization framework using regulark-shrinkage thresholding operator is presented. First, accelerated proximal gradient method (APG) is applied to the resulting problem because of its simplicity and popularity in imaging applications [28, 29]. Second, the proposed regular k-shrinkage thresholding operator is applied to the two resulting subproblems. As showed in [22, 23], nonconvex regularization functions have been shown both theoretically and experimentally to provide better results than l1 norm. Then, some explicit proximal mappings are developed.APG based scheme aims to solve an unconstrained minimization problem by(14)minXgX+fX,where g is assumed to be a nonsmooth function and f for a smooth function. Here, Lf denotes the Lipschitz constant of the gradient of f.Applying the framework of APG to problem (13), we have the following expressions:(15)X=S,L,gX=μλ1Lk∗+μλ2S1,k,fX=12O-L-SF2.Setting Lf=1, then we have the following objective function:(16)minL,Sμλ1Lk∗+μλ2S1,k+L-GkLF2+S-GkSF2,where the proximal points GkL and GkS in the framework of APG are defined in Algorithm 1. It can be noted that both the variables L and S are separable. Thus, there are two subproblems, which can be represented as follows:(17)minLμλ1Lk∗+L-GkLF2,(18)minSμλ2S1,k+S-GkSF2.It can be seen that (17) is a minimization problem with regular spectral k-support norm and (18) with regular k-support l1-norm. To deal with these problems, regular k-shrinkage thresholding operator (RK) is defined as follows:(19)RKk,τx=sgn⁡xmax⁡x⊖τ,0,x0≤k,where ⊖ denotes an operation of direct minus in nonincreasing order. k denotes the sparsity level of the input vector. τ also is a vector in a nonincreasing order.Algorithm 1:An efficient minimization scheme with regular k-shrinkage thresholding operator.
Require: L0=L-1=0; S0=S-1=0; t0=t-1=1;
μ
0
>
μ
-
>
0, ρ<1;
repeat
Y
k
L
=
L
k
+
t
k
-
1
-
1
t
k
L
k
-
L
k
-
1;
Y
k
S
=
S
k
+
t
k
-
1
-
1
t
k
S
k
-
S
k
-
1;
G
k
L
=
Y
k
L
-
1
2
Y
k
L
+
Y
k
S
-
O;
G
k
S
=
Y
k
S
-
1
2
Y
k
L
+
Y
k
S
-
O;
U
,
Σ
,
V
=
svd
⁡
G
k
L;
L
k
+
1
=
U
R
K
k
,
λ
1
μ
/
2
Σ
V
T
S
k
+
1
=
R
K
k
,
λ
2
μ
/
2
G
k
S;
t
k
+
1
=
1
+
4
t
k
2
+
1
2
;
μ
k
+
1
=
max
⁡
ρ
,
μ
k
,
μ
-
;
k
⟵
k
+
1;
untilconvergedRemark 1.
There are some differences between regulark-shrinkage thresholding operator and shrinkage operator [17]. First, the proposed operator models the sparsity level by the procedure of regular shrinkage adaptively. Second, the introduction of k-support constraint can bound the degree of the sparsity. Third, the combination of regular shrinkage and k-support leads to the modeling of the correlated variables robustly.When applying the proposed operator toGkL and GkS, we have(20)Lk+1=URKk,λ1μ/2ΣVT,Sk+1=RKk,λ2μ/2GkS,where Σ denotes the eigenvalues of GkL. It should be noted that the solution to Lk+1 can be viewed as a generalization of singular value shrinkage operator. Based on the framework of APG, an optimization framework for the objective function (16) is presented in Algorithm 1. The detailed procedures for the two subproblems are provided in Algorithm 1.


## 4.2. Some Implementation Details

In our implementation, the sampled image patches with overlapping regions are considered. Then, each frame of the restored video may be replaced by the recovered patches. For the synthesis process, the outcome of each selected pixel is accomplished by calculating the average of multiple estimates from the related patches. This procedure could deal with the artifacts along the boundaries of patches and restore fine details locally.


## 5. Experiments and Discussion

### 5.1. Experimental Settings

To demonstrate the effectiveness and efficacy of the proposed method, some experiments are conducted. We focus on the removal of mixed Gaussian-impulse noise. Two types of noisy situations, including mixed Gaussian and random value impulse noise (GRV) denoted byσ,si and mixed Gaussian, salt-and-pepper noise, and random value impulse noise (GSPRV) by σ,sp,si, are tested. Some samples of three videos (http://trace.eas.asu.edu/yuv/) are displayed in Figure 1. The sizes ofcoastguard,flower, andnews in our experiments are 176×144×100, 352×240×150, and 352×288×150, respectively. The parameter k of the proposed method for thecoastguard is set to 1000. For the other videos, that is,flower andnews, k is set to 2000. All experiments are performed in MATLAB R2014 running on a desktop with Intel Core i7 at 3.2 GHz.Figure 1
Two samples used in the experiments ((a) sample forflower, (b) sample fornews).
(a)
(b)Three related methods are compared with the proposed method, including VBM3D [30], RPCA based method [7], and l0-l1 based method [8]. VBM3D based method is not originally designed for the removal of mixed Gaussian-impulse noise. To remedy this problem, adaptive center-weighted median filter [15] (ACWMF) is used to detect and remove the impulse noise firstly. Two indexes are taken for assessing the denoised performance of all competing methods, that is, peak-signal-to-noise ratio (PSNR) and feature-similarity (FSIM) index [31].


### 5.2. Mixed Gaussian and Random Value Impulse Noise

In this subsection, the denoising results for three different scenarios are presented, includingσ,si=10,10%,15,20%, and 20,30%. Numerical results on three videos are presented in Table 1. It can be observed that the proposed method outperforms all the competing methods with respect to FSIM and PSNR. Visual outcomes are demonstrated in Figure 2. The recovered result of proposed method is presented in Figure 2(f). To examine the recovered details, the selected parts in the visual results are enlarged. It can be noted that the proposed method can reconstruct more local details.Table 1
Numerical results by the removal of MGRV, measured by PSNR and FSIM.
Noise level
Indexes
Methods
Coastguard
Flower
News
(
10,10
%
)
PSNR
VBM3D
28.75
19.62
30.36
RPCA
30.75
22.11
33.49
l
1-l0
28.49
19.45
28.40
Ours
31.07
23.01
34.86
(
15,20
%
)
PSNR
VBM3D
27.37
18.72
28.10
RPCA
28.98
19.66
30.24
l
1-l0
26.15
18.12
25.56
Ours
29.58
21.41
31.32
(
20,30
%
)
PSNR
VBM3D
25.56
17.97
25.64
RPCA
25.69
18.23
26.34
l
1-l0
23.06
16.66
24.20
Ours
27.17
19.30
27.41
(
10,10
%
)
FSIM (%)
VBM3D
87.71
81.64
95.52
RPCA
90.01
87.57
96.47
l
1-l0
91.35
84.94
90.11
Ours
92.04
92.14
96.35
(
15,20
%
)
FSIM (%)
VBM3D
82.24
75.90
92.74
RPCA
89.32
79.93
93.47
l
1-l0
84.33
79.25
87.10
Ours
90.13
87.58
94.06
(
20,30
%
)
FSIM (%)
VBM3D
77.19
70.42
89.18
RPCA
86.69
74.30
88.35
l
1-l0
79.47
73.35
82.41
Ours
87.82
77.09
89.48Figure 2
Visual comparison of denoising results on flower by noise levelσ,si=10,10%. (a) Original sample(flower), (b) noisy image, (c) VBM3D based method (PSNR=19.62), (d) RPCA based method (PSNR=22.11), (e) l1-l0 based method (PSNR=19.45), and (f) the proposed method (PSNR=23.01, k=2000).
(a)
(b)
(c)
(d)
(e)
(f)


### 5.3. Mixed Gaussian, Salt-and-Pepper Noise, and Random Value Impulse Noise

In this subsection, the experimental results by the removal of Gaussian, salt-and-pepper, and random value impulse noise are demonstrated. Two noisy levels are assessed. The numerical results are presented in Table2. It can be noted that the proposed method outperforms other methods. A visual assessment of the reconstruction performance of both algorithms is shown in Figure 3. As shown in the enlarged parts, the proposed method presented in Figure 3(f) recovers more local details than other methods.Table 2
Numerical results by the removal of GSPRV, measured by PSNR and FSIM.
Noise level
Indexes
Methods
Coastguard
Flower
News
(
10,10
%
,
10
%
)
PSNR
VBM3D
24.54
18.13
27.22
RPCA
24.72
18.98
28.40
l
1-l0
26.27
18.35
27.05
Ours
25.27
20.51
29.32
(
15,15
%
,
15
%
)
PSNR
VBM3D
23.79
17.62
26.23
RPCA
22.11
16.65
24.60
l
1-l0
24.21
17.37
24.87
Ours
24.26
18.67
28.01
(
10,10
%
,
10
%
)
FSIM (%)
VBM3D
85.32
78.72
93.52
RPCA
89.50
82.94
93.75
l
1-l0
88.62
79.44
90.66
Ours
89.43
87.64
94.13
(
15,15
%
,
15
%
)
FSIM (%)
VBM3D
80.05
74.39
90.87
RPCA
83.33
75.13
82.78
l
1-l0
83.57
75.16
84.61
Ours
87.72
79.92
91.83Figure 3
Visual comparison of denoising results by noise level15,15%,15%. (a) Original sample(news), (b) noisy image, (c) VBM3D based method (PSNR=26.23), (d) RPCA based method (PSNR=24.60), (e) l1-l0 based method (PSNR=24.87), and (f) the proposed method (PSNR=28.01, k=2000).
(a)
(b)
(c)
(d)
(e)
(f)


### 5.4. Discussion

In this paper, an efficient image restoration scheme for hybrid Gaussian-impulse noise is proposed. The denoising performance of our method is examined in various noisy scenarios. When the strength of noisy levels increased, our method performed more efficiently than other methods. The outcomes of all experiments verified the effectiveness of the proposed method. The difference may be related to the modeling method and optimization strategy we taken. Moreover, the intrinsic sparsity structure of each decomposition component is explored. It should be noted that some limitations may be observed, such as being oversmooth on the local region.In this paper, an alternating minimization method with regulark-shrinkage thresholding operator is proposed. Specially, a universal modeling strategy by exploiting the adaptivity of sparsity structure leads to higher quality reconstructions. The proposed method may provide a new class of denoising methods to deal with mixed Gaussian-impulse noise. The numerical results from various experiments validated the effectiveness of the proposed method again.


## 5.1. Experimental Settings

To demonstrate the effectiveness and efficacy of the proposed method, some experiments are conducted. We focus on the removal of mixed Gaussian-impulse noise. Two types of noisy situations, including mixed Gaussian and random value impulse noise (GRV) denoted byσ,si and mixed Gaussian, salt-and-pepper noise, and random value impulse noise (GSPRV) by σ,sp,si, are tested. Some samples of three videos (http://trace.eas.asu.edu/yuv/) are displayed in Figure 1. The sizes ofcoastguard,flower, andnews in our experiments are 176×144×100, 352×240×150, and 352×288×150, respectively. The parameter k of the proposed method for thecoastguard is set to 1000. For the other videos, that is,flower andnews, k is set to 2000. All experiments are performed in MATLAB R2014 running on a desktop with Intel Core i7 at 3.2 GHz.Figure 1
Two samples used in the experiments ((a) sample forflower, (b) sample fornews).
(a)
(b)Three related methods are compared with the proposed method, including VBM3D [30], RPCA based method [7], and l0-l1 based method [8]. VBM3D based method is not originally designed for the removal of mixed Gaussian-impulse noise. To remedy this problem, adaptive center-weighted median filter [15] (ACWMF) is used to detect and remove the impulse noise firstly. Two indexes are taken for assessing the denoised performance of all competing methods, that is, peak-signal-to-noise ratio (PSNR) and feature-similarity (FSIM) index [31].


## 5.2. Mixed Gaussian and Random Value Impulse Noise

In this subsection, the denoising results for three different scenarios are presented, includingσ,si=10,10%,15,20%, and 20,30%. Numerical results on three videos are presented in Table 1. It can be observed that the proposed method outperforms all the competing methods with respect to FSIM and PSNR. Visual outcomes are demonstrated in Figure 2. The recovered result of proposed method is presented in Figure 2(f). To examine the recovered details, the selected parts in the visual results are enlarged. It can be noted that the proposed method can reconstruct more local details.Table 1
Numerical results by the removal of MGRV, measured by PSNR and FSIM.
Noise level
Indexes
Methods
Coastguard
Flower
News
(
10,10
%
)
PSNR
VBM3D
28.75
19.62
30.36
RPCA
30.75
22.11
33.49
l
1-l0
28.49
19.45
28.40
Ours
31.07
23.01
34.86
(
15,20
%
)
PSNR
VBM3D
27.37
18.72
28.10
RPCA
28.98
19.66
30.24
l
1-l0
26.15
18.12
25.56
Ours
29.58
21.41
31.32
(
20,30
%
)
PSNR
VBM3D
25.56
17.97
25.64
RPCA
25.69
18.23
26.34
l
1-l0
23.06
16.66
24.20
Ours
27.17
19.30
27.41
(
10,10
%
)
FSIM (%)
VBM3D
87.71
81.64
95.52
RPCA
90.01
87.57
96.47
l
1-l0
91.35
84.94
90.11
Ours
92.04
92.14
96.35
(
15,20
%
)
FSIM (%)
VBM3D
82.24
75.90
92.74
RPCA
89.32
79.93
93.47
l
1-l0
84.33
79.25
87.10
Ours
90.13
87.58
94.06
(
20,30
%
)
FSIM (%)
VBM3D
77.19
70.42
89.18
RPCA
86.69
74.30
88.35
l
1-l0
79.47
73.35
82.41
Ours
87.82
77.09
89.48Figure 2
Visual comparison of denoising results on flower by noise levelσ,si=10,10%. (a) Original sample(flower), (b) noisy image, (c) VBM3D based method (PSNR=19.62), (d) RPCA based method (PSNR=22.11), (e) l1-l0 based method (PSNR=19.45), and (f) the proposed method (PSNR=23.01, k=2000).
(a)
(b)
(c)
(d)
(e)
(f)


## 5.3. Mixed Gaussian, Salt-and-Pepper Noise, and Random Value Impulse Noise

In this subsection, the experimental results by the removal of Gaussian, salt-and-pepper, and random value impulse noise are demonstrated. Two noisy levels are assessed. The numerical results are presented in Table2. It can be noted that the proposed method outperforms other methods. A visual assessment of the reconstruction performance of both algorithms is shown in Figure 3. As shown in the enlarged parts, the proposed method presented in Figure 3(f) recovers more local details than other methods.Table 2
Numerical results by the removal of GSPRV, measured by PSNR and FSIM.
Noise level
Indexes
Methods
Coastguard
Flower
News
(
10,10
%
,
10
%
)
PSNR
VBM3D
24.54
18.13
27.22
RPCA
24.72
18.98
28.40
l
1-l0
26.27
18.35
27.05
Ours
25.27
20.51
29.32
(
15,15
%
,
15
%
)
PSNR
VBM3D
23.79
17.62
26.23
RPCA
22.11
16.65
24.60
l
1-l0
24.21
17.37
24.87
Ours
24.26
18.67
28.01
(
10,10
%
,
10
%
)
FSIM (%)
VBM3D
85.32
78.72
93.52
RPCA
89.50
82.94
93.75
l
1-l0
88.62
79.44
90.66
Ours
89.43
87.64
94.13
(
15,15
%
,
15
%
)
FSIM (%)
VBM3D
80.05
74.39
90.87
RPCA
83.33
75.13
82.78
l
1-l0
83.57
75.16
84.61
Ours
87.72
79.92
91.83Figure 3
Visual comparison of denoising results by noise level15,15%,15%. (a) Original sample(news), (b) noisy image, (c) VBM3D based method (PSNR=26.23), (d) RPCA based method (PSNR=24.60), (e) l1-l0 based method (PSNR=24.87), and (f) the proposed method (PSNR=28.01, k=2000).
(a)
(b)
(c)
(d)
(e)
(f)


## 5.4. Discussion

In this paper, an efficient image restoration scheme for hybrid Gaussian-impulse noise is proposed. The denoising performance of our method is examined in various noisy scenarios. When the strength of noisy levels increased, our method performed more efficiently than other methods. The outcomes of all experiments verified the effectiveness of the proposed method. The difference may be related to the modeling method and optimization strategy we taken. Moreover, the intrinsic sparsity structure of each decomposition component is explored. It should be noted that some limitations may be observed, such as being oversmooth on the local region.In this paper, an alternating minimization method with regulark-shrinkage thresholding operator is proposed. Specially, a universal modeling strategy by exploiting the adaptivity of sparsity structure leads to higher quality reconstructions. The proposed method may provide a new class of denoising methods to deal with mixed Gaussian-impulse noise. The numerical results from various experiments validated the effectiveness of the proposed method again.


## 6. Conclusion

In this paper, an efficient video restoration scheme is proposed for the removal of mixed Gaussian-impulse noise. Unlike traditionall1 norm based methods, which treat all the values equally, the proposed method tries to explore the additional structure by regular spectral k-support norm on low rank component and regular k-support l1 norm on sparse component. Then, the special structure can be promoted on the sparsity level of the decomposition matrices adaptively. To overcome the nonconvex problem, a solution with alternating regular k-shrinkage thresholding operator is proposed. The proposed method has good practical performance with appropriate structures. The numerical results, compared to some state-of-the-art methods, demonstrate the advantages of the proposed method.



---

*Source: 2520301-2017-07-12.xml*