2020
DOI: 10.1109/tgrs.2020.2972060
|View full text |Cite
|
Sign up to set email alerts
|

A Clutter Suppression Method Based on NSS-RPCA in Heterogeneous Environments for SAR-GMTI

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 29 publications
0
8
0
Order By: Relevance
“…With the development of the low-rank sparse decomposition (LRSD) algorithm, robust principal component analysis (RPCA) has been used in SAR signals for various applications, such as clutter suppression and moving target detection by separating moving and stationary targets in SAR images [35][36][37][38][39]. In recent years, the theory of LRSD has been successfully applied to mitigate RFI in SAR data.…”
Section: Semi-parametric Methodsmentioning
confidence: 99%
“…With the development of the low-rank sparse decomposition (LRSD) algorithm, robust principal component analysis (RPCA) has been used in SAR signals for various applications, such as clutter suppression and moving target detection by separating moving and stationary targets in SAR images [35][36][37][38][39]. In recent years, the theory of LRSD has been successfully applied to mitigate RFI in SAR data.…”
Section: Semi-parametric Methodsmentioning
confidence: 99%
“…In Equation (18), boldY $\mathbf{Y}$ and boldX $\mathbf{X}$ denote the Lagrange multiplier, F ${{\Vert}\bullet {\Vert}}_{\mathrm{F}}$ is the Frobenius norm, μ $\mu $ and ζ $\zeta $ are the penalty factor, and boldX,boldY=.25emtrace()boldXHY $\langle \mathbf{X},\mathbf{Y}\rangle =\hspace*{.5em}\text{trace}\left({\mathbf{X}}^{H}\mathbf{Y}\right)$ represents the inner product of the two matrices. Optimization problem Equation (17) can be solved by using ADMM algorithm [29]. Then, Equation (17) can be transformed into five subproblems as follow {boldRk+1:=argminLYk,Xk,boldR,Jk,Tk,α,μ,ζboldRboldTk+1:=argminLYk,Rk,Jk,boldT,λ,μboldT1emupdata0.25emboldCboldJ,boldUboldJ0.25emand0.25emboldRboldJboldJk+1:=argminL…”
Section: Moving Target Detection Methods Based On Cur‐rpcamentioning
confidence: 99%
“…represents the inner product of the two matrices. Optimization problem Equation ( 17) can be solved by using ADMM algorithm [29]. Then, Equation ( 17) can be transformed into five subproblems as follow…”
Section: Solving the Proposed Optimization Problemmentioning
confidence: 99%
“…Airborne radar plays an important role in detecting aircraft, ships, and vehicles at long ranges [1]. However, due to the platform motion, slowly moving targets are easily masked by strong clutter; hence, clutter suppression is a challenging problem for airborne radar to overcome [2,3]. Traditional typical clutter suppression methods include displaced phase center antenna (DPCA) [4] and along-track interferometry (ATI) [5].…”
Section: Introductionmentioning
confidence: 99%