# MIMO Radar Imaging Based on Smoothedl

Authors: Jun-Jie Feng; Gong Zhang; Fang-Qing Wen
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

For radar imaging, a target usually has only a few strong scatterers which are sparsely distributed. In this paper, we propose a compressive sensing MIMO radar
imaging algorithm based on smoothedl
0 norm. An approximate hyperbolic tangent function is proposed as the smoothed function to measure the sparsity. A revised Newton method is used to solve the optimization problem by deriving the new revised Newton directions for the sequence of approximate hyperbolic tangent functions. In order to improve robustness of the imaging algorithm, main value weighted method is proposed. Simulation results show that the proposed algorithm is superior to Orthogonal Matching Pursuit (OMP), smoothed l
0 method (SL0), and Bayesian method with Laplace prior in performance of sparse signal reconstruction. Two-dimensional image quality of MIMO radar using the new method has great improvement comparing with aforementioned reconstruction algorithm.


---

## Body

## 1. Introduction

Multiple Input Multiple Output (MIMO) radar has been widely concerned in recent years. Unlike the conventional radar system which transmits correlated signals, a MIMO radar system transmits multiple independent signals and receives the scattered signals via its antennas [1–4]. A MIMO radar system has many advantages in both distributed MIMO radar scenario and collocated MIMO radar scenario. The distributed MIMO radar takes advantage of diversity of the receive antennas to improve target recognition [5–8]. For collocated MIMO radar, the element spacing of transmit antennas and receive antennas are sufficiently small so that the radar returns from a given scatterer are fully correlated across the array, which can improve the spatial resolution [9–11]. We adopt the latter scenario in this paper. The Bipolar Phase Shift Keying (BPSK) signals and step frequency signals are usually used as the transmit signal. However, the defect of these signals is high sidelobes and it is difficult to eliminate sidelobes and improve imaging quality by conventional methods such as windowing methods. Combining MIMO radar with ISAR technology is discussed in [12], but it cannot realize one snapshot imaging. A single snapshot imaging method is proposed in [13]; however, it needs too many antennas.The recent developed new field, known as sparse learning, is a technique proposed recently to recovery sparse signal by optimization theory [14–16]. Sparsity can usually be measured by l
p  (0
≤
p
≤
1) norm. The sparse learning reconstruction algorithms based on l
0 norm are intractable because they require a combinatorial search, and they are sensitive to noise. The computational complexity of the reconstruction algorithms based on l
1 norm is high enough, which makes them impractical for some practical applications. Hence many simpler algorithms, such as orthogonal matching pursuit (OMP) [17, 18], were proposed, but they are iteratively greedy algorithms and do not give good estimation of the sources. Mohimani et al. proposed a smoothed function to approximate l
0 norm; then the problem of minimum l
0 norm optimization can be transferred to an optimization problem for smoothed functions, called smoothed l
0 norm (SL0) [19]. The method based on smoothed l
0 norm is about two orders of magnitude faster than l
1-magic method, while providing better estimation of the source than l
1-magic.The targets in sky are usually sparse and can be viewed as ideal point targets for DOA estimation. The signal model in this case fits the requirement of sparse learning. Angle-Doppler estimation of targets using sparse learning of MIMO radar was studied in [20], where narrow band signal was used. A Sparse Learning via Iterative Minimization (SLIM) algorithm is proposed and the application on range-angle-Doppler estimation of MIMO radar is discussed in [21]. For radar imaging, a target usually has only a few strong scatterers which are sparsely distributed. Then sparse learning reconstruction methods can be used in radar imaging. A high resolution imaging method of ground-based radar with sparse learning is proposed in [22]. We will discuss the performance of MIMO radar imaging based on sparse signal recovery algorithm. In order to solve the optimization problem effectively, we utilize a revised Newton method to derive the new revised Newton directions for the approximate hyperbolic tangent function. Because the condition number of the matrix A
A
H is very large in MIMO radar imaging, the matrix can be ill-conditioned and the algorithm will lose its robustness. We use main value weighted method to improve the robustness of this algorithm.This paper is organized as follows. Section2 introduces the MIMO radar signal model. Section 3 introduces the proposed reconstruction algorithm. Simulation results are presented in Section 4. Finally, Section 5 provides the conclusion.


## 2. MIMO Radar Signal Model

