# A Novel Downward-Looking Linear Array SAR Imaging Method Based on Multiple Measurement Vector Model withL2,1-Norm

Authors: Le Kang; Tian-chi Sun; Jia-cheng Ni; Qun Zhang; Ying Luo
Journal: Journal of Sensors
 (2021)

---

## Abstract

Downward-looking linear array synthetic aperture radar (DLLA SAR) is a kind of three-dimensional (3-D) radar imaging system. To obtain the superresolution along the crosstrack direction of DLLA SAR, the sparse regularization models with single measurement vector (SMV) have been widely applied. However, the robustness of the sparse regularization models with SMV is unsatisfactory, especially in the low signal-to-noise rate (SNR) environment. To solve this problem, we proposed a novel imaging method for DLLA SAR based on the multiple measurement vector (MMV) model withL2,1-norm. At first, we exchange the processing order between the along-track (AT) domain and the crosstrack (CT) domain to keep the same sparse structure of the signal in the crosstrack domain so that we can establish the imaging problem as a sparse regularization model based on the MMV model. Moreover, the mixed L2,1-norm is introduced into the regularization term of the MMV model. Finally, the modified orthogonal matching pursuit (OMP) algorithm is designed for the MMV model with the L2,1-norm. The simulations verify that the proposed method has better performance in the lower SNR environment and requires lower computation compared with the conventional methods.


---

## Body

## 1. Introduction

Synthetic aperture radar (SAR) has been widely applied in the field of remote sensing to obtain radar images without being affected by weather, daylight, or cloud coverage [1, 2]. Over the past decades, three-dimensional (3-D) SAR has been a development trend of SAR since it can generate 3-D radar images, which can provide more information for remote sensing. The typical 3-D SAR systems include circular SAR (CSAR) [3], tomographic SAR (TomoSAR) [4], and array SAR [5]. Downward-looking linear array (DLLA) SAR generates 3-D radar images by using a linear array along the wings to illuminate the overflown scene [6, 7]. By modifying the traditional SAR imaging algorithms, 3-D imaging algorithms for DLLA SAR based on range-Doppler (RD) [8], chirp scaling [9], and polar formatting [10] are proposed. For these imaging algorithms, the resolutions in range, along-track (AT), and crosstrack (CT) directions are obtained by pulse compression, synthetic aperture, and beam-forming, respectively. As a result, the CT resolution is mainly determined by the length of the linear array along the CT direction, which leads to poor resolution in the CT direction since the length of the linear array is limited by the platform.In the compressed sensing (CS) theory, the sparse signals can be exactly recovered with a high probability from the low-dimensional measurement signal [11, 12]. Since the scatters in the imaging scene are generally sparse in the 3-D space, the sparsity of DLLA SAR echo holds in the spatial domain. As a result, CS are introduced to CT compression of DLLA SAR in recent years [13–21]. In [13], the signal processing in the CT domain is transformed into the sparse reconstruction with L0 regularization from noisy measurements. Considering the nonuniform linear array, the CS method based on truncated singular value decomposition (SVD) is introduced to the processing of the CT domain to achieve superresolution [14]. For the airborne DLLA SAR with a sparse linear array, an L1-norm-based DLLA SAR imaging method is proposed by combining the polar formatting. To solve the matrix mismatch problem, the processing in the CT domain is transformed into the atomic-norm-based CS reconstruction [16–19]. However, the CT compression of the above methods is realized by the single measurement vector (SMV) model. Although these SMV-based methods can achieve better resolution and lower sidelobes in the CT domain, the robustness of the sparse regularization models with the SMV model is unsatisfactory, especially in the low signal-to-noise rate (SNR) environment [12]. Compared with the classical single measurement vector (SMV) model, the multiple measurement vector (MMV) model in CS theory has stronger antinoise performance and lower computation complexity by utilizing the same sparse structures of multiple measurement signals [20]. The MMV model has been successfully introduced into 2-D SAR imaging since the sparse structures of different pulses are the same in SAR measurements [21, 22]. The different pulses in SAR are equal to the different AT sampling points in DLLA SAR, so the MMV model has been directly utilized in the AT domain [23]. However, the CT sparse structures of different pulses are different so that the MMV model cannot be directly utilized in the CT domain.In this paper, a novel imaging method for DLLA 3D SAR based on the MMV model and a mixed matrix norm is proposed. At first, we construct the same CT sparse structure of different pulses by exchanging the processing sequence of CT and AT domain so that the imaging problem can be regarded as a sparse regularization model based on the MMV model. Moreover, the mixedL2,1-norm is introduced into the regularization term of the MMV model. Finally, the proposed imaging model is solved by the modified MMV orthogonal matching pursuit (MMV-OMP) algorithm. The proposed method can obtain the CT superresolution in the lower SNR environment and require lower computation compared with the conventional methods, which is verified by simulation experiments.


## 2. Reviews of the SMV Model and MMV Model

