Fusion of Algorithms for Compressed Sensing

For compressed sensing (CS), we develop a new scheme inspired by data fusion principles. In the proposed fusion based scheme, several CS reconstruction algorithms participate and they are executed in parallel, independently. The final estimate of the underlying sparse signal is derived by fusing the estimates obtained from the participating algorithms. We theoretically analyze this fusion based scheme and derive sufficient conditions for achieving a better reconstruction performance than any participating algorithm. Through simulations, we show that the proposed scheme has two specific advantages: 1) it provides good performance in a low dimensional measurement regime, and 2) it can deal with different statistical natures of the underlying sparse signals. The experimental results on real ECG signals shows that the proposed scheme demands fewer CS measurements for an approximate sparse signal reconstruction.

[1]  Kenneth E. Barner,et al.  Iterative algorithms for compressed sensing with partially known support , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[2]  J. Tropp,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, Commun. ACM.

[3]  K. V. S. Hari,et al.  Fusion of Greedy Pursuits for compressed sensing signal reconstruction , 2012, 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO).

[4]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[5]  James Llinas,et al.  Handbook of Multisensor Data Fusion : Theory and Practice, Second Edition , 2008 .

[6]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[7]  A. Tsybakov,et al.  Mirror averaging with sparsity priors , 2010, 1003.1189.

[8]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[9]  Jelena Kovacevic,et al.  Reproducible research in signal processing , 2009, IEEE Signal Process. Mag..

[10]  Jean-Luc Starck,et al.  Very high quality image restoration by combining wavelets and curvelets , 2001, SPIE Optics + Photonics.

[11]  Michael Elad,et al.  A Plurality of Sparse Representations Is Better Than the Sparsest One Alone , 2009, IEEE Transactions on Information Theory.

[12]  G.B. Moody,et al.  The impact of the MIT-BIH Arrhythmia Database , 2001, IEEE Engineering in Medicine and Biology Magazine.

[13]  Arnak S. Dalalyan,et al.  Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity , 2008, Machine Learning.

[14]  Mikael Skoglund,et al.  Projection-Based and Look-Ahead Strategies for Atom Selection , 2011, IEEE Transactions on Signal Processing.

[15]  Mohamed-Jalal Fadili,et al.  Morphological Diversity and Sparse Image Denoising , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[16]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[17]  Kenneth E. Barner,et al.  Iterative hard thresholding for compressed sensing with partially known support , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[18]  K. V. S. Hari,et al.  Adaptive selection of search space in look ahead orthogonal matching pursuit , 2012, 2012 National Conference on Communications (NCC).

[19]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[20]  Bob L. Sturm.  A Study on Sparse Vector Distributions and Recovery from Compressed Sensing , 2011, ArXiv.

[21]  Arian Maleki,et al.  Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

[22]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.