Compressed Sensing and Parallel Acquisition

被引:27
作者
Chun, Il Yong [1 ,2 ]
Adcock, Ben [3 ]
机构
[1] Purdue Univ, Dept Math, W Lafayette, IN 47907 USA
[2] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
[3] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada
基金
加拿大自然科学与工程研究理事会; 美国国家科学基金会;
关键词
Compressed sensing; parallel acquisition; sparsity in levels; nonuniform recovery; incoherence; SPARSE RECOVERY; RECONSTRUCTION; EFFICIENT; COEFFICIENTS; INCOHERENCE; PRINCIPLES; MATRICES;
D O I
10.1109/TIT.2017.2700440
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Parallel acquisition systems arise in various applications to moderate problems caused by insufficient measurements in single-sensor systems. These systems allow simultaneous data acquisition in multiple sensors, thus alleviating such problems by providing more overall measurements. In this paper, we consider the combination of compressed sensing with parallel acquisition. We establish the theoretical improvements of such systems by providing nonuniform recovery guarantees for which, subject to appropriate conditions, the number of measurements required per sensor decreases linearly with the total number of sensors. Throughout, we consider two different sampling scenarios-distinct (i.e., independent sampling in each sensor) and identical (i.e., dependent sampling between sensors)-and a general mathematical framework that allows for a wide range of sensing matrices. We also consider not just the standard sparse signal model, but also the so-called sparse in levels signal model. As our results show, optimal recovery guarantees for both distinct and identical sampling are possible under much broader conditions on the so-called sensor profile matrices (which characterize environmental conditions between a source and the sensors) for the sparse in levels model than for the sparse model. To verify our recovery guarantees, we provide numerical results showing phase transitions for different multi-sensor environments.
引用
收藏
页码:4860 / 4882
页数:23
相关论文
共 75 条
[1]  
Aceska R., 2016, LOCAL SPARSITY RECOV
[2]  
Adcock B., FDN COMPUT IN PRESS
[3]   BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING [J].
Adcock, Ben ;
Hansen, Anders C. ;
Poon, Clarice ;
Roman, Bogdan .
FORUM OF MATHEMATICS SIGMA, 2017, 5 :1-84
[4]   The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing [J].
Adcock, Ben ;
Hansen, Anders C. ;
Roman, Bogdan .
COMPRESSED SENSING AND ITS APPLICATIONS, 2015, :143-167
[5]   A Note on Compressed Sensing of Structured Sparse Wavelet Coefficients From Subsampled Fourier Measurements [J].
Adcock, Ben ;
Hansen, Anders C. ;
Roman, Bogdan .
IEEE SIGNAL PROCESSING LETTERS, 2016, 23 (05) :732-736
[6]   Generalized Sampling and Infinite-Dimensional Compressed Sensing [J].
Adcock, Ben ;
Hansen, Anders C. .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2016, 16 (05) :1263-1323
[7]  
[Anonymous], 2005, Comput. Sci. Tech. Rep.
[8]  
[Anonymous], ASYMPTOTIC STRUCTURE
[9]  
[Anonymous], 2012, CVX MATL SOFTW DISC
[10]  
[Anonymous], 2010, Theoretical foundations and numerical methods for sparse recovery, DOI DOI 10.1515/9783110226157.1