In CS theory, the signals∈ℂQ is sparse if the sparse level K, the number of the nonzero values in s, is much less than Q. For a downsampling matrix Φ∈ℂN×Q,N<Q, the low-dimensional measurement vector of s can be written as y=Φs,y∈ℂN×1. The sparse representation of s can be written as s=Ψx, where x is sparse and Ψ is the sparse basis matrix. (When s is sparse, the sparse basis matrix Ψ is the unit matrix.) If the measurement matrix A=ΦΨ satisfies the Restricted Incoherence Property (RIP), the problem, which is to solve the sparse signal x on the condition that the y and A are known, can be transformed as the 1-norm minimization [11]:
(1)minx1s.t.y−Ax<ε,where ⋅1 is the 1-norm operator and ε is a value related to the noise.When the signaly is a vector, y is called the single measurement signal, and the model in Equation (1) is called the SMV model. The SMV model can be solved by many CS reconstruction algorithms. Here, we briefly introduce the OMP algorithm [24] in Algorithm 1, where T is the matrix transposition, k is the kth iteration, ⋅1 is the l1-norm, the support set Ω is the index set of nonzero values, and AΩ is formed by the columns of A with the index in Ω.Algorithm 1: SMV-OMP algorithm.
Input: vector y, matrix A, threshold ε;Initialization: residue error vector r0=y; support set Ω0=∅; sparse vector x0=0, iterative number k=1;Whilerk−11>εStep 1: Find the new support: ηk=argmaxi=1,2,⋯,QAiTrk−11;Step 2: Update the support set: Ωk=Ωk−1∪ηk;Step 3: Update the sparse vector xk=AΩ0HAΩ0−1AΩ0Hrk−1;Step 4: Update the residue error rk=y−AΩ0xk, k=k+1;Output: sparse vector xkForL single measurement signals y1,y2,⋯,yL with the same measurement matrix A, the SMV model in Equation (1) has to be solved L times to obtain the corresponding sparse signals x1,x2,⋯,xL. However, if the sparse structures of x1,x2,⋯,xL are the same, which means that the positions of the nonzero values in x1,x2,⋯,xL are the same, the MMV model can be expressed as [20]
(2)minX1s.t.Y−AX<ε,where Y=y1,y2,⋯,yL and X=x1,x2,⋯,xL. In the MMV model, X can be obtained by solving Equation (2) only once, so that the MMV model has lower complexity and better antinoise performance compared with the SMV model.


## 3. SMV-Based DLLA SAR Imaging Procedure

The geometry of DLLA SAR is shown in Figure1. The radar platform flies along the X-axis. The velocity is v, and the height is H. N antenna elements are distributed under the wings, and the interval space between every two elements is d. The length of the linear array is Ly=N−1d. O is the imaging center. The position of the nth antenna element of the linear array is xm,yn,H in the coordinate system.Figure 1
Geometry of DLLA 3-D SAR. The radar platform flies along theX-axis with velocity v at height H. The linear array contains N antenna elements equally spaced with the distance d, which is distributed along the crosstrack direction.Suppose that the antenna elements transmit the linear frequency modulation (LFM) signal, the echo signal of thenth antenna element can be represented as
(3)St,tm,yn=∑Kσkrectt−2Rtm,yn/cTrexpjπKrt−2Rtm,ync2−j4πλRtm,yn,where t denotes the fast time, tm denotes the slow-time, rect⋅ is the unit rectangular function, σk is the scattering coefficient of the kth scattering point, c is the light speed, Kr is the chirp rate, λ is the wavelength, Tr is the pulse width, e is the noise, and Rtm,yn is the instantaneous distance between the nth antenna element and the point scatterer Pkxk,yk,zk at the slow time tm, which can be written as
(4)Rtm,yn=vtm−xk2+yn−yk2+H−zk2≈R0+vtm−xk22R0+yn2−2ynyk2R0,where R0=xk2+yk2+H−zk2.The imaging procedure of SMV-based DLLA SAR is shown in Figure2, which contains three steps: range compression, AT compression, and CT compression. At first, the echo signal of Equation (3) is discretized into a 3-D matrix, where Nr, M, and N are the sampling numbers in the range (fast time) domain, AT (slow time) domain, and CT domain, respectively.Figure 2
Imaging procedure of SMV-based DLLA 3-D SAR.The range compression is realized by range-matched filtering and range migration correction. After the range compression, the 3-D signal has been focused in the range domain and can be regarded asNr range slices. Then, the AT compression is realized by the AT matched filtering for each range slice of the 3-D signal. After the AT compression, the signal of each range slice has been focused on the AT domain. In the cross-along-track plane, each line represents the signal vector with the same positions in the range and AT directions. The black lines of the cross-along-track plane mean that the scattering points exist in the corresponding positions in the range and AT directions.For each line in the cross-along-track plane, the length of the original vector is the CT sampling numberN. To obtain the CT superresolution, the imaging scene is discretized by QQ>N grids in the CT directions. The signal processing of each line in the cross-along-track plane is transformed into an SMV model, in which the original signal of each line is regarded as the measurement signal y and each line after the CT compression is regarded as the sparse signal x. After the CT compression, the sparse structures of the lines in the cross-along-track plane are different because they are determined by the positions of the scattering points. As a result, the condition of the MMV model is not satisfied so that the M lines in each range slice have to be solved by the SMV model independently.


### 3.1. Proposed DLLA SAR Imaging Method

Since only a few scatterers are presented in the same range cell, the sparsity of the echo signal is satisfied for DLLA SAR imaging. To introduce the MMV model into the CT domain of DLLA SAR, we exchange the processing sequence of the CT compression and the AT compression to construct the same sparse structure after the CT compression. The proposed imaging procedure of MMV-based DLLA SAR is shown in Figure3, which contains range compression, CT compression, and AT compression.Figure 3
Imaging procedure of MMV-based DLLA 3-D SAR.


### 3.2. Range Compression