In this section, we describe a signal model for the MIMO radar. Considering a monostatic MIMO radar imaging system with only one snapshot signal, it has aM-element transmit array and a N-element receive array, both of which are closely spaced uniform linear arrays (ULA). We assume that the targets appear in far field. Therefore, the directions of a target relative to the transmit antennas and the received antennas are the same, and the RCS of a target corresponding to different antennas are also the same. The MIMO radar geometry is shown in Figure 1.Figure 1
Geometry of MIMO radar imaging.LetA
m and B
n express the positions of the mth transmit array and the nth receive array, respectively. c
m expresses the transmit code of the mth transmit antenna. The baseband transmit waveform can be modeled as
(1)
s
m
(
t
)
=
∑
l
=
0
L
-
1
c
m
l
u
t
-
l
T
s
,
where
(2)
u
(
t
)
=
1
if
-
T
s
/
2
<
t
<
T
s
/
2
0
others
,
where T
s is the subpulse duration and L is the code length. At the transmit site, the signal transmitted by the mth transmitter is modeled as s
m
(
t
)
e
j
2
π
f
c
t, where f
c is the carrier frequency of the signal. The backscattered signal from point k observed at the nth receiver is given by
(3)
x
n
t
=
η
k
∑
m
=
0
M
-
1
s
m
(
t
-
τ
A
m
k
-
τ
B
n
k
)
×
exp
⁡
-
j
2
π
f
τ
A
m
k
+
τ
B
n
k
,
where τ
A
m
k
=
A
m
k
/
c,  τ
B
n
k
=
B
n
k
/
c, η
k is the scatterer amplitude. Denote τ
k
=
τ
A
m
k
+
τ
B
n
k; the received array signal can be expressed as
(4)
x
n
t
=
η
k
∑
m
=
0
M
-
1
s
m
(
t
-
τ
k
)
×
exp
⁡
-
j
2
π
f
τ
k
.The above equation can be rewritten as a simple matrix form(5)
x
t
=
η
a
b
T
s
t
-
τ
k
,
where x
t
=
[
x
0
t
,
x
1
t
,
…
,
x
N
-
1
t
]
T, a
=
[
e
-
j
2
π
f
τ
B
0
k
,
e
-
j
2
π
f
τ
B
1
k
,
…
,
e
-
j
2
π
f
τ
B
N
-
1
k
]
T, b
=
[
e
-
j
2
π
f
τ
A
0
k
,
e
-
j
2
π
f
τ
A
1
k
,
…
,
e
-
j
2
π
f
τ
A
M
-
1
k
]
T, and
(6)
s
t
=
s
0
t
⋮
s
M
-
1
t
.Through time domain sampling, the received signal can be expressed as a matrixS. vec
⁡
(
·
) is the vectoring operator. Let x
=
vec
⁡
(
S
), w
k
=
vec
⁡
(
a
b
T
s
(
t
-
τ
k
)
); we have x
=
η
k
w
k. The imaging region is divided as grids. Basis matrix Ψ
=
[
w
1
,
w
2
,
…
] and scatter amplitudes vector η
=
η
1
,
η
2
,
…
T are formed for all grids. If a scatterer is not zero, the received discrete signal can be expressed as
(7)
x
=
Ψ
η
+
n
,
where n is noise. The aim of imaging is to solve for the vector η in (7).For sparse learning, the optimization algorithms have been developed for real valued signals. We divide the signal into its real and imaginary parts as follows:(8)
y
=
R
(
x
)
I
(
x
)
,
A
=
R
(
Ψ
)
-
I
(
Ψ
)
I
(
Ψ
)
R
(
Ψ
)
α
=
R
(
η
)
I
(
η
)
,
z
=
R
(
n
)
I
(
n
)
,
where R
(
·
) and I
(
·
) express the real and imaginary part of the complex vector, respectively. So (7) becomes
(9)
y
=
A
α
+
z
.Because the strong scatterers are sparsely distributed for imaging,α is sparse. To solve α, we can use the following optimization sparse optimization strategy:
(10)
α
^
=
argmin
α
p
s
·
t
y
-
A
α
2
<
ε
,
where ε is a small positive number associated with z. p indicates the l
p norm. The imaging quality depends largely on reconstruction algorithms and an improved SL0 algorithm is proposed and applied to MIMO radar imaging. We give a detailed description about the algorithm in the next section.


## 3. Sparse Signal Recovery Imaging Algorithm

### 3.1. Using Hyperbolic Tangent Function Approximate tol
0 Norm

