2022
DOI: 10.1109/lgrs.2022.3191394
|View full text |Cite
|
Sign up to set email alerts
|

Gridless Sparse ISAR Imaging via 2-D Fast Reweighted Atomic Norm Minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…However, this approach has cubic complexity order of the matrix Q, here O(M 3 P 3 N 3 r ), which becomes infeasible for large signal dimensions. In this case, one may employ low-complexity approaches that have been proposed for ANM-based recovery such as reweighting the continuous dictionary [43], accelerating proximal gradient [44], or employing prior knowledge to apply block iterative 1 minimization [45]. In our recent work [10], we solved the 1-D DBD via a low-rank matrix Hankel recovery approach but this technique remains unexamined for multiple variables.…”
Section: Recovery Via Soman Minimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, this approach has cubic complexity order of the matrix Q, here O(M 3 P 3 N 3 r ), which becomes infeasible for large signal dimensions. In this case, one may employ low-complexity approaches that have been proposed for ANM-based recovery such as reweighting the continuous dictionary [43], accelerating proximal gradient [44], or employing prior knowledge to apply block iterative 1 minimization [45]. In our recent work [10], we solved the 1-D DBD via a low-rank matrix Hankel recovery approach but this technique remains unexamined for multiple variables.…”
Section: Recovery Via Soman Minimizationmentioning
confidence: 99%
“…Proof: Note that f r (r) = Q r w r (r) and f c (c) = Q c w c (c). Using the radar LMI in (43) and Schur complement, we get…”
Section: B Performance Analysesmentioning
confidence: 99%
“…In contrast, decoupled ANM (DANM) [18] mitigates computational complexity by constructing matrix-form atomic norm and decoupling 2D information into two independent dimensions. Based on the DANM algorithm, recent researches focus on the case of multiple snapshots [19], and further complexity reduction [20,21]. Nevertheless, all aforementioned methods based on matrix-form atomic norm are limited to signals received from complete uniform rectangular arrays (URA).…”
mentioning
confidence: 99%