2D Normalized Iterative Hard Thresholding Algorithm for Fast Compressive Radar Imaging

Compressive radar imaging has attracted considerable attention because it substantially reduces imaging time through directly compressive sampling. However, a problem that must be addressed for compressive radar imaging systems is the high computational complexity of reconstruction of sparse signals...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Remote sensing (Basel, Switzerland) Ročník 9; číslo 6; s. 619
Hlavní autoři: Li, Gongxin, Yang, Jia, Yang, Wenguang, Wang, Yuechao, Wang, Wenxue, Liu, Lianqing
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.06.2017
Témata:
Algorithms
Complexity
Computation
Computer applications
Data processing
Experiments
Image reconstruction
International conferences
Iterative methods
Radar
Radar imaging
Radar systems
Recovery
Remote sensing
Sampling
Signal processing
Signal reconstruction
Space surveillance
Surveillance
Theory
Time compression
Two dimensional models
China
ISSN:2072-4292, 2072-4292
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Compressive radar imaging has attracted considerable attention because it substantially reduces imaging time through directly compressive sampling. However, a problem that must be addressed for compressive radar imaging systems is the high computational complexity of reconstruction of sparse signals. In this paper, a novel algorithm, called two-dimensional (2D) normalized iterative hard thresholding (NIHT) or 2D-NIHT algorithm, is proposed to directly reconstruct radar images in the matrix domain. The reconstruction performance of 2D-NIHT algorithm was validated by an experiment on recovering a synthetic 2D sparse signal, and the superiority of the 2D-NIHT algorithm to the NIHT algorithm was demonstrated by a comprehensive comparison of its reconstruction performance. Moreover, to be used in compressive radar imaging systems, a 2D sampling model was also proposed to compress the range and azimuth data simultaneously. The practical application of the 2D-NIHT algorithm in radar systems was validated by recovering two radar scenes with noise at different signal-to-noise ratios, and the results showed that the 2D-NIHT algorithm could reconstruct radar scenes with a high probability of exact recovery in the matrix domain. In addition, the reconstruction performance of the 2D-NIHT algorithm was compared with four existing efficient reconstruction algorithms using the two radar scenes, and the results illustrated that, compared to the other algorithms, the 2D-NIHT algorithm could dramatically reduce the computational complexity in signal reconstruction and successfully reconstruct 2D sparse images with a high probability of exact recovery.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2072-4292
2072-4292
DOI:10.3390/rs9060619