A new backtracking-based sparsity adaptive algorithm for distributed compressed sensing

Abstract

A new iterative greedy algorithm based on the backtracking technique was proposed for distributed compressed sensing (DCS) problem. The algorithm applies two mechanisms for precise recovery soft thresholding and cutting. It can reconstruct several compressed signals simultaneously even without any prior information of the sparsity, which makes it a potential candidate for many practical applications, but the numbers of non-zero (significant) coefficients of signals are not available. Numerical experiments are conducted to demonstrate the validity and high performance of the proposed algorithm, as compared to other existing strong DCS algorithms.

Keywords

distributed compressed sensing / sparsiy / backtracking / soft thresholding

References

[1] DonohoD L. Compressed sensing [J]. IEEE Transactions on Information Theory, 2006, 52(4): 1289-1306

[2] LiuJ, HanC-z, HuY. A novel compressed sensing based method for reconstructing sparse signal using space-time data in airborne radar system [C]. Chinese Control Conference. Xi’an, China, 20134826-4831

[3] RauhutH, SchnassK, VandergheynstP. Compressed sensing and redundant dictionaries [J]. IEEE Transactions on Information Theory, 2008, 54(5): 2210-2219

[4] CandesE J, RombergJ, TaoT. Stable signal recovery from incomplete and inaccurate measurements [J]. Communications on Pure and Applied Mathematics, 2006, 59(8): 1207-1223

[5] CandesE J, RombergJ, TaoT. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information [J]. IEEE Transactions on Information Theory, 2006, 52(2): 489-509

[6] CandesE J, TaoT. Decoding by linear programming [J]. IEEE Transactions on Information Theory, 2005, 51(12): 4203-4215

[7] NesterovY, NemirovskiiAInterior-point polynomial algorithms in convex programming [M], 1994PhiladelphiaSIAM20-89

[8] TroppJ A, GilbertA C. Signal recovery from random measurements via orthogonal matching pursuit [J]. IEEE Transactions on Information Theory, 2007, 53(12): 4655-4666

[9] FangH, ZhangQ-b, WeiS. Image reconstruction based on improved backward optimized orthogonal matching pursuit algorithm [J]. Journal of South China University of Technology: Natural Science, 2008, 36(8): 23-27

[10] NeedellD, VershyninR. Signal recovery from inaccurate and incomplete measurements via regularized orthogonal matching pursuit [J]. IEEE Journal of Selected Topics in Signal Process, 2010, 4(2): 310-316

[11] NeedellD, TroppJ A. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples [J]. Applied and Computational Harmonic Analysis, 2008, 26(3): 301-321

[12] DaiW, MilenkovicO. Subspace pursuit for compressive sensing signal reconstruction [J]. IEEE Transactions on Information Theory, 2009, 55(5): 2230-2249

[13] DoT T, LuG, NguyenN, TranT D. Sparsity adaptive matching pursuit algorithm for practical compressed sensing [C]. 42nd Asilomar Conference on Signals, Systems and Computers. Pacific Grove, United States, 2008581-587

[14] BARON D, DUARTE M F, WAKIN M B, SARVOTHAM S, BARANIUK R G. Distributed compressed sensing [J]. IEEE Transaction on Information Theory. http://dsp.rice.edu/publications/distributed-compressive-sensing.

[15] DuarteM F, SarvothamS, WakinM B, BaronD, BaraniukR GJoint sparsity models for distributed compressed sensing [C], 2005

[16] BaronD, DuarteM F, SarvothamS, WakinM B, BaraniukR GAn information-theoretic approach to distributed compressed sensing [C], 2005

[17] DuarteM F, SarvothamS, BaronD, WakinM B, BaraniukR G. Distributed compressed sensing of jointly sparse signals [C]. 39th Asilomar Conference on Signals, Systems and Somputers. Pacific Grove, United States, 20051537-1541

[18] BlanchardJ, CermakM, HanleD, JingY-r. Greedy algorithms for joint sparse recovery [J]. IEEE Transactions on Signal Processing, 2014, 62(7): 1694-1704

[19] SundmanD, ChatterjeeS, SkoglundM. Greedy pursuits for compressed sensing of jointly sparse signals [C]. European Signal Processing Conference. Barcelona, Spain, 2011368-372

[20] WangQ, LiuZ-w. A robust and efficient algorithm for distributed compressed sensing [J]. Computers and Electrical Engineering, 2011, 37(6): 916-926

[21] GanW, XuL-p, ZhangH, SuZ. Greedy adaptive recovery-algorithm for compressed sensing [J]. Journal of Xidian University, 2012, 39(3): 54-62

[22] BlumensathT, DaviesM E. Iterative hard thresholding for compressed sensing [J]. Applied and Computational Harmonic Analysis, 2009, 27(3): 265-274

[23] DAI Wei, OLGICA M. Subspace pursuit for compressive sensing: Closing the gap between performance and complexity [EB/OL]. [2008-05-10]. http: // www.dsp. rice.edu/cs.

[24] LiuZ, WeiX-z, LiX. Low sidelobe robust imaging in random frequency-hopping wideband radar based on compressed sensing [J]. Journal of Central South University, 2013, 20(3): 702-714