Structured Compressed Sensing: From Theory to Applications

被引:777
作者
Duarte, Marco F. [1 ]
Eldar, Yonina C. [2 ]
机构
[1] Univ Massachusetts, Dept Elect & Comp Engn, Amherst, MA 01003 USA
[2] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
基金
以色列科学基金会;
关键词
Approximation algorithms; compressed sensing; compression algorithms; data acquisition; data compression; sampling methods; TIME-DELAY ESTIMATION; SIMULTANEOUS SPARSE APPROXIMATION; SIGNAL RECONSTRUCTION; FINITE-RATE; GROUP LASSO; UNCERTAINTY PRINCIPLES; RANDOM PROJECTIONS; SAMPLING SIGNALS; MATCHING PURSUIT; MODEL SELECTION;
D O I
10.1109/TSP.2011.2161982
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Compressed sensing (CS) is an emerging field that has attracted considerable research interest over the past few years. Previous review articles in CS limit their scope to standard discrete-to-discrete measurement architectures using matrices of randomized nature and signal models based on standard sparsity. In recent years, CS has worked its way into several new application areas. This, in turn, necessitates a fresh look on many of the basics of CS. The random matrix measurement operator must be replaced by more structured sensing architectures that correspond to the characteristics of feasible acquisition hardware. The standard sparsity prior has to be extended to include a much richer class of signals and to encode broader data models, including continuous-time signals. In our overview, the theme is exploiting signal and measurement structure in compressive sensing. The prime focus is bridging theory and practice; that is, to pinpoint the potential of structured CS strategies to emerge from the math to the hardware. Our summary highlights new directions as well as relations to more traditional CS, with the hope of serving both as a review to practitioners wanting to join this emerging field, and as a reference for researchers that attempts to put some of the existing ideas in perspective of practical applications.
引用
收藏
页码:4053 / 4085
页数:33
相关论文
共 185 条
[1]   Information Theoretic Bounds for Compressed Sensing [J].
Aeron, Shuchin ;
Saligrama, Venkatesh ;
Zhao, Manqi .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) :5111-5130
[2]   Nonuniform sampling and reconstruction in shift-invariant spaces [J].
Aldroubi, A ;
Gröchenig, K .
SIAM REVIEW, 2001, 43 (04) :585-620
[3]  
[Anonymous], 1993, ORTHOGONAL MATCHING
[4]  
[Anonymous], 2006, Journal of the Royal Statistical Society, Series B
[5]  
[Anonymous], [No title captured]
[6]  
[Anonymous], 1928, Transactions of the American Institute of Electrical Engineers, DOI DOI 10.1109/T-AIEE.1928.5055024
[7]  
[Anonymous], 1983, PRINCIPLES UNDERWATE
[8]   Noise Folding in Compressed Sensing [J].
Arias-Castro, Ery ;
Eldar, Yonina C. .
IEEE SIGNAL PROCESSING LETTERS, 2011, 18 (08) :478-481
[9]   Exact Feature Extraction Using Finite Rate of Innovation Principles With an Application to Image Super-Resolution [J].
Baboulaz, Loic ;
Dragotti, Pier Luigi .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2009, 18 (02) :281-298
[10]  
Bach FR, 2008, J MACH LEARN RES, V9, P1179