In order to obtain an approximatel
0 norm solution, a smoothed function G
σ
(
α
)
=
∑
i
exp
⁡
(
-
α
i
2
/
2
σ
2
) was used to replace the l
0 norm in [19]. By letting σ varies from a larger value to zero, the minimum l
0 norm solution is obtained. In order to further improve the approximation performance of the smoothed function, we propose a function which is approximate hyperbolic tangent function to approach the l
0 norm. The function can be expressed as follows:
(11)
f
σ
α
=
2
e
-
α
2
/
2
σ
2
e
α
2
/
2
σ
2
+
e
-
α
2
/
2
σ
2
,
where σ is an auxiliary variable; it is obvious that
(12)
lim
⁡
σ
→
0
f
σ
(
α
i
)
=
0
,
α
i
≠
0
1
,
α
i
=
0
.
Denote F
σ
(
α
)
=
∑
i
=
1
N
f
σ
(
α
i
); α
0 expresses the number of nonzero elements of vector α. According to the definition of l
0 norm, we can obtain α
0
=
lim
⁡
σ
→
0
⁡
F
σ
(
α
). In order to further show the advantages of the approximate hyperbolic tangent function, we compare the performance of approximate hyperbolic tangent function and gauss function at σ
=
0.1. From Figure 2, one can see that the approximate hyperbolic tangent function is steeper than gauss function, so the performance of approaching to minimum l
0 norm is more excellent.Figure 2
The comparison of Gauss function and the approximate hyperbolic tangent function.Therefore sparse signal recovery algorithm based onF
σ
(
α
) function minimum can be described as
(13)
α
^
=
lim
⁡
σ
→
σ
min
⁡
argmin
F
σ
α
,
s
·
t
y
-
A
α
2
<
ε
.


### 3.2. Reconstruction Algorithm Based on Revised Newton Method (ASL0 Algorithm)

There are many methods to solve (13). The most representative one is the steepest descent method in [19]. However, the search path will be a “sawtooth” shape in the process of searching the optimal value, which will affect the estimation accuracy of minimum l
0 norm. In order to better approximate to the l
0 norm, we choose the revised Newton method to solve the problem.First, we compute the Newton direction of approximate hyperbolic tangent functiond
=
-
∇
2
F
σ
α
-
1
∇
F
σ
α where
(14)
∇
F
σ
α
=
∂
f
σ
(
α
1
)
∂
α
1
,
∂
f
σ
(
α
2
)
∂
α
2
,
…
,
∂
f
σ
(
α
N
)
∂
α
N
T
=
-
4
α
1
/
σ
2
e
α
1
2
/
2
σ
2
+
e
-
α
1
2
/
2
σ
2
2
,
k
k
l
k
-
4
α
2
/
σ
2
e
α
2
2
/
2
σ
2
+
e
-
α
2
2
/
2
σ
2
2
,
…
,
k
k
l
k
-
4
α
N
/
σ
2
e
α
N
2
/
2
σ
2
+
e
-
α
N
2
/
2
σ
2
2
T
∇
2
F
σ
α
=
∂
2
f
σ
α
1
∂
2
α
1
2
0
⋯
0
0
∂
2
f
σ
α
2
∂
α
2
2
⋯
0
⋮
⋮
⋮
0
0
⋯
∂
2
f
σ
α
N
∂
α
N
2
,
∂
2
f
σ
(
α
k
)
∂
α
k
2
=
(
4
/
σ
2
)
2
α
k
2
/
σ
2
-
1
e
α
k
2
/
2
σ
2
-
2
α
k
2
/
σ
2
+
1
e
-
α
k
2
/
2
σ
2
e
-
α
k
2
/
2
σ
2
+
e
α
k
2
/
2
σ
2
3
.
From the results above, we can see that the Hessen matrix (∇
2
(
F
σ
(
α
)
)) in the Newton direction of d is not the positive definite matrix, which does not ensure Newton direction of d is a descent direction. So in the second step, we will revise the Hessen matrix above and obtain a revised Newton direction. We construct a new matrix G
=
∇
2
(
F
σ
(
α
)
)
+
ε
k
I, where ε
k is a properly chosen positive elements and I is the identity matrix, which makes the diagonal elements of G all positive.To meet the requirement,ε
k is chosen as
(15)
ε
k
=
(
8
/
σ
2
)
e
α
k
2
/
2
σ
2
+
1
+
2
α
k
2
/
σ
2
e
-
α
k
2
/
2
σ
2
e
α
k
2
/
2
σ
2
+
e
-
α
k
2
/
2
σ
2
3
.
Thus the revised diagonal element of G is 4
2
α
k
2
/
σ
2
+
1
/
σ
2
e
α
k
2
/
2
σ
2
+
e
-
α
k
2
/
2
σ
2
2, which meets the requirement of positive definite matrix.Finally, the Newton direction in this paper is simplified as(16)
d
=
-
G
-
1
∇
(
F
σ
(
α
)
)
=
σ
2
α
1
σ
2
+
2
α
1
2
,
…
,
σ
2
α
k
σ
2
+
2
α
k
2
,
…
,
σ
2
α
N
σ
2
+
2
α
N
2
T
.
According to the above expression, the algorithm structure of ASL0 can be described as follows:(i)
initialization:
(1)
let the minimuml
2 norm solution of y
=
A
α be the initial value, α
^
=
A
H
(
A
A
H
)
-
1
y;
(2)
choose a proper decreasing sequence ofσ, σ
1
σ
2
⋯
σ
J;
(ii)
forj
=
1
,
…
,
J:
(1)
letσ
=
σ
j;
(2)
minimize the functionF
σ on the feasible set α
=
α
:
A
α
-
y
2
<
ε
①
α
=
α
^
j
-
1
②
forl
=
1
,
…
,
L:
(a)
compute the revised Newton direction(17)
d
=
-
G
-
1
∨
(
F
σ
(
α
)
)
=
-
4
α
1
σ
2
+
2
α
1
2
,
…
,
-
4
α
k
σ
2
+
2
α
k
2
,
…
,
-
4
α
N
σ
2
+
2
α
N
2
T
;
(b)
use the revised Newton method and obtainα
=
α
+
μ
d;
(c)
projectα back into the feasible set α: α
=
α
-
A
T
(
A
A
T
)
-
1
(
A
α
-
y
);
(3)
setα
j
=
α;
(iii)
final answer isα
=
α
^
J.Now let us explain the choosing of some parameters.α
^
0
=
A
H
(
A
A
H
)
-
1
y is the minimum l
2 norm solution. In [19] σ
1 is chosen as σ
1
>
4
ma
x
i
α
^
0
(
i
), exp
⁡
(
-
α
^
0
(
i
)
2
/
2
σ
1
2
)
>
0.96
≈
1. In this paper, when we choose f
σ
(
α
)
=
2
e
-
α
2
/
2
σ
2
/
(
e
α
2
/
2
σ
2
+
e
-
α
2
/
2
σ
2
), σ
1 should be chosen as σ
1
>
12
ma
x
i
α
^
0
(
i
). The choice of σ
J is also important. When σ
J
→
0, the norm F
σ
(
α
) approximates to l
0 norm. However, l
0 norm is not suited to express a vector with many small elements. Because, for radar imaging, there are many small scatterers, the choice of σ
J should not be too small. For σ
J, we choose σ
J
=
E
(
max
⁡
(
A
H
(
A
A
H
)
-
1
z
)
), where E expresses expectation. Then σ
J can be estimated by selecting a few noise samples, computing A
T
(
A
A
T
)
-
1
z, selecting the maximum value of A
T
(
A
A
T
)
-
1
z, and taking the average value.