The range compression of the proposed method is the same as that of the traditional methods. The details of the range compression in DLLA SAR can be found in [25]. Firstly, the echo signal should multiply by the range-matched filter function and the range migration correction functions in the frequency domain. Then, the signal in the frequency domain should be transformed back into the time domain and it can be written as
(5)Srt,tm,yn=∑KσksincBrt−2R0cexp−j4πλR0+vtm−xk22R0+yn2−2ynyk2R0,where Br=TrKr is the range bandwidth and R0 and yn can be obtained before imaging because the imaging geometry is known. As a result, the signal after compensating the phase term only related with R0 and yn is [25]
(6)Srt,tm,yn=∑KσksincBrt−2R0cexp−j2πvtm−xk2λR0exp−j4πynykλR0.


### 3.3. Crosstrack Compression by the MMV Model withL2,1-Norm

After range compression, each measurement vector is a line along the CT direction so that each range slice containsM measurement vectors. Since the CT compression is before the AT compression, the signal of a range slice focuses in several lines along the AT direction, which means that the M measurement vectors after CT compression have the same sparse structure. As a result, the MMV model can be introduced into the CT compression.The imaging scene is discretized as equal gridsy^=y∧1;⋯;y∧NΤ∈ℂN×1 along the CT direction. The measurement signal of the mth pulse can be expressed as sm=stm,y1;⋯;stm,yNΤ∈ℂN×1. Suppose the corresponding focused signal after crosstrack compression is gm=g1tm;⋯;gNtmΤ∈ℂN×1. Therefore, the echo signal of all CT sampling points at slow-time tm can be written as
(7)sm=φ1,φ2,⋯,φNg1tm,g2tm,⋯,gNtmΤ=Ψgm,m=1,2,⋯M,where Ψ=φ1,φ2,⋯,φN is the sparse basis matrix. The nth column of the sparse basis matrix Ψ can be expressed as
(8)φn=exp−j4πλR0y1y∧n,exp−j4πλR0y2y∧n,⋯,exp−j4πλR0yNy∧nΤ.Suppose that the downsampling matrix isΦm∈ℝN′×N, which is formed by the random N′ columns of an N-by-N identity matrix. Thus, the matrix form of the downsampled signal is
(9)sm′=Agm,where m=1,2,⋯M,A=ΦmΨ. The sample rate (SR) is defined as N′/N.The model in Equation (9) is an SMV model, in which the sparse vector gm can be solved by the OMP algorithm. For the linear array, the CT compression of each signal of any antenna element needs to solve an SMV model. As a result, we should solve M SMV models to get the crosstrack recovery signal of one range slice. Assuming the range sampling number is Nr, the number of SMV recovery times is M⋅Nr to obtain the 3-D imaging result. Since the CS reconstruction algorithm is much more complex than the matched filtering, the SMV-based DLLA SAR imaging methods generally have high computational complexity.For the MMV model, each measurement vector should have the same sparse structure. As shown in Figure2, this condition cannot be satisfied if the echo signal is handled in the AT domain before the CT domain, because the CT-focused results are points in each range slice, which means the sparse structures are different in different AT measurement vectors. However, as shown in Figure 3, the CT compression is before the AT compression in the proposed imaging flow process. Meanwhile, after range compression and CT compression, the focused results G=g1,⋯,gL∈ℂN×L,1≤L≤M are lines that are perpendicular to the AT direction in each range slice, which keeps that the multiple measurement vectors S=s1,⋯,sL∈ℂN×L share the same sparse structure. Since the downsampling matrix Φm∈ℝN′×N is fixed, it is the same for s1,⋯,sL. As a result, we can express the downsampling matrix Φm as Φ for m=1,2,⋯,L. The downsampling signal can be denoted as Ξ=ΦS. As a result, the G=g1,⋯,gL can be obtained by solving the following MMV model:
(10)Ξ=ΦS=ΦΨG=AG.Then, the CT compression needs to solve the MMV modelM/L times. The optimization problem of (10) can be described as
(11)G^=minGFGs.t.Ξ−AGF2<ε,where ⋅F is the Frobenius norm, ε is a constant value related with noise, and FG is the regularization term related to the prior distribution of G. To obtain better robustness, we introduced a mixed L2,1-norm for matrices to calculate the sparsity of G. The mixed L2,1-norm for G can be expressed as
(12)G2,1=G12G22⋮GQ21=∑i=1Q∑j=1Lgij2,where Gi denote the ith row of G, ⋅2 denotes the l2-norm for vectors, and gij is the element of G at the ith row and jth column. In Equation (12), the l2-norms of the rows in G are calculated firstly to form a column vector, and then, the l1-norm of the formed column vector is calculated as the mixed L2,1-norm of G. Then, Equation (11) can be expressed as
(13)G^=minGG2,1s.t.Ξ−AGF2<ε.Utilizing the Lagrangian method, Equation (13) can be expressed as a regularization model
(14)G^=argminGJG,JG=Ξ−AGF2+λG2,1,where JG is the objective function and λ is the regularization parameter. According to the regularization theory [25], the regularization parameter can be λ=2β2, where β is the variance of the reconstructed error. To solve Equation (14), the iterative formula of step (3) in Algorithm 1 should be modified. As a result, we derived the gradient of the objective function JG as
(15)∇GJG=2AHAG−2AHΞ+λΛGG,where ΛG=diag1/G12,1/G22,⋯,1/GQ2. The kth iterative formula of G can be expressed as
(16)Gk+1=AHA+λ2ΛGk−1AHΞ.By modifying step (3) in Algorithm1 as (16), the MMV-OMP algorithm based on the L2,1-norm is shown in Algorithm 2.Algorithm 2: MMV-OMP algorithm based on the L2,1-norm.
Input: matrix Ξ, matrix A, threshold ε;Initialization: residue error matrix R0=Ξ, support set Ω0=∅, sparse matrix G0=0, iterative number k=1;WhileRk−12,1>εStep 1: Find the new support: ηk=argmaxi=1,2,⋯,QAiTRk−12,1;Step 2: Update the support set: Ωk=Ωk−1∪ηk;Step 3: Update the sparse matrix Gk=AΩkHAΩk+λ/2ΛGk−1−1AΩkHRk−1;Step 4: Update the residue error Rk=Ξ−AΩkRk−1, k=k+1;Output: sparse vector GkAs shown in Figure3, the signal after CT compression can be written as
(17)Sct,tm,yq=∑i=1KsincBrt−2R0cςyqexp−j2πλvtm−xk2R0exp−j4πλR0,where ςyq is the result of CT compression.


