OSRanP: A Novel Way for Radar Imaging Utilizing Joint Sparsity and Low-Rankness

被引:39
作者
Pu, Wei [1 ]
Wu, Junjie [2 ]
机构
[1] UCL, Dept Elect & Elect Engn, London WC1E 6BT, England
[2] Univ Elect Sci & Technol China, Sch Informat & Commun Engn, Chengdu 611731, Peoples R China
关键词
SIGNAL RECOVERY; MATRIX RECOVERY; ALGORITHM; RECONSTRUCTION;
D O I
10.1109/TCI.2020.2993170
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Synthetic aperture radar (SAR) has extensive applications in both civilian and military fields for its ability to create high-resolution images of the ground target without being affected by weather conditions and daytime or nighttime effect. As fueled by the several decades' advancement of SAR, existing SAR systems exhibit high imaging capabilities, namely, significantly high two-dimensional resolution. However, in accordance with Nyquist's sampling theory, the increase in resolution implies an evident increase in the amount of sampling data, thereby causing numerous limitations to practical application. To solve this problem, several compressive sensing (CS) and matrix sensing (MS) techniques have been applied to SAR imaging, wherein the existing knowledge of sparsity or low-rankness is exploited to reconstruct the SAR image based on an under-sampled SAR raw data. In this study, we take a different approach, wherein redundancy property of the SAR image is further exploited. The SAR image is split into a sparse matrix and a low rank matrix. Thus, the SAR imaging processor is modelled as a problem of joint sparse and low rank matrices recovery. An Orthogonal Sparse and Rank-one Pursuit (OSRanP) algorithm is newly proposed to solve this problem in SAR imaging case, where there isn't any prior information of the exact sparsity or low-rankness value at hand. As revealed from the results here, the proposed method outmatches the CS and MS methods in sampling efficiency in both simulations and experiments.
引用
收藏
页码:868 / 882
页数:15
相关论文
共 36 条
  • [1] [Anonymous], 2009, IEEE T IMAGE PROCESS, DOI DOI 10.1109/TIP.2009.2017327
  • [2] Compressive sensing
    Baraniuk, Richard G.
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (04) : 118 - +
  • [3] A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
    Beck, Amir
    Teboulle, Marc
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01): : 183 - 202
  • [4] A Novel SAR Imaging Algorithm Based on Compressed Sensing
    Bu, Hongxia
    Tao, Ran
    Bai, Xia
    Zhao, Juan
    [J]. IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2015, 12 (05) : 1003 - 1007
  • [5] Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information
    Candès, EJ
    Romberg, J
    Tao, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) : 489 - 509
  • [6] Near-optimal signal recovery from random projections: Universal encoding strategies?
    Candes, Emmanuel J.
    Tao, Terence
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) : 5406 - 5425
  • [7] Robust Principal Component Analysis?
    Candes, Emmanuel J.
    Li, Xiaodong
    Ma, Yi
    Wright, John
    [J]. JOURNAL OF THE ACM, 2011, 58 (03)
  • [8] Airborne SAR-Efficient Signal Processing for Very High Resolution
    Cantalloube, Hubert M. J.
    Nahum, Carole E.
    [J]. PROCEEDINGS OF THE IEEE, 2013, 101 (03) : 784 - 797
  • [9] Sparsity-Driven Synthetic Aperture Radar Imaging [Reconstruction, autofocusing, moving targets, and compressed sensing]
    Cetin, Mujdat
    Stojanovic, Ivana
    Onhon, N. Ozben
    Varshney, Kush R.
    Samadi, Sadegh
    Karl, W. Clem
    Willsky, Alan S.
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 2014, 31 (04) : 27 - 40
  • [10] Sparse and Low-Rank Matrix Decompositions
    Chandrasekaran, Venkat
    Sanghavi, Sujay
    Parrilo, Pablo A.
    Willsky, Alan S.
    [J]. 2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 962 - +