SAR Imaging With Undersampled Data via Matrix Completion

被引:58
作者
Yang, Dong [1 ]
Liao, Guisheng [1 ]
Zhu, Shengqi [1 ]
Yang, Xi [2 ]
Zhang, Xuepan [1 ]
机构
[1] Xidian Univ, Key Lab Radar Signal Proc, Xian 710071, Peoples R China
[2] Xidian Univ, Sch Elect Engn, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Data recovery; low-rank matrix completion (MC); synthetic aperture radar (SAR) imaging; undersampling; RADAR; EXTRACTION; SYSTEM;
D O I
10.1109/LGRS.2014.2300170
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
High-resolution synthetic aperture radar (SAR) imagery of a wide area of surveillance is a difficult large-data problem. In the past few years, researchers have applied compressive sensing (CS) to SAR, as it exploits redundancy in signals. To further extend the sparse problem from the vector to the matrix, a new theory called matrix completion (MC) has attracted much attention, which can complete a matrix from a small set of corrupted entries based on the assumption that the matrix is essentially of low rank. Inspired by this technique, a novel SAR imaging algorithm is proposed in this letter to deal with the undersampled data. After representing the data of a range cell as a matrix, the phase is compensated to keep the matrix holding the property of low rank. Subsequently, MC can be utilized to recover the full-aperture data in the new constructed matrix. Since the data are completely unsampled in the corresponding azimuth cells, the proposed method has effectively conquered the restriction of previous applications that each received channel must have a small number of samples. The final results in both simulation and real-data experiments show that the targets can be well focused even in the scenario of discarding a large percentage of the received pulses. Moreover, when compared with CS, the method is not required to design the complicated measurement matrix.
引用
收藏
页码:1539 / 1543
页数:5
相关论文
共 19 条
[1]  
[Anonymous], 2011, ARXIV PREPRINT ARXIV
[2]  
[Anonymous], 2009, arXiv preprint arXiv:09095457
[3]   The Power of Convex Relaxation: Near-Optimal Matrix Completion [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (05) :2053-2080
[4]   Matrix Completion With Noise [J].
Candes, Emmanuel J. ;
Plan, Yaniv .
PROCEEDINGS OF THE IEEE, 2010, 98 (06) :925-936
[5]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel J. ;
Recht, Benjamin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) :717-772
[6]   Sensitivity to Basis Mismatch in Compressed Sensing [J].
Chi, Yuejie ;
Scharf, Louis L. ;
Pezeshki, Ali ;
Calderbank, A. Robert .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (05) :2182-2195
[7]  
Cumming I. G., 2005, ARTECH REM, V1, P108
[8]   Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices [J].
Fazel, M ;
Hindi, H ;
Boyd, SP .
PROCEEDINGS OF THE 2003 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2003, :2156-2162
[9]   SAR imaging of moving targets [J].
Perry, RP ;
DiPietro, RC ;
Fante, RL .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1999, 35 (01) :188-200
[10]  
Rilling G., 2009, Signal Processing with Adaptive Sparse Structured Representations (SPARS), P1