### 3.4. Along-Track Compression

Finally, the AT compression is the same as that of the traditional methods. It is realized by the matched filtering in the AT domain, and the detailed information can be obtained in [13, 25]. The 3-D imaging result is
(18)Sfinalt,tm,yq=∑k=1KsincTrKrt−2R0cςyqsincBavtm−xkexp−j4πλR0,where Ba is the AT bandwidth.


## 3.1. Proposed DLLA SAR Imaging Method

Since only a few scatterers are presented in the same range cell, the sparsity of the echo signal is satisfied for DLLA SAR imaging. To introduce the MMV model into the CT domain of DLLA SAR, we exchange the processing sequence of the CT compression and the AT compression to construct the same sparse structure after the CT compression. The proposed imaging procedure of MMV-based DLLA SAR is shown in Figure3, which contains range compression, CT compression, and AT compression.Figure 3
Imaging procedure of MMV-based DLLA 3-D SAR.


## 3.2. Range Compression

The range compression of the proposed method is the same as that of the traditional methods. The details of the range compression in DLLA SAR can be found in [25]. Firstly, the echo signal should multiply by the range-matched filter function and the range migration correction functions in the frequency domain. Then, the signal in the frequency domain should be transformed back into the time domain and it can be written as
(5)Srt,tm,yn=∑KσksincBrt−2R0cexp−j4πλR0+vtm−xk22R0+yn2−2ynyk2R0,where Br=TrKr is the range bandwidth and R0 and yn can be obtained before imaging because the imaging geometry is known. As a result, the signal after compensating the phase term only related with R0 and yn is [25]
(6)Srt,tm,yn=∑KσksincBrt−2R0cexp−j2πvtm−xk2λR0exp−j4πynykλR0.


## 3.3. Crosstrack Compression by the MMV Model withL2,1-Norm

