{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:09:16Z","timestamp":1771700956560,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1016\/j.sigpro.2024.109684","type":"journal-article","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T16:16:02Z","timestamp":1725034562000},"page":"109684","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Robust sensing matrix design for the Orthogonal Matching Pursuit algorithm in compressive sensing"],"prefix":"10.1016","volume":"227","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9271-5588","authenticated-orcid":false,"given":"Bo","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1311-9109","authenticated-orcid":false,"given":"Shuai","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaobing","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Chi","family":"Han","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3821-371X","authenticated-orcid":false,"given":"Yao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.sigpro.2024.109684_b1","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. Inform. Theory"},{"issue":"2","key":"10.1016\/j.sigpro.2024.109684_b2","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Candes","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/j.sigpro.2024.109684_b3","doi-asserted-by":"crossref","first-page":"1994","DOI":"10.1109\/TSP.2007.911494","article-title":"Dictionary preconditioning for greedy algorithms","volume":"56","author":"Schnass","year":"2008","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"10.1016\/j.sigpro.2024.109684_b4","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/LSP.2011.2168517","article-title":"Dictionaries construction using alternating projection method in compressive sensing","volume":"18","author":"Li","year":"2011","journal-title":"IEEE Signal Process. Lett."},{"issue":"3","key":"10.1016\/j.sigpro.2024.109684_b5","first-page":"386","article-title":"A re-weighted algorithm for designing data dependent sensing dictionary","volume":"6","author":"Anmin","year":"2011","journal-title":"Int. J. Phys. Sci."},{"issue":"12","key":"10.1016\/j.sigpro.2024.109684_b6","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Candes","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"10.1016\/j.sigpro.2024.109684_b7","doi-asserted-by":"crossref","first-page":"1550","DOI":"10.1109\/TNNLS.2015.2512563","article-title":"Image super-resolution via adaptive \u2113p(0<p<1) regularization and sparse representation","volume":"27","author":"Cao","year":"2016","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"5","key":"10.1016\/j.sigpro.2024.109684_b8","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1109\/TNNLS.2019.2921404","article-title":"Minimization of fraction function penalty in compressed sensing","volume":"31","author":"Li","year":"2019","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"7","key":"10.1016\/j.sigpro.2024.109684_b9","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1109\/TNNLS.2014.2341654","article-title":"A neurodynamic optimization method for recovery of compressive sensed signals with globally converged solution approximating to l0 minimization","volume":"26","author":"Guo","year":"2015","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"9","key":"10.1016\/j.sigpro.2024.109684_b10","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1109\/TNNLS.2014.2361052","article-title":"Learning stable multilevel dictionaries for sparse representations","volume":"26","author":"Thiagarajan","year":"2015","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.sigpro.2024.109684_b11","unstructured":"Y.C. Pati, R. Rezaiifar, P.S. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, in: Proc. 27th Asilomar Conf. Signals, Syst., Comput., Vol. 1, 1993, pp. 40\u201344."},{"issue":"10","key":"10.1016\/j.sigpro.2024.109684_b12","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","article-title":"Greed is good: Algorithmic results for sparse approximation","volume":"50","author":"Tropp","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.sigpro.2024.109684_b13","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1109\/LSP.2018.2878061","article-title":"Average performance of orthogonal matching pursuit (OMP) for sparse approximation","volume":"25","author":"Schnass","year":"2018","journal-title":"IEEE Signal Process. Lett."},{"key":"10.1016\/j.sigpro.2024.109684_b14","doi-asserted-by":"crossref","first-page":"5031","DOI":"10.1109\/TSP.2020.3016571","article-title":"Signal-dependent performance analysis of orthogonal matching pursuit for exact sparse recovery","volume":"68","author":"Wen","year":"2020","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2024.109684_b15","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1109\/LSP.2022.3167313","article-title":"Average performance of OMP and thresholding under dictionary mismatch","volume":"29","author":"Pali","year":"2022","journal-title":"IEEE Signal Process. Lett."},{"issue":"6","key":"10.1016\/j.sigpro.2024.109684_b16","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1109\/TSP.2016.2634550","article-title":"A sharp condition for exact support recovery with orthogonal matching pursuit","volume":"65","author":"Wen","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"issue":"12","key":"10.1016\/j.sigpro.2024.109684_b17","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. Inform. Theory"},{"issue":"2","key":"10.1016\/j.sigpro.2024.109684_b18","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","article-title":"Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit","volume":"58","author":"Donoho","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/j.sigpro.2024.109684_b19","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."},{"issue":"12","key":"10.1016\/j.sigpro.2024.109684_b20","doi-asserted-by":"crossref","first-page":"6202","DOI":"10.1109\/TSP.2012.2218810","article-title":"Generalized orthogonal matching pursuit","volume":"60","author":"Wang","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"10.1016\/j.sigpro.2024.109684_b21","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. Inform. Theory"},{"issue":"12","key":"10.1016\/j.sigpro.2024.109684_b22","doi-asserted-by":"crossref","first-page":"5695","DOI":"10.1109\/TSP.2007.900760","article-title":"Optimized projections for compressed sensing","volume":"55","author":"Elad","year":"2007","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"10.1016\/j.sigpro.2024.109684_b23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","article-title":"A simple proof of the restricted isometry property for random matrices","volume":"28","author":"Baraniuk","year":"2008","journal-title":"Constr. Approx."},{"issue":"10","key":"10.1016\/j.sigpro.2024.109684_b24","doi-asserted-by":"crossref","first-page":"4678","DOI":"10.3390\/s23104678","article-title":"Comparison of common algorithms for single-pixel imaging via compressed sensing","volume":"23","author":"Zhao","year":"2023","journal-title":"Sensors"},{"key":"10.1016\/j.sigpro.2024.109684_b25","doi-asserted-by":"crossref","unstructured":"R. Baraniuk, P. Steeghs, Compressive Radar Imaging, in: 2007 IEEE Radar Conference, 2007, pp. 128\u2013133, http:\/\/dx.doi.org\/10.1109\/RADAR.2007.374203.","DOI":"10.1109\/RADAR.2007.374203"},{"issue":"4","key":"10.1016\/j.sigpro.2024.109684_b26","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1016\/j.sigpro.2011.10.012","article-title":"A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensing","volume":"92","author":"Abolghasemi","year":"2012","journal-title":"Signal Process."},{"issue":"9","key":"10.1016\/j.sigpro.2024.109684_b27","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":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.sigpro.2024.109684_b28","series-title":"Efficient Implementation of the K-SVD Algorithm and the Batch-OMP Method","author":"Rubinstein","year":"2008"},{"key":"10.1016\/j.sigpro.2024.109684_b29","doi-asserted-by":"crossref","first-page":"6300","DOI":"10.1109\/TSP.2022.3233253","article-title":"Extended successive convex approximation for phase retrieval with dictionary learning","volume":"70","author":"Liu","year":"2022","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168424003049?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168424003049?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T03:41:50Z","timestamp":1731123710000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168424003049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":29,"alternative-id":["S0165168424003049"],"URL":"https:\/\/doi.org\/10.1016\/j.sigpro.2024.109684","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robust sensing matrix design for the Orthogonal Matching Pursuit algorithm in compressive sensing","name":"articletitle","label":"Article Title"},{"value":"Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sigpro.2024.109684","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109684"}}