### 3.3. Robust Improvement

In practical application,A
A
H can be in ill condition because its condition number is very large. In our imaging, the condition number is up to 1
0
16. It cannot be convergent if using A
A
H
-
1 directly. The main weighted method can solve the ill condition problem. We add a diagonal matrix γ
I to A
A
H; then (
A
A
H
+
γ
I
)
-
1 can take the place of A
A
H
-
1. If weighted factor γ is too small, the improved effect of ill condition matrix is not obvious. If choosing the larger γ, the convergence speed will slow down, even the solution will be distorted. There is no good way about how to choose the value of γ. A suggested way is to compute the largest eigenvalue λ
max
⁡ of A
A
H and then choose 0.5
λ
max
⁡
×
1
0
-
4
<
γ
<
0.5
λ
max
⁡
×
1
0
-
3.


## 3.1. Using Hyperbolic Tangent Function Approximate tol
0 Norm

In order to obtain an approximatel
0 norm solution, a smoothed function G
σ
(
α
)
=
∑
i
exp
⁡
(
-
α
i
2
/
2
σ
2
) was used to replace the l
0 norm in [19]. By letting σ varies from a larger value to zero, the minimum l
0 norm solution is obtained. In order to further improve the approximation performance of the smoothed function, we propose a function which is approximate hyperbolic tangent function to approach the l
0 norm. The function can be expressed as follows:
(11)
f
σ
α
=
2
e
-
α
2
/
2
σ
2
e
α
2
/
2
σ
2
+
e
-
α
2
/
2
σ
2
,
where σ is an auxiliary variable; it is obvious that
(12)
lim
⁡
σ
→
0
f
σ
(
α
i
)
=
0
,
α
i
≠
0
1
,
α
i
=
0
.
Denote F
σ
(
α
)
=
∑
i
=
1
N
f
σ
(
α
i
); α
0 expresses the number of nonzero elements of vector α. According to the definition of l
0 norm, we can obtain α
0
=
lim
⁡
σ
→
0
⁡
F
σ
(
α
). In order to further show the advantages of the approximate hyperbolic tangent function, we compare the performance of approximate hyperbolic tangent function and gauss function at σ
=
0.1. From Figure 2, one can see that the approximate hyperbolic tangent function is steeper than gauss function, so the performance of approaching to minimum l
0 norm is more excellent.Figure 2
The comparison of Gauss function and the approximate hyperbolic tangent function.Therefore sparse signal recovery algorithm based onF
σ
(
α
) function minimum can be described as
(13)
α
^
=
lim
⁡
σ
→
σ
min
⁡
argmin
F
σ
α
,
s
·
t
y
-
A
α
2
<
ε
.


