Fast Detection of Compressively Sensed IR Targets Using Stochastically Trained Least Squares and Compressed Quadratic Correlation Filters

被引:7
作者
Millikan, Brian [1 ,2 ]
Dutta, Aritra [3 ]
Sun, Qiyu [3 ]
Foroosh, Hassan [1 ]
机构
[1] Univ Cent Florida, Dept Elect Engn & Comp Sci, Orlando, FL 32816 USA
[2] Lockheed Martin Missiles & Fire Control, Orlando, FL 32819 USA
[3] Univ Cent Florida, Dept Math, Orlando, FL 32816 USA
基金
美国国家科学基金会;
关键词
ROBUST UNCERTAINTY PRINCIPLES; SIGNAL RECOVERY; RECONSTRUCTION;
D O I
10.1109/TAES.2017.2700598
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Target detection of potential threats at night can be deployed on a costly infrared focal plane array with high resolution. Due to the compressibility of infrared image patches, the high resolution requirement could be reduced with target detection capability preserved. For this reason, a compressive midwave infrared imager (MWIR) with a low-resolution focal plane array has been developed. As the most probable coefficient indices of the support set of the infrared image patches could be learned from the training data, we develop stochastically trained least squares (STLS) for MWIR image reconstruction. Quadratic correlation filters (QCF) have been shown to be effective for target detection and there are several methods for designing a filter. Using the same measurement matrix as in STLS, we construct a compressed quadratic correlation filter (CQCF) employing filter designs for compressed infrared target detection. We apply CQCF to the U.S. Army Night Vision and Electronic Sensors Directorate dataset. Numerical simulations show that the recognition performance of our algorithm matches that of the standard full reconstruction methods, but at a fraction of the execution time.
引用
收藏
页码:2449 / 2461
页数:13
相关论文
共 39 条
[1]  
[Anonymous], 2011, Compressed Sensing: Theory and Applications
[2]  
ATRWG Technology Committee, 1992, MATH MORPH ATR ALG D
[3]  
Baldassarre L., ARXIV151006188
[4]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[5]  
Blasch E, 2005, 2005 7th International Conference on Information Fusion (FUSION), Vols 1 and 2, P275
[6]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[7]   Sharp RIP bound for sparse signal and low-rank matrix recovery [J].
Cai, T. Tony ;
Zhang, Anru .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2013, 35 (01) :74-93
[8]  
Candes E. J., 2006, P INT C MATH ICM, P1433, DOI DOI 10.4171/022-3/69
[9]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[10]   Quantitative robust uncertainty principles and optimally sparse decompositions [J].
Candès, Emmanuel J. ;
Romberg, Justin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2006, 6 (02) :227-254