Expanding Window Compressed Sensing for Non-Uniform Compressible Signals

被引:6
作者
Liu, Yu [1 ]
Zhu, Xuqi [1 ]
Zhang, Lin [1 ]
Cho, Sung Ho [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Minist Educ, Key Lab Univ Wireless Commun, Beijing 100876, Peoples R China
[2] Hanyang Univ, Dept Elect & Comp Engn, Seoul 133791, South Korea
基金
美国国家科学基金会;
关键词
compressed sensing; image compression; networked data; non-uniform compressible signal; random projection; unequal protection; RECOVERY;
D O I
10.3390/s121013034
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Many practical compressible signals like image signals or the networked data in wireless sensor networks have non-uniform support distribution in their sparse representation domain. Utilizing this prior information, a novel compressed sensing (CS) scheme with unequal protection capability is proposed in this paper by introducing a windowing strategy called expanding window compressed sensing (EW-CS). According to the importance of different parts of the signal, the signal is divided into several nested subsets, i.e., the expanding windows. Each window generates its own measurements using a random sensing matrix. The more significant elements are contained by more windows, so they are captured by more measurements. This design makes the EW-CS scheme have more convenient implementation and better overall recovery quality for non-uniform compressible signals than ordinary CS schemes. These advantages are theoretically analyzed and experimentally confirmed. Moreover, the EW-CS scheme is applied to the compressed acquisition of image signals and networked data where it also has superior performance than ordinary CS and the existing unequal protection CS schemes.
引用
收藏
页码:13034 / 13057
页数:24
相关论文
共 24 条
[1]  
[Anonymous], 2006, P 5 INT C INF PROC S
[2]   Bayesian Compressive Sensing Using Laplace Priors [J].
Babacan, S. Derin ;
Molina, Rafael ;
Katsaggelos, Aggelos K. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (01) :53-63
[3]   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
[4]   Bayesian Compressive Sensing Via Belief Propagation [J].
Baron, Dror ;
Sarvotham, Shriram ;
Baraniuk, Richard G. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (01) :269-280
[5]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[6]   Near-optimal signal recovery from random projections: Universal encoding strategies? [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5406-5425
[7]   Stable signal recovery from incomplete and inaccurate measurements [J].
Candes, Emmanuel J. ;
Romberg, Justin K. ;
Tao, Terence .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (08) :1207-1223
[8]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[9]  
Deng C., 2010, P IEEE INT C MULT EX
[10]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306