## 3.2. Reconstruction Algorithm Based on Revised Newton Method (ASL0 Algorithm)

There are many methods to solve (13). The most representative one is the steepest descent method in [19]. However, the search path will be a “sawtooth” shape in the process of searching the optimal value, which will affect the estimation accuracy of minimum l
0 norm. In order to better approximate to the l
0 norm, we choose the revised Newton method to solve the problem.First, we compute the Newton direction of approximate hyperbolic tangent functiond
=
-
∇
2
F
σ
α
-
1
∇
F
σ
α where
(14)
∇
F
σ
α
=
∂
f
σ
(
α
1
)
∂
α
1
,
∂
f
σ
(
α
2
)
∂
α
2
,
…
,
∂
f
σ
(
α
N
)
∂
α
N
T
=
-
4
α
1
/
σ
2
e
α
1
2
/
2
σ
2
+
e
-
α
1
2
/
2
σ
2
2
,
k
k
l
k
-
4
α
2
/
σ
2
e
α
2
2
/
2
σ
2
+
e
-
α
2
2
/
2
σ
2
2
,
…
,
k
k
l
k
-
4
α
N
/
σ
2
e
α
N
2
/
2
σ
2
+
e
-
α
N
2
/
2
σ
2
2
T
∇
2
F
σ
α
=
∂
2
f
σ
α
1
∂
2
α
1
2
0
⋯
0
0
∂
2
f
σ
α
2
∂
α
2
2
⋯
0
⋮
⋮
⋮
0
0
⋯
∂
2
f
σ
α
N
∂
α
N
2
,
∂
2
f
σ
(
α
k
)
∂
α
k
2
=
(
4
/
σ
2
)
2
α
k
2
/
σ
2
-
1
e
α
k
2
/
2
σ
2
-
2
α
k
2
/
σ
2
+
1
e
-
α
k
2
/
2
σ
2
e
-
α
k
2
/
2
σ
2
+
e
α
k
2
/
2
σ
2
3
.
From the results above, we can see that the Hessen matrix (∇
2
(
F
σ
(
α
)
)) in the Newton direction of d is not the positive definite matrix, which does not ensure Newton direction of d is a descent direction. So in the second step, we will revise the Hessen matrix above and obtain a revised Newton direction. We construct a new matrix G
=
∇
2
(
F
σ
(
α
)
)
+
ε
k
I, where ε
k is a properly chosen positive elements and I is the identity matrix, which makes the diagonal elements of G all positive.To meet the requirement,ε
k is chosen as
(15)
ε
k
=
(
8
/
σ
2
)
e
α
k
2
/
2
σ
2
+
1
+
2
α
k
2
/
σ
2
e
-
α
k
2
/
2
σ
2
e
α
k
2
/
2
σ
2
+
e
-
α
k
2
/
2
σ
2
3
.
Thus the revised diagonal element of G is 4
2
α
k
2
/
σ
2
+
1
/
σ
2
e
α
k
2
/
2
σ
2
+
e
-
α
k
2
/
2
σ
2
2, which meets the requirement of positive definite matrix.Finally, the Newton direction in this paper is simplified as(16)
d
=
-
G
-
1
∇
(
F
σ
(
α
)
)
=
σ
2
α
1
σ
2
+
2
α
1
2
,
…
,
σ
2
α
k
σ
2
+
2
α
k
2
,
…
,
σ
2
α
N
σ
2
+
2
α
N
2
T
.
According to the above expression, the algorithm structure of ASL0 can be described as follows:(i)
initialization:
(1)
let the minimuml
2 norm solution of y
=
A
α be the initial value, α
^
=
A
H
(
A
A
H
)
-
1
y;
(2)
choose a proper decreasing sequence ofσ, σ
1
σ
2
⋯
σ
J;
(ii)
forj
=
1
,
…
,
J:
(1)
letσ
=
σ
j;
(2)
minimize the functionF
σ on the feasible set α
=
α
:
A
α
-
y
2
<
ε
①
α
=
α
^
j
-
1
②
forl
=
1
,
…
,
L:
(a)
compute the revised Newton direction(17)
d
=
-
G
-
1
∨
(
F
σ
(
α
)
)
=
-
4
α
1
σ
2
+
2
α
1
2
,
…
,
-
4
α
k
σ
2
+
2
α
k
2
,
…
,
-
4
α
N
σ
2
+
2
α
N
2
T
;
(b)
use the revised Newton method and obtainα
=
α
+
μ
d;
(c)
projectα back into the feasible set α: α
=
α
-
A
T
(
A
A
T
)
-
1
(
A
α
-
y
);
(3)
setα
j
=
α;
(iii)
final answer isα
=
α
^
J.Now let us explain the choosing of some parameters.α
^
0
=
A
H
(
A
A
H
)
-
1
y is the minimum l
2 norm solution. In [19] σ
1 is chosen as σ
1
>
4
ma
x
i
α
^
0
(
i
), exp
⁡
(
-
α
^
0
(
i
)
2
/
2
σ
1
2
)
>
0.96
≈
1. In this paper, when we choose f
σ
(
α
)
=
2
e
-
α
2
/
2
σ
2
/
(
e
α
2
/
2
σ
2
+
e
-
α
2
/
2
σ
2
), σ
1 should be chosen as σ
1
>
12
ma
x
i
α
^
0
(
i
). The choice of σ
J is also important. When σ
J
→
0, the norm F
σ
(
α
) approximates to l
0 norm. However, l
0 norm is not suited to express a vector with many small elements. Because, for radar imaging, there are many small scatterers, the choice of σ
J should not be too small. For σ
J, we choose σ
J
=
E
(
max
⁡
(
A
H
(
A
A
H
)
-
1
z
)
), where E expresses expectation. Then σ
J can be estimated by selecting a few noise samples, computing A
T
(
A
A
T
)
-
1
z, selecting the maximum value of A
T
(
A
A
T
)
-
1
z, and taking the average value.