After range compression, each measurement vector is a line along the CT direction so that each range slice containsM measurement vectors. Since the CT compression is before the AT compression, the signal of a range slice focuses in several lines along the AT direction, which means that the M measurement vectors after CT compression have the same sparse structure. As a result, the MMV model can be introduced into the CT compression.The imaging scene is discretized as equal gridsy^=y∧1;⋯;y∧NΤ∈ℂN×1 along the CT direction. The measurement signal of the mth pulse can be expressed as sm=stm,y1;⋯;stm,yNΤ∈ℂN×1. Suppose the corresponding focused signal after crosstrack compression is gm=g1tm;⋯;gNtmΤ∈ℂN×1. Therefore, the echo signal of all CT sampling points at slow-time tm can be written as
(7)sm=φ1,φ2,⋯,φNg1tm,g2tm,⋯,gNtmΤ=Ψgm,m=1,2,⋯M,where Ψ=φ1,φ2,⋯,φN is the sparse basis matrix. The nth column of the sparse basis matrix Ψ can be expressed as
(8)φn=exp−j4πλR0y1y∧n,exp−j4πλR0y2y∧n,⋯,exp−j4πλR0yNy∧nΤ.Suppose that the downsampling matrix isΦm∈ℝN′×N, which is formed by the random N′ columns of an N-by-N identity matrix. Thus, the matrix form of the downsampled signal is
(9)sm′=Agm,where m=1,2,⋯M,A=ΦmΨ. The sample rate (SR) is defined as N′/N.The model in Equation (9) is an SMV model, in which the sparse vector gm can be solved by the OMP algorithm. For the linear array, the CT compression of each signal of any antenna element needs to solve an SMV model. As a result, we should solve M SMV models to get the crosstrack recovery signal of one range slice. Assuming the range sampling number is Nr, the number of SMV recovery times is M⋅Nr to obtain the 3-D imaging result. Since the CS reconstruction algorithm is much more complex than the matched filtering, the SMV-based DLLA SAR imaging methods generally have high computational complexity.For the MMV model, each measurement vector should have the same sparse structure. As shown in Figure2, this condition cannot be satisfied if the echo signal is handled in the AT domain before the CT domain, because the CT-focused results are points in each range slice, which means the sparse structures are different in different AT measurement vectors. However, as shown in Figure 3, the CT compression is before the AT compression in the proposed imaging flow process. Meanwhile, after range compression and CT compression, the focused results G=g1,⋯,gL∈ℂN×L,1≤L≤M are lines that are perpendicular to the AT direction in each range slice, which keeps that the multiple measurement vectors S=s1,⋯,sL∈ℂN×L share the same sparse structure. Since the downsampling matrix Φm∈ℝN′×N is fixed, it is the same for s1,⋯,sL. As a result, we can express the downsampling matrix Φm as Φ for m=1,2,⋯,L. The downsampling signal can be denoted as Ξ=ΦS. As a result, the G=g1,⋯,gL can be obtained by solving the following MMV model:
(10)Ξ=ΦS=ΦΨG=AG.Then, the CT compression needs to solve the MMV modelM/L times. The optimization problem of (10) can be described as
(11)G^=minGFGs.t.Ξ−AGF2<ε,where ⋅F is the Frobenius norm, ε is a constant value related with noise, and FG is the regularization term related to the prior distribution of G. To obtain better robustness, we introduced a mixed L2,1-norm for matrices to calculate the sparsity of G. The mixed L2,1-norm for G can be expressed as
(12)G2,1=G12G22⋮GQ21=∑i=1Q∑j=1Lgij2,where Gi denote the ith row of G, ⋅2 denotes the l2-norm for vectors, and gij is the element of G at the ith row and jth column. In Equation (12), the l2-norms of the rows in G are calculated firstly to form a column vector, and then, the l1-norm of the formed column vector is calculated as the mixed L2,1-norm of G. Then, Equation (11) can be expressed as
(13)G^=minGG2,1s.t.Ξ−AGF2<ε.Utilizing the Lagrangian method, Equation (13) can be expressed as a regularization model
(14)G^=argminGJG,JG=Ξ−AGF2+λG2,1,where JG is the objective function and λ is the regularization parameter. According to the regularization theory [25], the regularization parameter can be λ=2β2, where β is the variance of the reconstructed error. To solve Equation (14), the iterative formula of step (3) in Algorithm 1 should be modified. As a result, we derived the gradient of the objective function JG as
(15)∇GJG=2AHAG−2AHΞ+λΛGG,where ΛG=diag1/G12,1/G22,⋯,1/GQ2. The kth iterative formula of G can be expressed as
(16)Gk+1=AHA+λ2ΛGk−1AHΞ.By modifying step (3) in Algorithm1 as (16), the MMV-OMP algorithm based on the L2,1-norm is shown in Algorithm 2.Algorithm 2: MMV-OMP algorithm based on the L2,1-norm.
Input: matrix Ξ, matrix A, threshold ε;Initialization: residue error matrix R0=Ξ, support set Ω0=∅, sparse matrix G0=0, iterative number k=1;WhileRk−12,1>εStep 1: Find the new support: ηk=argmaxi=1,2,⋯,QAiTRk−12,1;Step 2: Update the support set: Ωk=Ωk−1∪ηk;Step 3: Update the sparse matrix Gk=AΩkHAΩk+λ/2ΛGk−1−1AΩkHRk−1;Step 4: Update the residue error Rk=Ξ−AΩkRk−1, k=k+1;Output: sparse vector GkAs shown in Figure3, the signal after CT compression can be written as
(17)Sct,tm,yq=∑i=1KsincBrt−2R0cςyqexp−j2πλvtm−xk2R0exp−j4πλR0,where ςyq is the result of CT compression.


## 3.4. Along-Track Compression

Finally, the AT compression is the same as that of the traditional methods. It is realized by the matched filtering in the AT domain, and the detailed information can be obtained in [13, 25]. The 3-D imaging result is
(18)Sfinalt,tm,yq=∑k=1KsincTrKrt−2R0cςyqsincBavtm−xkexp−j4πλR0,where Ba is the AT bandwidth.


## 4. Results and Discussion

The simulations of point targets and distributed targets are given to verify the performance of the proposed algorithm. The simulations of point targets and the experiments of distributed targets utilize the same system parameters, which are chosen according to [10, 19, 25] and shown in Table 1.Table 1
System parameters.
Carry frequency37.5 GHzBandwidth300 MHzPulse width4μsHeight of flight1000 mRange sampling number1600AT/CT sampling interval0.01 mAT/CT sampling number256


### 4.1. Reconstruction Performance for Point Targets

