{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T21:01:14Z","timestamp":1773694874159,"version":"3.50.1"},"reference-count":64,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2013,12,23]],"date-time":"2013-12-23T00:00:00Z","timestamp":1387756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSAN"],"abstract":"<jats:p>Compressed sensing is a thriving research field covering a class of problems where a large sparse signal is reconstructed from a few random measurements. In the presence of several sensor nodes measuring correlated sparse signals, improvements in terms of recovery quality or the requirement for a fewer number of local measurements can be expected if the nodes cooperate. In this paper, we provide an overview of the current literature regarding distributed compressed sensing; in particular, we discuss aspects of network topologies, signal models and recovery algorithms.<\/jats:p>","DOI":"10.3390\/jsan3010001","type":"journal-article","created":{"date-parts":[[2013,12,23]],"date-time":"2013-12-23T12:17:19Z","timestamp":1387801039000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Methods for Distributed Compressed Sensing"],"prefix":"10.3390","volume":"3","author":[{"given":"Dennis","family":"Sundman","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and ACCESS Linneaus Centre, KTH Royal Institute of Technology, Stockholm SE-100 44, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saikat","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and ACCESS Linneaus Centre, KTH Royal Institute of Technology, Stockholm SE-100 44, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and ACCESS Linneaus Centre, KTH Royal Institute of Technology, Stockholm SE-100 44, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2013,12,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","article-title":"Near-optimal signal recovery from random projections: Universal encoding strategies?","volume":"52","author":"Tao","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1109\/TSP.2011.2174985","article-title":"RIP-based near-oracle performance guarantees for SP, CoSaMP, and IT","volume":"60","author":"Giryes","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Tao","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1109\/18.959265","article-title":"Uncertainty principles and ideal atomic decomposition","volume":"47","author":"Donoho","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cohen, A., Dahmen, W., and Devore, R. (2009). Compressed sensing and best k-term approximation. J. Amr. Math. Soc., 211\u2013231.","DOI":"10.1090\/S0894-0347-08-00610-3"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1109\/TIT.2003.811926","article-title":"On sparse representation in pairs of bases","volume":"49","author":"Feuer","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","first-page":"2241","article-title":"Restricted eigenvalue properties for correlated gaussian designs","volume":"11","author":"Raskutti","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref_9","unstructured":"Sundman, D., Chatterjee, S., and Skoglund, M. Distributed Greedy Pursuit Algorithms. Available online: http:\/\/arxiv.org\/abs\/0901.3403."},{"key":"ref_10","first-page":"290","article-title":"On random graphs","volume":"6","year":"1959","journal-title":"Publ. Math."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u201csmall-world\u201d networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Penrose, M. (2004). Random Geometric Graphs, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Albert","year":"1999","journal-title":"Science"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","article-title":"A note on the maximum flow through a network","volume":"4","author":"Elias","year":"1956","journal-title":"IRE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Can. J. Math."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Blasco-Serrano, R., Zachariah, D., Sundman, D., Thobaben, R., and Skoglund, M. (2013, January 26\u201331). An Achievable Measurement Rate-MSE Tradeoff in Compressive Sensing through Partial Support Recovery. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013), Vancouver, BC, Canada.","DOI":"10.1109\/ICASSP.2013.6638903"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Feizi, S., and Medard, M. (2013, January 2\u20134). A Power Efficient Sensing\/Communication Scheme: Joint Source-Channel-Network Coding by Using Compressive Sensing. Proceedings of AnnualAllerton Conference on Communication, Control, and Computing (Allerton 2011), Champaign, IL, USA.","DOI":"10.1109\/Allerton.2011.6120283"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Feizi, S., Medard, M., and Effros, M. (October, January 29). Compressive Sensing over Networks. Proceedings of IEEE Annual Allerton Conference on Communication, Control, and Computing (Allerton 2010), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2010.5707037"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MSP.2007.915001","article-title":"Compressive sampling and lossy compression","volume":"25","author":"Goyal","year":"2008","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Sun, J.Z., and Goyal, V.K. (July, January 28). Optimal Quantization of Random Measurements in Compressed Sensing. Proceedings of 2009 IEEE International Symposium on Information Theory, Seoul, Korea.","DOI":"10.1109\/ISIT.2009.5205695"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"5789","DOI":"10.1109\/TSP.2013.2280445","article-title":"Analysis-by-synthesis quantization for compressed sensing measurements","volume":"61","author":"Shirazinia","year":"2013","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3868","DOI":"10.1109\/TSP.2012.2193397","article-title":"Robust 1-bit compressive sensing using adaptive outlier pursuit","volume":"60","author":"Ming","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1109\/TCOMM.2011.051711.100204","article-title":"Information theoretical and algorithmic approaches to quantized compressive sensing","volume":"59","author":"Wei","year":"2011","journal-title":"IEEE Trans. Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/LSP.2009.2035667","article-title":"Compressed sensing with quantized measurements","volume":"17","author":"Zymnis","year":"2010","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/TSP.2011.2182347","article-title":"Distributed basis pursuit","volume":"60","author":"Mota","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_26","unstructured":"Baron, D., Duarte, M.F., Wakin, M.B., Sarvotham, S., and Baraniuk, R.G. Distributed Compressive Sensing. Available online: http:\/\/arxiv.org\/abs\/0901.3403."},{"key":"ref_27","unstructured":"Park, J., Hwang, S., Yang, J., and Kim, D.K. Generalized Distributed Compressive Sensing. Available online: http:\/\/arxiv.org\/abs\/1211.6522."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Sundman, D., Chatterjee, S., and Skoglund, M. (2010, January 15\u201318). On the Use of Compressive Sampling for Wide-Band Spectrum Sensing. Proceedings of IEEE International Symposium on Signal Processing and Information Technology (ISSPIT 2010), Luxor, Egypt.","DOI":"10.1109\/ISSPIT.2010.5711810"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Kirmani, A., Colaco, A., Wong, F.N.C., and Goyal, V.K. (2012, January 25\u201330). CoDAC: A Compressive Depth Acquisition Camera Rramework. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2012), Kyoto, Japan.","DOI":"10.1109\/ICASSP.2012.6289148"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Wu, P.K.T., Epain, N., and Jin, C. (2012, January 25\u201330). A Dereverberation Algorithm for Spherical Microphone Arrays Using Compressed Sensing Techniques. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2012), Kyoto, Japan.","DOI":"10.1109\/ICASSP.2012.6288808"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Sundman, D., Zachariah, D., Chatterjee, S., and Skoglund, M. (2013, January 26\u201331). Distributed Predictive Subspace Pursuit. Proceedings of International Conference on Acoustics, Speech, and Signal Processing, Vancouver, BC, Canada.","DOI":"10.1109\/ICASSP.2013.6638538"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","article-title":"The restricted isometry property and its implications for compressed sensing","volume":"346","year":"2008","journal-title":"Rendus Math."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MSP.2007.914731","article-title":"An introduction to compressive sampling","volume":"25","author":"Wakin","year":"2008","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/JSTSP.2009.2039178","article-title":"Signal processing with compressive measurements","volume":"4","author":"Davenport","year":"2010","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating method of multipliers","volume":"3","author":"Boyd","year":"2011","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B. (1963). Linear Programming and Extensions, Princeton University Press.","DOI":"10.7249\/R366"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Dutta, H., and Kargupta, H. (2008, January 15\u201319). Distributed Linear Programming and Resource Management for Data Mining in Distributed Environments. Proceedings of IEEE International Conference on Data Mining Workshops (ICDMW 2008), Pita, Italy.","DOI":"10.1109\/ICDMW.2008.137"},{"key":"ref_38","unstructured":"Yarmish, G. (2001). A Distributed Implementation of the Simplex Method. [Ph.D. Thesis, Polytechnic University]."},{"key":"ref_39","unstructured":"Hall, J.A.J., and McKinnon, K.I.M. (1992). Update Procedures for the Parallel Revised Simplex Method, University of Edingburgh. Technical Report."},{"key":"ref_40","unstructured":"Craig, S., and Reed, D. (1988, January 19\u201320). Hypercube Implementation of the Simplex Algorithm. Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, Pasadena, CA, USA."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Neelamani, R., Krohn, C.E., Krebs, J.R., Deffenbaugh, M., Anderson, J.E., and Romberg, J.K. (2008, January 9\u201314). Efficient Seismic Forward Modeling Using Simultaneous Random Sources and Sparsity. Proceedings of SEG International Exposition and 78th Annual Meeting, Las Vegas, NV, USA.","DOI":"10.1190\/1.3059305"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"1847","DOI":"10.1109\/TSP.2009.2038417","article-title":"Distributed spectrum sensing for cognitive radio networks by exploiting sparsity","volume":"58","author":"Bazerque","year":"2010","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","article-title":"Subspace pursuit for compressive sensing signal reconstruction","volume":"55","author":"Dai","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","article-title":"CoSaMP: Iterative signal recovery from incomplete and inaccurate samples","volume":"26","author":"Needell","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","article-title":"Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit","volume":"4","author":"Needell","year":"2010","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","article-title":"Iterative hard thresholding for compressed sensing","volume":"27","author":"Blumensath","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/TSP.2011.2173682","article-title":"Projection-based and look-ahead strategies for atom selection","volume":"60","author":"Chatterjee","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Sundman, D., Chatterjee, S., and Skoglund, M. (2011, January 19\u201321). Look Ahead Parallel Pursuit. Proceedings of IEEE Swedish Communication Technologies Workshop (Swe-CTW 2011), Stockholm, Sweden.","DOI":"10.1109\/Swe-CTW.2011.6082477"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Sundman, D., Chatterjee, S., and Skoglund, M. (2012, January 24\u201326). FROGS: A Serial Reversible Greedy Search Algorithm. Proceedings of IEEE Swedish Communication Technologies Workshop (Swe-CTW 2012), Lund, Sweden.","DOI":"10.1109\/Swe-CTW.2012.6376286"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Sundin, M., Sundman, D., and Jansson, M. (2013, January 26\u201331). Beamformers for Sparse Recovery. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013), Vancouver, BC, Canada.","DOI":"10.1109\/ICASSP.2013.6638800"},{"key":"ref_52","unstructured":"Pati, Y.C., Rezaiifar, R., and Krishnaprasad, P.S. (2013, January 3\u20136). Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition. Proceedings of the 27th Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"4395","DOI":"10.1109\/TIT.2010.2054653","article-title":"Analysis of orthogonal matching pursuit using the restricted isometry property","volume":"56","author":"Davenport","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1109\/TIT.2011.2177632","article-title":"The orthogonal super greedy algorithm and applications in compressed sensing","volume":"58","author":"Liu","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_55","unstructured":"Maleh, R. Improved RIP Analysis of Orthogonal Matching Pursuit. Available online: http:\/\/arxiv.org\/abs\/1102.4311."},{"key":"ref_56","unstructured":"Tropp, J.A., Gilbert, A.C., and Strauss, M.J. (2005, January 18\u201323). Simultaneous Sparse Approximation via Greedy Pursuit. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, Honolulu, HI, USA."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/j.sigpro.2005.05.030","article-title":"Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit","volume":"86","author":"Tropp","year":"2006","journal-title":"Signal Process."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Zhang, W., Ma, C., Wang, W., Liu, Y., and Zhang, L. (2010, January 24\u201326). Side Information Based Orthogonal Matching Pursuit in Distributed Compressed Sensing. Proceedings of IEEE International Conference on Network Infrastructure and Digital Content (ICNIDC 2010), Beijing, China.","DOI":"10.1109\/ICNIDC.2010.5657901"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Sundman, D., Chatterjee, S., and Skoglund, M. (2012, January 25\u201330). A Greedy Pursuit Algorithm for Distributed Compressed Sensing. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2012), Kyoto, Japan.","DOI":"10.1109\/ICASSP.2012.6288481"},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Wimalajeewa, T., and Varshney, P.K. (2013, January 26\u201331). Cooperative Sparsity Pattern Recovery in Distributed Networks via Distributed-OMP. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2013), Vancouver, BC, Canada.","DOI":"10.1109\/ICASSP.2013.6638672"},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Zachariah, D., Chatterjee, S., and Jansson, M. (2012, January 25\u201330). Dynamic Subspace Pursuit. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2012), Kyoto, Japan.","DOI":"10.1109\/ICASSP.2012.6288696"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"4967","DOI":"10.1109\/TSP.2012.2203813","article-title":"Dynamic iterative pursuit","volume":"60","author":"Zachariah","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Patterson, S., Eldar, Y.C., and Keidar, I. (2013, January 26\u201331). Distributed Sparse Signal Recovery for Sensor Networks. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2013), Vancouver, BC, Canada.","DOI":"10.1109\/ICASSP.2013.6638510"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Reeves, G., and Gastpar, M. (2009, January 4\u20137). A Note on Optimal Support Recovery in Compressed Sensing. Proceedings of the Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2009.5470153"}],"container-title":["Journal of Sensor and Actuator Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2224-2708\/3\/1\/1\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:51:35Z","timestamp":1760219495000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2224-2708\/3\/1\/1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,23]]},"references-count":64,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2014,3]]}},"alternative-id":["jsan3010001"],"URL":"https:\/\/doi.org\/10.3390\/jsan3010001","relation":{},"ISSN":["2224-2708"],"issn-type":[{"value":"2224-2708","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,23]]}}}