## 3.3. Robust Improvement

In practical application,A
A
H can be in ill condition because its condition number is very large. In our imaging, the condition number is up to 1
0
16. It cannot be convergent if using A
A
H
-
1 directly. The main weighted method can solve the ill condition problem. We add a diagonal matrix γ
I to A
A
H; then (
A
A
H
+
γ
I
)
-
1 can take the place of A
A
H
-
1. If weighted factor γ is too small, the improved effect of ill condition matrix is not obvious. If choosing the larger γ, the convergence speed will slow down, even the solution will be distorted. There is no good way about how to choose the value of γ. A suggested way is to compute the largest eigenvalue λ
max
⁡ of A
A
H and then choose 0.5
λ
max
⁡
×
1
0
-
4
<
γ
<
0.5
λ
max
⁡
×
1
0
-
3.


## 4. Simulation Results

### 4.1. Simulation 1: One-Dimensional Synthetic Signals

In simulation 1, we compare the proposed sparse signal recovery algorithm with OMP, SL0 method, and Bayesian method with Laplace prior. The signal model with noise isy
=
A
α
+
z and the dimension of A is 128
×
256. A is the matrix with Gauss distribution. α is the sparse signal, whose nonzero coefficients are uniform ±
1 random spikes signal. z is Gaussian random vector with standard variance σ. The SNR is defined as 20
lo
g
10
(
1
/
σ
). We consider SNR = 15, 20 dB conditions. For ANSL0 method and SL0 method, the numbers of outer loop and inner loop are 25 and 20, respectively, σ
J
=
E
(
max
⁡
(
A
H
(
A
A
H
)
-
1
z
)
). We choose the step size adjustment μ
=
1.2. The MSE is defined as 1
/
N
α
-
α
^
2, where α is the true solution and α
^ is the estimation value. We assume that if the MSE is less than (
1
/
5
)
2, the positions are estimated correctly. The experiment was then repeated 200 times; the values of MSE and correct position estimation frequencies are averaged. Figure 3 shows the average computational cost for 15 dB SNR case. For other SNR cases, the computational costs are similar to this case and are not shown. From this figure, we can see that OMP and ANSL0 method in this paper are more efficient than smoothed l0 norm based method and Bayesian method.Figure 3
Computation costs of different methods.When there is no noise, the reconstruction probability for different methods with differentK and different number of measurements are shown in Figures 4 and 5. The MSE and reconstruction probability for different methods with different K and different SNR are shown in Figures 6 and 7. We can see that the performance of ANSL0 method is better than other methods.Figure 4
Correct position estimation for differentK.Figure 5
Correct position estimation for different number of measurement.MSE for differentK and SNR: (a) SNR = 15 dB and (b) SNR = 20 dB.
(a)
(b)Correct position estimation frequencies for differentK and SNR: (a) SNR = 15 dB and (b) SNR = 20 dB.
(a)
(b)


### 4.2. Simulation 2: Imaging of Scatterers Located on the Grid Points

