Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2010
DOI: 10.1109/tgrs.2010.2051231
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Strategy for Radar Imaging Based on Compressive Sensing

Abstract: This paper aims at introducing the recent theory of compressive sensing to radar imaging systems in order to retrieve the imaged scene with better resolution and a reduced amount of collected samples. As a result of the application of the alternative imaging technique proposed, the use of matched filtering is avoided and the effect of its sidelobes in the images is drastically diminished. Furthermore, the amount of data to be stacked in the sensor and then downlinked to the ground station is meaningfully lower… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
86
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 268 publications
(86 citation statements)
references
References 21 publications
(2 reference statements)
0
86
0
Order By: Relevance
“…It is easy to show from Algorithm 1 that the computational complexity of the proposed method is O (L × M N × N M axiter ). For comparison, the computational complexities for the BP used in most of sparse representation based ISAR [2][8] and SAR [23][24] imaging methods, the BCS used in [6] and the proposed method are summarized in Table I. As demonstrated later, the proposed method converges quickly, N M axiter used in our method is much smaller than L, i.e., N M axiter L. Therefore, the computational complexity of the proposed algorithm can be written as O (L × M N ), and is smaller than that of the BP.…”
Section: B Discussion On the Proposed Imaging Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…It is easy to show from Algorithm 1 that the computational complexity of the proposed method is O (L × M N × N M axiter ). For comparison, the computational complexities for the BP used in most of sparse representation based ISAR [2][8] and SAR [23][24] imaging methods, the BCS used in [6] and the proposed method are summarized in Table I. As demonstrated later, the proposed method converges quickly, N M axiter used in our method is much smaller than L, i.e., N M axiter L. Therefore, the computational complexity of the proposed algorithm can be written as O (L × M N ), and is smaller than that of the BP.…”
Section: B Discussion On the Proposed Imaging Algorithmmentioning
confidence: 99%
“…By exploiting the sparsity of ISAR/SAR images, sparsity based imagery methods are shown to outperform the conventional rangeDoppler algorithm (RDA) [16] in terms of achieving high resolution with fewer measurements. The l 1 -norm based BP is used to obtain a high-resolution image with fewer pulses in ISAR [2][8] and in SAR [23]. Apart from the l 1 -norm regularization, additional constraints and procedures are added for other purposes.…”
Section: Introductionmentioning
confidence: 99%
“…So, the sparsity of echo signal has been discussed for some special applications, such as ocean remote sensing. For the other condition, the previous literature [23,24] presented one kind of sensing matrices in time domain as follows. This CS matrix is based on the idea that the echo signal is the delay of the transmitted signal, and its orthogonality also was validated.…”
Section: Compressive Sensing Matrix For Sar Imagingmentioning
confidence: 99%
“…Although CS has enabled significant improvements on radar and radar imaging systems [2,[10][11][12][13], a number of challenges still exist in applying CS to radar imaging, such as developing appropriate sparsity models of radar images and managing computational complexity [5,6,14].…”
Section: Relation To Prior Workmentioning
confidence: 99%