At first, we discuss the relationship between the recovery probability, sampling number, and sparsity. We define the condition of one successful reconstruction which is(19)∑i=iNr∑m=1M∑q=1Qσ∧imq−σimq2σimq2<0.1,where σ^imq and σimq are the value of the imaging result and the scattering coefficient of the ith range slice, mth slow time, and the qth CT grid, respectively.In this simulation, the range position and the AT position of the scattering points are 500 m and 10 m, the CT sampling number is from 10 to 128 with interval 2,L is 10, and the CT positions of the scattering points are randomly generated. In the 100 Monte Carlo trials, the recovery probability is equal to the successful reconstruction times. The relation of the recovery probability and the CT sampling number is shown in Figure 4, where (a) is for 5 scattering points and (b) is for 10 scattering points. Compared with the proposed algorithm, recovery probability can achieve successful reconstruction (the recovery probability is close to 1) with a lower sampling number. The reason is as follows: Suppose the recovery probability of one CT vector by Algorithm 1 is p, the recovery probability of L CT vectors by Algorithm 1 is pL. As a result, the expected accurate recovery number of the CT vectors is p⋅L. For Algorithm 2, since the L CT vectors are regarded as a whole to calculate the support set, the recovery probability ofL CT vectors by Algorithm 2 is p⋅L/L=p≥pL, which is higher than that of Algorithm 1. Moreover, the sampling number of successful reconstructions increases with the number of scattering points, which is due to the decrease of the sparsity.Figure 4
The relation of the recovery probability and the CT sampling number. (a) The number of scatters is 5. (b) The number of scatters is 10.
(a)(b)Then, we add the white Gaussian noise into the echo signal. When SNR is -5 dB andL=128, the imaging results of 9 random scattering points by the proposed imaging procedure are shown in Figure 5. Figures 5(a) and 5(b) are the results after MMV-based CT compression and SMV-based CT compression, respectively. Based on Figures 5(a) and 5(b), Figures 5(c) and 5(d) accomplished the AT compression, respectively. The reconstructed scattering points are marked with a blue circle in Figures 5(c) and 5(d). In Figure 5(b), the signal has been involved by the noise so that 3 scattering points are lost in Figure 5(d). However, all scattering points have been successfully reconstructed in Figure 5(c). That is, the MMV model can enhance the antinoise ability.Figure 5
Imaging results of point targets when SNR is -5 dB andL=128: (a) the imaging result after the range compression and MMV-based CT compression; (b) the imaging result after the range compression and SMV-based CT compression; (c) AT compression result of (a); (d) AT compression result of (b).
(a)(b)(c)(d)Then, we discuss the relationship between the recovery probability and the multimeasurement numberL. We calculate the recovery probability when L=1, 4, 16, 64, and 128. The range of SNR is from −15 dB to1 dB, and the step length is 1 dB. The relation of the recovery probability, SNR, and the multimeasurement number is shown in Figure 6. It can be seen that under the same SNR, the smaller the multimeasurement number L is, the lower the recovery probability is.Figure 6
The relation of the recovery probability, SNR, and the multimeasurement number.To verify the superresolution performance of the proposed method, we set 6 scattering points in the same AT cell. Since the Rayleigh resolution in the CT direction is about 1.5 m according to the system parameters, the CT distance between the two points in the middle is 1 m, which is less than the CT Rayleigh resolution. As a result, the CT superresolution is achieved if the two points in the middle can be separated. The imaging results of the 6 scattering points on the range-CT profile are shown in Figure7. Figure 7(a) is obtained by the 3DRD method, in which the CT compression is realized by matched filtering so that the middle two points are overlapped. Figures 7(b) and 7(c) are obtained by the SMV-based imaging method when SNR is -5 dB and 0 dB, respectively. Although the two points in the middle can be separated in Figure 7(c), the scattering points are unfocused in Figure 7(b). As a result, the robustness of the l1−norm-based models is unsatisfactory. Figure 7(d) is obtained by the proposed MMV-based imaging method when SNR is -5 dB and L=128. It can be seen that the scattering points are focused. Moreover, the two points in the middle are separated clearly, which means the proposed method can achieve the CT superresolution in the lower SNR environment.Figure 7
The imaging results of the 6 scattering points on the range-CT plane: (a) 3-D RD method when SNR is -5 dB, (b) SMV-based method when SNR is 0 dB, (c) SMV-based method when SNR is -5 dB, and (d) the proposed MMV-based method when SNR is -5 dB andL=128.
(a)(b)(c)(d)For the SMV-OMP algorithm shown in Algorithm1 and the MMV-OMP algorithm shown in Algorithm 2, the main computational burden includes the internal product calculation in step (1) and the matrix inversion in step (3). The comparison of computational complexity is shown in Algorithm 2. Because the range sampling number and the AT sampling number are Nr and M, the number of the CT vectors to be reconstructed is M⋅Nr. To obtain the imaging results, Algorithm 1 needs to run M⋅Nr times. As a result, step (1) needs to calculate the internal product OKNrMN times, and step (3) needs to calculate the matrix inversion OKNrM times. Since Algorithm 2 can deal with L CT vectors once, it needs to run NrM/L times to obtain the imaging result. As a result, step (1) also needs to calculate the internal product OKNrMN times, but step (3) only needs to calculate the matrix inversion OKNrM/L times, where 1≤L≤M. The sparse level K is positively related to the time cost. The multimeasured vector number L has an important influence on the time cost.


### 4.2. The Experiment of Distributed Targets

In this part, we use an experiment of distributed targets to evaluate the proposed MMV-OMP-based algorithm. The simulated DLLA SAR data of distributed targets need the positions and the coefficients of scatters. The coefficients of scatters are obtained from the SAR image shown in Figure8(b). The AT and CT positions of scatters are obtained from Figure 8(a). The height positions of scatters are obtained from Figure 8(b). Figures 8(a) and 8(b) are for the same region. For the experiment of distributed 3-D targets, the above method to generate the simulated echo signal has been used in [15–19, 25]. According to the parameters in Table 2, the Rayleigh resolution is 1.5 m. So the interval space between scatters is set as 1 m. The scatter number in the simulation is NpNq=400×400. The SNR is -5 dB.Figure 8
3-D simulation scene: (a) DEM; (b) SAR image for the same region.
(a)(b)Table 2
Computation complexity.
SMV-OMPMMV-OMPInternal productOKNrMNOKNrMMatrix inversionOKNrMNOKNrM/LAs shown in Figure9, when SNR is -5 dB and the sampling rate is 25%, the images of the 3-D distributed targets obtained by 3DRD, SMV-OMP, and the proposed MMV-OMP method are shown from top to bottom, respectively. Figures 9(a), 9(b), and 9(c) show the 3-D images, the X-Y plane projection images, and the 3-D images colored by height. The first row of Figure 9 shows the CT compression in 3DRD realized by matched filtering. The CT ambiguity appears when the sampling rate is 25%. It means that the 3DRD method cannot deal with sparse data. In the second row of Figure 9, the CT compression is realized by SMV-OMP, and some scatters are out of focus when the SNR is -5 dB. It means that the robustness of the imaging method based on SMV-OMP is unsatisfactory in the low signal-to-noise rate (SNR) environment. In the third row of Figure 9, the CT compression is realized by the proposed MMV-OMP when L=128, and the imaging results focus much better than those of the SMV-OMP. It means that the proposed method can obtain better performance in the low SNR environment.Figure 9
Images of the 3-D distributed targets obtained by 3DRD, SMV-OMP, and the proposed method from top to bottom when the SNR is -5 dB and the sampling rate is 25%: (a) 3-D reconstructed images; (b)X-Y plane projection images; (c) 3-D reconstructed images colored by height.
(a)(b)(c)To evaluate the imaging results, the relative mean square error (RMSE) of the 3-D imaging results is defined as1/NpNq∑k=1NpNqσ∧k−σk2/σk2. Here, σk and σ^k are the true value according to Figure 8(b) and the reconstructed value of the kth scatter, respectively. The RMSE of the 3-D imaging results in Figure 9(a) is shown in Table 3. The proposed method has a smaller RMSE. Table 3 shows the mean running time of the methods. The proposed method has a shorter running time than the imaging method based on SMV-OMP. As a result, the experiment of distributed targets can indicate that the proposed method has better performance in the lower SNR environment and require lower computation.Table 3
Imaging performance of the distributed targets.
3DRDSMV-OMPProposed methodRelative mean square error0.87340.19050.0847Mean running time (s)6.85 s154.72 s33.24 s