In simulation 2 and simulation 3, we consider imaging of a target in two-dimension. The center frequencyf
c
=
15 GHz. We use the random BPSK codes as the transmitting signal and the length of the signal is 150. The bandwidth is 100 MHz. The transmitter M
=
6 and the receiver N
=
6. The distances between transmitters and receivers are 200 m and 33.33 m, respectively. The transmitting and receiving array are located on a line. The distance of the target to the radar is 200 km. We assume that the scatterers are ideal isolated scatterers and located on the grid points. The target contains 19 discrete scatterers. The amplitudes and positions of the original target are shown in Figure 8(a). The SNR of the smallest scatterer is 15 dB. We choose the factor γ
=
200. The numbers of outer loop and inner loop are 25 and 20, respectively, for SL0 and ANSL0. Images using OMP, SL0, Bayesian, and ANSL0 are shown in Figures 8(b), 8(c), 8(d), and 8(e). We can see that the performance of OMP is poor. ANSL0 and Bayesian are more superior than SL0.(a) Original image of the target, (b) reconstructed image of OMP, (c) reconstructed image of Bayesian method with Laplace prior, (d) reconstructed image of SL0, and (e) reconstructed image of ANSL0.
(a)
(b)
(c)
(d)
(e)


### 4.3. Simulation 3: Imaging of Scatterers Not Located on the Grid Points

In simulation 3, some scatterers of the target are not on the grid points; then the scenario is a more realistic situation. The parameters of MIMO radar are the same as simulation 2. The target consists of 9 scatterers. The distance from the target to the radar is 200 km. The relative positions of the scatterers are (1, 1), (0.5, 5), (1.5, 7), (5.5, 4.5), (5, 6.5), (5.5, 3), (9, 1.25), (9.25, 5), and (9.25, 8.25) (m, m). The sampling distance of grid points in two dimensions is all 1 m.γ
=
200 is chosen as the factor. The SNR is 15 dB. The contour plots of the reconstructed images using different methods are shown in Figure 9. One can see that ANSL0 has better reconstruction performance than other methods.Contour plot of reconstructed images using (a) OMP, (b) Bayesian method with Laplace prior, (c) SL0, and (d) ANSL0.
(a)
(b)
(c)
(d)


### 4.4. Simulation 4: Robustness of the Proposed Method

In the simulation 4, the parameters of MIMO radar are the same as simulation 2.There are three target scatterers in the imaging region. The distance from the target to the radar is 150 km. Three target scatterers locate at (14, 11), (13, 14.2), (16, 11.2) (m, m).The targets locate at close range. The complex amplitudes are 0.2, 0.5, and 0.9, respectively.γ
=
100 is chosen as the factor. Assume α
^ and α are the estimation value and real value of MIMO radar in the image region, so the root mean square error (RMSE) can be expressed as RMSE
=
α
^
-
α
2. The experiment was repeated 200 times. The mesh plots of the reconstructed images using different methods when the SNR is 15 dB are shown in Figure 10. The RMSE of images versus SNR are shown in Figure 11. It can be seen from Figure 11 that the ANSL0 method has low RMSE for the reconstructed images.(a) Original image of the targets, (b) reconstructed image of OMP, (c) reconstructed image of Bayesian method with Laplace prior, (d) reconstructed image of SL0, and (e) reconstructed image of ANSL0.
(a)
(b)
(c)
(d)
(e)Figure 11
RMSE of images versus SNR.


## 4.1. Simulation 1: One-Dimensional Synthetic Signals

In simulation 1, we compare the proposed sparse signal recovery algorithm with OMP, SL0 method, and Bayesian method with Laplace prior. The signal model with noise isy
=
A
α
+
z and the dimension of A is 128
×
256. A is the matrix with Gauss distribution. α is the sparse signal, whose nonzero coefficients are uniform ±
1 random spikes signal. z is Gaussian random vector with standard variance σ. The SNR is defined as 20
lo
g
10
(
1
/
σ
). We consider SNR = 15, 20 dB conditions. For ANSL0 method and SL0 method, the numbers of outer loop and inner loop are 25 and 20, respectively, σ
J
=
E
(
max
⁡
(
A
H
(
A
A
H
)
-
1
z
)
). We choose the step size adjustment μ
=
1.2. The MSE is defined as 1
/
N
α
-
α
^
2, where α is the true solution and α
^ is the estimation value. We assume that if the MSE is less than (
1
/
5
)
2, the positions are estimated correctly. The experiment was then repeated 200 times; the values of MSE and correct position estimation frequencies are averaged. Figure 3 shows the average computational cost for 15 dB SNR case. For other SNR cases, the computational costs are similar to this case and are not shown. From this figure, we can see that OMP and ANSL0 method in this paper are more efficient than smoothed l0 norm based method and Bayesian method.Figure 3
Computation costs of different methods.When there is no noise, the reconstruction probability for different methods with differentK and different number of measurements are shown in Figures 4 and 5. The MSE and reconstruction probability for different methods with different K and different SNR are shown in Figures 6 and 7. We can see that the performance of ANSL0 method is better than other methods.Figure 4
Correct position estimation for differentK.Figure 5
Correct position estimation for different number of measurement.MSE for differentK and SNR: (a) SNR = 15 dB and (b) SNR = 20 dB.
(a)
(b)Correct position estimation frequencies for differentK and SNR: (a) SNR = 15 dB and (b) SNR = 20 dB.
(a)
(b)


