Permutation Meets Parallel Compressed Sensing: How to Relax Restricted Isometry Property for 2D Sparse Signals

被引:74
作者
Fang, Hao [1 ]
Vorobyov, Sergiy A. [2 ]
Jiang, Hai [1 ]
Taheri, Omid [1 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada
[2] Aalto Univ, Dept Signal Proc & Acoust, FI-00076 Aalto, Finland
基金
加拿大自然科学与工程研究理事会;
关键词
Compressed sensing; multidimensional signal processing; parallel processing; permutation;
D O I
10.1109/TSP.2013.2284762
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Traditional compressed sensing considers sampling a 1D signal. For a multidimensional signal, if reshaped into a vector, the required size of the sensing matrix becomes dramatically large, which increases the storage and computational complexity significantly. To solve this problem, the multidimensional signal is reshaped into a 2D signal, which is then sampled and reconstructed column by column using the same sensing matrix. This approach is referred to as parallel compressed sensing, and it has much lower storage and computational complexity. For a given reconstruction performance of parallel compressed sensing, if a so-called acceptable permutation is applied to the 2D signal, the corresponding sensing matrix is shown to have a smaller required order of restricted isometry property condition, and thus, lower storage and computation complexity at the decoder are required. A zigzag-scan-based permutation is shown to be particularly useful for signals satisfying the newly introduced layer model. As an application of the parallel compressed sensing with the zigzag-scan-based permutation, a video compression scheme is presented. It is shown that the zigzag-scan-based permutation increases the peak signal-to-noise ratio of reconstructed images and video frames.
引用
收藏
页码:196 / 210
页数:15
相关论文
共 21 条
[1]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[2]  
Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
[3]   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
[4]  
Cheng Zhou, 2011, 2011 International Conference on Intelligent Computation Technology and Automation (ICICTA), P483, DOI 10.1109/ICICTA.2011.405
[5]   Progressive Compressed Sensing and Reconstruction of Multidimensional Signals Using Hybrid Transform/Prediction Sparsity Model [J].
Coluccia, Giulio ;
Kuiteing, Simeon Kamdem ;
Abrardo, Andrea ;
Barni, Mauro ;
Magli, Enrico .
IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS, 2012, 2 (03) :340-352
[6]   Sparse solutions to linear inverse problems with multiple measurement vectors [J].
Cotter, SF ;
Rao, BD ;
Engan, K ;
Kreutz-Delgado, K .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (07) :2477-2488
[7]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[8]   Performance of the Delsarte-Goethals Frame on Clustered Sparse Vectors [J].
Duarte, Marco F. ;
Jafarpour, Sina ;
Calderbank, A. Robert .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (08) :1998-2008
[9]   Kronecker Compressive Sensing [J].
Duarte, Marco F. ;
Baraniuk, Richard G. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (02) :494-504
[10]  
Fang H, 2012, CONF REC ASILOMAR C, P1925, DOI 10.1109/ACSSC.2012.6489374