## 4.1. Reconstruction Performance for Point Targets

At first, we discuss the relationship between the recovery probability, sampling number, and sparsity. We define the condition of one successful reconstruction which is(19)∑i=iNr∑m=1M∑q=1Qσ∧imq−σimq2σimq2<0.1,where σ^imq and σimq are the value of the imaging result and the scattering coefficient of the ith range slice, mth slow time, and the qth CT grid, respectively.In this simulation, the range position and the AT position of the scattering points are 500 m and 10 m, the CT sampling number is from 10 to 128 with interval 2,L is 10, and the CT positions of the scattering points are randomly generated. In the 100 Monte Carlo trials, the recovery probability is equal to the successful reconstruction times. The relation of the recovery probability and the CT sampling number is shown in Figure 4, where (a) is for 5 scattering points and (b) is for 10 scattering points. Compared with the proposed algorithm, recovery probability can achieve successful reconstruction (the recovery probability is close to 1) with a lower sampling number. The reason is as follows: Suppose the recovery probability of one CT vector by Algorithm 1 is p, the recovery probability of L CT vectors by Algorithm 1 is pL. As a result, the expected accurate recovery number of the CT vectors is p⋅L. For Algorithm 2, since the L CT vectors are regarded as a whole to calculate the support set, the recovery probability ofL CT vectors by Algorithm 2 is p⋅L/L=p≥pL, which is higher than that of Algorithm 1. Moreover, the sampling number of successful reconstructions increases with the number of scattering points, which is due to the decrease of the sparsity.Figure 4
The relation of the recovery probability and the CT sampling number. (a) The number of scatters is 5. (b) The number of scatters is 10.
(a)(b)Then, we add the white Gaussian noise into the echo signal. When SNR is -5 dB andL=128, the imaging results of 9 random scattering points by the proposed imaging procedure are shown in Figure 5. Figures 5(a) and 5(b) are the results after MMV-based CT compression and SMV-based CT compression, respectively. Based on Figures 5(a) and 5(b), Figures 5(c) and 5(d) accomplished the AT compression, respectively. The reconstructed scattering points are marked with a blue circle in Figures 5(c) and 5(d). In Figure 5(b), the signal has been involved by the noise so that 3 scattering points are lost in Figure 5(d). However, all scattering points have been successfully reconstructed in Figure 5(c). That is, the MMV model can enhance the antinoise ability.Figure 5
Imaging results of point targets when SNR is -5 dB andL=128: (a) the imaging result after the range compression and MMV-based CT compression; (b) the imaging result after the range compression and SMV-based CT compression; (c) AT compression result of (a); (d) AT compression result of (b).
(a)(b)(c)(d)Then, we discuss the relationship between the recovery probability and the multimeasurement numberL. We calculate the recovery probability when L=1, 4, 16, 64, and 128. The range of SNR is from −15 dB to1 dB, and the step length is 1 dB. The relation of the recovery probability, SNR, and the multimeasurement number is shown in Figure 6. It can be seen that under the same SNR, the smaller the multimeasurement number L is, the lower the recovery probability is.Figure 6
The relation of the recovery probability, SNR, and the multimeasurement number.To verify the superresolution performance of the proposed method, we set 6 scattering points in the same AT cell. Since the Rayleigh resolution in the CT direction is about 1.5 m according to the system parameters, the CT distance between the two points in the middle is 1 m, which is less than the CT Rayleigh resolution. As a result, the CT superresolution is achieved if the two points in the middle can be separated. The imaging results of the 6 scattering points on the range-CT profile are shown in Figure7. Figure 7(a) is obtained by the 3DRD method, in which the CT compression is realized by matched filtering so that the middle two points are overlapped. Figures 7(b) and 7(c) are obtained by the SMV-based imaging method when SNR is -5 dB and 0 dB, respectively. Although the two points in the middle can be separated in Figure 7(c), the scattering points are unfocused in Figure 7(b). As a result, the robustness of the l1−norm-based models is unsatisfactory. Figure 7(d) is obtained by the proposed MMV-based imaging method when SNR is -5 dB and L=128. It can be seen that the scattering points are focused. Moreover, the two points in the middle are separated clearly, which means the proposed method can achieve the CT superresolution in the lower SNR environment.Figure 7
The imaging results of the 6 scattering points on the range-CT plane: (a) 3-D RD method when SNR is -5 dB, (b) SMV-based method when SNR is 0 dB, (c) SMV-based method when SNR is -5 dB, and (d) the proposed MMV-based method when SNR is -5 dB andL=128.
(a)(b)(c)(d)For the SMV-OMP algorithm shown in Algorithm1 and the MMV-OMP algorithm shown in Algorithm 2, the main computational burden includes the internal product calculation in step (1) and the matrix inversion in step (3). The comparison of computational complexity is shown in Algorithm 2. Because the range sampling number and the AT sampling number are Nr and M, the number of the CT vectors to be reconstructed is M⋅Nr. To obtain the imaging results, Algorithm 1 needs to run M⋅Nr times. As a result, step (1) needs to calculate the internal product OKNrMN times, and step (3) needs to calculate the matrix inversion OKNrM times. Since Algorithm 2 can deal with L CT vectors once, it needs to run NrM/L times to obtain the imaging result. As a result, step (1) also needs to calculate the internal product OKNrMN times, but step (3) only needs to calculate the matrix inversion OKNrM/L times, where 1≤L≤M. The sparse level K is positively related to the time cost. The multimeasured vector number L has an important influence on the time cost.