## 4.2. Simulation 2: Imaging of Scatterers Located on the Grid Points

In simulation 2 and simulation 3, we consider imaging of a target in two-dimension. The center frequencyf
c
=
15 GHz. We use the random BPSK codes as the transmitting signal and the length of the signal is 150. The bandwidth is 100 MHz. The transmitter M
=
6 and the receiver N
=
6. The distances between transmitters and receivers are 200 m and 33.33 m, respectively. The transmitting and receiving array are located on a line. The distance of the target to the radar is 200 km. We assume that the scatterers are ideal isolated scatterers and located on the grid points. The target contains 19 discrete scatterers. The amplitudes and positions of the original target are shown in Figure 8(a). The SNR of the smallest scatterer is 15 dB. We choose the factor γ
=
200. The numbers of outer loop and inner loop are 25 and 20, respectively, for SL0 and ANSL0. Images using OMP, SL0, Bayesian, and ANSL0 are shown in Figures 8(b), 8(c), 8(d), and 8(e). We can see that the performance of OMP is poor. ANSL0 and Bayesian are more superior than SL0.(a) Original image of the target, (b) reconstructed image of OMP, (c) reconstructed image of Bayesian method with Laplace prior, (d) reconstructed image of SL0, and (e) reconstructed image of ANSL0.
(a)
(b)
(c)
(d)
(e)


## 4.3. Simulation 3: Imaging of Scatterers Not Located on the Grid Points

In simulation 3, some scatterers of the target are not on the grid points; then the scenario is a more realistic situation. The parameters of MIMO radar are the same as simulation 2. The target consists of 9 scatterers. The distance from the target to the radar is 200 km. The relative positions of the scatterers are (1, 1), (0.5, 5), (1.5, 7), (5.5, 4.5), (5, 6.5), (5.5, 3), (9, 1.25), (9.25, 5), and (9.25, 8.25) (m, m). The sampling distance of grid points in two dimensions is all 1 m.γ
=
200 is chosen as the factor. The SNR is 15 dB. The contour plots of the reconstructed images using different methods are shown in Figure 9. One can see that ANSL0 has better reconstruction performance than other methods.Contour plot of reconstructed images using (a) OMP, (b) Bayesian method with Laplace prior, (c) SL0, and (d) ANSL0.
(a)
(b)
(c)
(d)


## 4.4. Simulation 4: Robustness of the Proposed Method

In the simulation 4, the parameters of MIMO radar are the same as simulation 2.There are three target scatterers in the imaging region. The distance from the target to the radar is 150 km. Three target scatterers locate at (14, 11), (13, 14.2), (16, 11.2) (m, m).The targets locate at close range. The complex amplitudes are 0.2, 0.5, and 0.9, respectively.γ
=
100 is chosen as the factor. Assume α
^ and α are the estimation value and real value of MIMO radar in the image region, so the root mean square error (RMSE) can be expressed as RMSE
=
α
^
-
α
2. The experiment was repeated 200 times. The mesh plots of the reconstructed images using different methods when the SNR is 15 dB are shown in Figure 10. The RMSE of images versus SNR are shown in Figure 11. It can be seen from Figure 11 that the ANSL0 method has low RMSE for the reconstructed images.(a) Original image of the targets, (b) reconstructed image of OMP, (c) reconstructed image of Bayesian method with Laplace prior, (d) reconstructed image of SL0, and (e) reconstructed image of ANSL0.
(a)
(b)
(c)
(d)
(e)Figure 11
RMSE of images versus SNR.


## 5. Conclusion

Sparse learning reconstruction algorithm can improve the image quality of a target including scatterers discrete distribution. We propose one new approximate hyperbolic tangent function and use revised Newton method to reconstruct MIMO radar imaging algorithm. In practical imaging, the coefficient matrix may be ill conditioned. By using the main value weighted method in this paper, the robustness of this algorithm is strengthened consumedly compared with the traditional algorithm described in [19]. Simulation results show that the ANSL0 method can improve the image quality of a target.



---

*Source: 841986-2015-02-03.xml*