{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T05:21:38Z","timestamp":1771651298386,"version":"3.50.1"},"reference-count":25,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2017,4,20]],"date-time":"2017-04-20T00:00:00Z","timestamp":1492646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>We consider the joint sparsity Model 1 (JSM-1) in a decentralized scenario, where a number of sensors are connected through a network and there is no fusion center. A novel algorithm, named distributed compact sensing matrix pursuit (DCSMP), is proposed to exploit the computational and communication capabilities of the sensor nodes. In contrast to the conventional distributed compressed sensing algorithms adopting a random sensing matrix, the proposed algorithm focuses on the deterministic sensing matrices built directly on the real acquisition systems. The proposed DCSMP algorithm can be divided into two independent parts, the common and innovation support set estimation processes. The goal of the common support set estimation process is to obtain an estimated common support set by fusing the candidate support set information from an individual node and its neighboring nodes. In the following innovation support set estimation process, the measurement vector is projected into a subspace that is perpendicular to the subspace spanned by the columns indexed by the estimated common support set, to remove the impact of the estimated common support set. We can then search the innovation support set using an orthogonal matching pursuit (OMP) algorithm based on the projected measurement vector and projected sensing matrix. In the proposed DCSMP algorithm, the process of estimating the common component\/support set is decoupled with that of estimating the innovation component\/support set. Thus, the inaccurately estimated common support set will have no impact on estimating the innovation support set. It is proven that under the condition the estimated common support set contains the true common support set, the proposed algorithm can find the true innovation set correctly. Moreover, since the innovation support set estimation process is independent of the common support set estimation process, there is no requirement for the cardinality of both sets; thus, the proposed DCSMP algorithm is capable of tackling the unknown sparsity problem successfully.<\/jats:p>","DOI":"10.3390\/s17040907","type":"journal-article","created":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T04:51:46Z","timestamp":1492750306000},"page":"907","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An Efficient Distributed Compressed Sensing Algorithm for Decentralized Sensor Network"],"prefix":"10.3390","volume":"17","author":[{"given":"Jing","family":"Liu","sequence":"first","affiliation":[{"name":"School of Electronics and Information Engineering, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3452-5000","authenticated-orcid":false,"given":"Kaiyu","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoxian","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,4,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.sigpro.2013.11.039","article-title":"Compressed Sensing by Collaborative Reconstruction on Overcomplete Dictionary","volume":"103","author":"Lin","year":"2014","journal-title":"Signal Process."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2122","DOI":"10.1109\/TASLP.2016.2598306","article-title":"Compressive Sensing-Based Speech Enhancement","volume":"24","author":"Wang","year":"2016","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Wang, D., Wan, J., and Chen, J. (2016). An Online Dictionary Learning-Based Compressive Data Gathering Algorithm in Wireless Sensor Networks. Sensors, 16.","DOI":"10.3390\/s16101547"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yin, J., Yang, Y., and Wang, L. (2016). An Adaptive Data Gathering Scheme for Multi-Hop Wireless Sensor Networks Based on Compressed Sensing and Network Coding. Sensors, 16.","DOI":"10.3390\/s16040462"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.sigpro.2015.11.024","article-title":"Regularized Smoothed l0 Norm Algorithm and its Application to CS-based Radar Imaging","volume":"122","author":"Bu","year":"2016","journal-title":"Signal Process."},{"key":"ref_6","unstructured":"Baron, D., Wakin, M., Duarte, M., Sarvotham, S., and Baraniuk, R. (2017, April 20). Distributed compressed sensing. Available online: http:\/\/ai2-s2-pdfs.s3.amazonaws.com\/6388\/e944d5929cb6490792429085ed31c0ad776b.pdf."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1049\/el.2013.3159","article-title":"Optimised projections for generalised distributed compressed sensing","volume":"50","author":"Zhang","year":"2014","journal-title":"Electron. Lett."},{"key":"ref_8","first-page":"37","article-title":"Distributed compressive spectrum sensing in cooperative multihop cognitive networks","volume":"5","author":"Zeng","year":"2011","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/JSEN.2015.2504106","article-title":"Data reduction in wireless sensor networks: A hierarchical LMS prediction approach","volume":"16","author":"Tan","year":"2016","journal-title":"IEEE Sens. J."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.ins.2015.10.004","article-title":"Data prediction, compression, and recovery in clustered wireless sensor networks for environmental monitoring applications","volume":"329","author":"Wu","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"248","DOI":"10.3390\/s150100248","article-title":"A Structure Fidelity Approach for Big Data Collection in Wireless Sensor Networks","volume":"15","author":"Wu","year":"2015","journal-title":"Sensors"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2803","DOI":"10.1109\/TSP.2016.2523462","article-title":"Design and Analysis of a Greedy Pursuit for Distributed Compressed Sensing","volume":"64","author":"Sundman","year":"2016","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_13","unstructured":"Baron, D., Duarte, M.F., Sarvotham, S., Wakin, M.B., and Baraniuk, R.G. (2005, January 28\u201330). An information theoretic approach to distributed compressed sensing. Proceedings of the 43rd Allerton Conference Communication Control, and Computing, Monticello, IL, USA."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Schnelle, S.R., Laska, J.N., Hegde, C., Duarte, M.F., Davenport, M.A., and Baraniuk, R.G. (2010, January 14\u201319). Texas hold \u2019Em algorithms for distributed compressive sensing. Proceedings of the IEEE International Conference Acoustics, Speech and Signal Processing (ICASSP), Dallas, TX, USA.","DOI":"10.1109\/ICASSP.2010.5496168"},{"key":"ref_15","unstructured":"Coluccia, G., Magli, E., Roumy, A., and Toto-Zarasoa, V. (September, January 29). Lossy compression of distributed sparse sources: A practical scheme. Proceedings of the 2011 19th European Signal Processing Conference (EUSIPCO 11), Barcelona, Spain."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Valsesia, D., Coluccia, G., and Magli, E. (2013, January 3\u20136). Joint recovery algorithms using difference of innovations for distributed compressed sensing. Proceedings of the 2013 Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2013.6810309"},{"key":"ref_17","first-page":"225","article-title":"Distributed ADMM for In-Network Reconstruction of Sparse Signals With Innovations","volume":"1","author":"Matamoros","year":"2015","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.sigpro.2013.08.009","article-title":"Similar sensing matrix pursuit: An efficient reconstruction algorithm to cope with deterministic sensing matrix","volume":"95","author":"Liu","year":"2014","journal-title":"Signal Process."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.sigpro.2015.03.002","article-title":"General similar sensing matrix pursuit: An efficient and rigorous reconstruction algorithm to cope with deterministic sensing matrix with high coherence","volume":"114","author":"Liu","year":"2015","journal-title":"Signal Process."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Foucart, S., and Rauhut, H. (2013). A Mathematical Introduction to Compressive Sensing, Birkh\u00e4user and Springer. Applied and Numerical Harmonic Analysis.","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"ref_21","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. Harmonic Anal."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3598","DOI":"10.1109\/TWC.2012.081612.111908","article-title":"A Frechet Mean Approach for Compressive Sensing Date Acquisition and Reconstruction in Wireless Sensor Networks","volume":"11","author":"Chen","year":"2012","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Penrose, M. (2004). Random Geometric Graphs, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Chen, F., Wen, F., and Jia, H. (2010, January 23\u201325). Algorithm of Data Compression Based on Multiple Principal Component Analysis over the WSN. Proceedings of the 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM), Chengdu, China.","DOI":"10.1109\/WICOM.2010.5601180"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Ciancio, A., Pattem, S., Ortega, A., and Krishnamachari, B. (2006, January 19\u201321). Energy-efficient data representation and routing for wireless sensor networks based on a distributed wavelet compression algorithm. Proceedings of the Fifth International Conference on Information Processing in Sensor Networks (IPSN 2006), Nashville, TN, USA.","DOI":"10.1109\/IPSN.2006.243819"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/4\/907\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:33:04Z","timestamp":1760207584000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/4\/907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,20]]},"references-count":25,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,4]]}},"alternative-id":["s17040907"],"URL":"https:\/\/doi.org\/10.3390\/s17040907","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,20]]}}}