## 4.2. The Experiment of Distributed Targets

In this part, we use an experiment of distributed targets to evaluate the proposed MMV-OMP-based algorithm. The simulated DLLA SAR data of distributed targets need the positions and the coefficients of scatters. The coefficients of scatters are obtained from the SAR image shown in Figure8(b). The AT and CT positions of scatters are obtained from Figure 8(a). The height positions of scatters are obtained from Figure 8(b). Figures 8(a) and 8(b) are for the same region. For the experiment of distributed 3-D targets, the above method to generate the simulated echo signal has been used in [15–19, 25]. According to the parameters in Table 2, the Rayleigh resolution is 1.5 m. So the interval space between scatters is set as 1 m. The scatter number in the simulation is NpNq=400×400. The SNR is -5 dB.Figure 8
3-D simulation scene: (a) DEM; (b) SAR image for the same region.
(a)(b)Table 2
Computation complexity.
SMV-OMPMMV-OMPInternal productOKNrMNOKNrMMatrix inversionOKNrMNOKNrM/LAs shown in Figure9, when SNR is -5 dB and the sampling rate is 25%, the images of the 3-D distributed targets obtained by 3DRD, SMV-OMP, and the proposed MMV-OMP method are shown from top to bottom, respectively. Figures 9(a), 9(b), and 9(c) show the 3-D images, the X-Y plane projection images, and the 3-D images colored by height. The first row of Figure 9 shows the CT compression in 3DRD realized by matched filtering. The CT ambiguity appears when the sampling rate is 25%. It means that the 3DRD method cannot deal with sparse data. In the second row of Figure 9, the CT compression is realized by SMV-OMP, and some scatters are out of focus when the SNR is -5 dB. It means that the robustness of the imaging method based on SMV-OMP is unsatisfactory in the low signal-to-noise rate (SNR) environment. In the third row of Figure 9, the CT compression is realized by the proposed MMV-OMP when L=128, and the imaging results focus much better than those of the SMV-OMP. It means that the proposed method can obtain better performance in the low SNR environment.Figure 9
Images of the 3-D distributed targets obtained by 3DRD, SMV-OMP, and the proposed method from top to bottom when the SNR is -5 dB and the sampling rate is 25%: (a) 3-D reconstructed images; (b)X-Y plane projection images; (c) 3-D reconstructed images colored by height.
(a)(b)(c)To evaluate the imaging results, the relative mean square error (RMSE) of the 3-D imaging results is defined as1/NpNq∑k=1NpNqσ∧k−σk2/σk2. Here, σk and σ^k are the true value according to Figure 8(b) and the reconstructed value of the kth scatter, respectively. The RMSE of the 3-D imaging results in Figure 9(a) is shown in Table 3. The proposed method has a smaller RMSE. Table 3 shows the mean running time of the methods. The proposed method has a shorter running time than the imaging method based on SMV-OMP. As a result, the experiment of distributed targets can indicate that the proposed method has better performance in the lower SNR environment and require lower computation.Table 3
Imaging performance of the distributed targets.
3DRDSMV-OMPProposed methodRelative mean square error0.87340.19050.0847Mean running time (s)6.85 s154.72 s33.24 s


## 5. Conclusions

In this paper, we propose a novel imaging method for DLLA 3D SAR based on the MMV model withL2,1-norm. Specifically, the imaging problem can be transformed into a sparse regularization model based on the MMV model since we construct the same CT sparse structure of different pulses by exchanging the processing sequence of the CT compression and the AT compression. Moreover, the mixed L2,1-norm is introduced into the regularization term of the MMV model and the corresponding MMV-OMP algorithm is designed. The proposed method can obtain the CT superresolution in the lower SNR environment and require lower computation compared with the conventional methods, which is verified by the simulation experiments of point targets and distributed targets.In the MMV model, the original vectors are required to have the same sparse structure. For the crosstrack compression in DLLA SAR, the same sparse structure in each range slice depends on the range migration correction in the crosstrack domain. As a result, the advantages of the proposed algorithm are based on the assumption of accurate range migration correction. It is our future work to solve this problem by combining the range migration correction and MMV model in DLLA SAR.



---

*Source: 3775222-2021-12-14.xml*