{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T17:28:54Z","timestamp":1784741334858,"version":"3.55.0"},"reference-count":34,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC of China","doi-asserted-by":"publisher","award":["11671213"],"award-info":[{"award-number":["11671213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>We propose the Rescaled Matching Pursuit (RMP) algorithm to recover sparse signals in high-dimensional Euclidean spaces. The RMP algorithm has less computational complexity than other greedy-type algorithms, such as Orthogonal Matching Pursuit (OMP). We show that if the restricted isometry property is satisfied, then the upper bound of the error between the original signal and its approximation can be derived. Furthermore, we prove that the RMP algorithm can find the correct support of sparse signals from random measurements with a high probability. Our numerical experiments also verify this conclusion and show that RMP is stable with the noise. So, the RMP algorithm is a suitable method for recovering sparse signals.<\/jats:p>","DOI":"10.3390\/axioms13050288","type":"journal-article","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T03:56:31Z","timestamp":1713930991000},"page":"288","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sparse Signal Recovery via Rescaled Matching Pursuit"],"prefix":"10.3390","volume":"13","author":[{"given":"Wan","family":"Li","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peixin","family":"Ye","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,4,24]]},"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":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Romberg","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2889","DOI":"10.1109\/TMM.2020.2967646","article-title":"Image compression based on compressive sensing: End-to-end comparison with JPEG","volume":"22","author":"Yuan","year":"2020","journal-title":"IEEE Trans. Multimed."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1109\/MCOM.2010.5621984","article-title":"Application of compressive sensing to sparse channel estimation","volume":"48","author":"Berger","year":"2010","journal-title":"IEEE Commun. Mag."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10827-022-00831-x","article-title":"Reconstruction of sparse recurrent connectivity and inputs from the nonlinear dynamics of neuronal networks","volume":"51","author":"Barranca","year":"2023","journal-title":"J. Comput. Neurosci."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Dai, W., Sheikh, M.A., Milenkovic, O., and Baraniuk, R.G. (2009). Compressive sensing DNA microarrays. EURASIP J. Bioinform. Syst. Biol., 2009.","DOI":"10.1155\/2009\/162824"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"150401","DOI":"10.1103\/PhysRevLett.105.150401","article-title":"Quantum state tomography via compressed sensing","volume":"105","author":"Gross","year":"2010","journal-title":"Phys. Rev. Lett."},{"key":"ref_8","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 Proc. Mag."},{"key":"ref_9","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_10","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.2013.2288639","article-title":"Sparse representation of a polytope and recovery of sparse signals and low-rank matrices","volume":"60","author":"Cai","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","article-title":"An interior-point method for large-scale \u21131-regularized least squares","volume":"1","author":"Kim","year":"2007","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"ref_12","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_13","first-page":"5","article-title":"Sparse signals reconstruction via adaptive iterative greedy algorithm","volume":"90","author":"Aziz","year":"2014","journal-title":"Int. J. Comput. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"7253","DOI":"10.1007\/s13369-017-3001-5","article-title":"Greedy algorithms for sparse signal recovery based on temporally correlated experimental data in WSNs","volume":"43","author":"Goyal","year":"2018","journal-title":"Arab. J. Sci. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"4017","DOI":"10.1109\/TSP.2020.3004700","article-title":"Greedy algorithms for sparse and positive signal recovery based on bit-wise MAP detection","volume":"68","author":"Chae","year":"2020","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1016\/j.sigpro.2010.05.034","article-title":"Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations","volume":"90","author":"Lv","year":"2010","journal-title":"Signal Process."},{"key":"ref_17","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_18","first-page":"435","article-title":"Projection pursuit","volume":"13","author":"Huber","year":"1985","journal-title":"Ann. Stat."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02124742","article-title":"Some remarks on greedy algorithms","volume":"5","author":"DeVore","year":"1996","journal-title":"Adv. Comput. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1214\/009053607000000631","article-title":"Approximation and learning by greedy algorithms","volume":"36","author":"Barron","year":"2008","journal-title":"Ann. Stat."},{"key":"ref_21","unstructured":"Pati, Y.C., Rezaiifar, R., and Krishnaprasad, P.S. (1993, January 1\u20133). Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. Proceedings of the 27th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Shao, C.F., Wei, X.J., Ye, P.X., and Xing, S. (2023). Efficiency of orthogonal matching pursuit for group sparse recovery. Axioms, 12.","DOI":"10.3390\/axioms12040389"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02678430","article-title":"Adaptive greedy approximations","volume":"13","author":"Davis","year":"1997","journal-title":"Constr. Approx."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"6215","DOI":"10.1109\/TIT.2011.2162263","article-title":"Sparse recovery with orthogonal matching pursuit under RIP","volume":"57","author":"Zhang","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Eldar, Y.C., and Kutyniok, G. (2012). Compressed Sensing: Theory and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511794308"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1016\/j.acha.2015.10.008","article-title":"Rescaled pure greedy algorithm for Hilbert and Banach spaces","volume":"41","author":"Petrova","year":"2016","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10092-019-0311-x","article-title":"Rescaled pure greedy algorithm for convex optimization","volume":"56","author":"Gao","year":"2019","journal-title":"Calcolo"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1186\/s13660-024-03077-6","article-title":"The learning performance of the weak rescaled pure greedy algorithms","volume":"2024","author":"Guo","year":"2024","journal-title":"J. Inequal. Appl."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2250048","DOI":"10.1142\/S0219691322500485","article-title":"Optimality of the rescaled pure greedy learning algorithms","volume":"21","author":"Zhang","year":"2023","journal-title":"Int. J. Wavelets Multiresolut. Inf. Process."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2150001","DOI":"10.1142\/S0219691321500016","article-title":"Efficiency of the weak rescaled pure greedy algorithm","volume":"19","author":"Jiang","year":"2021","journal-title":"Int. J. Wavelets Multiresolut. Inf. Process."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhang, W.H., Ye, P.X., Xing, S., and Xu, X. (2022). Optimality of the approximation and learning by the rescaled pure super greedy algorithms. Axioms, 11.","DOI":"10.3390\/axioms11090437"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10092-016-0183-2","article-title":"Greedy strategies for convex optimization","volume":"54","author":"Nguyen","year":"2017","journal-title":"Calcolo"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Temlyakov, V.N. (2011). Greedy Approximation, Cambridge University Press.","DOI":"10.1017\/CBO9780511762291"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Shao, C.F., Chang, J.C., Ye, P.X., Zhang, W.H., and Xing, S. (2022). Almost optimality of the orthogonal super greedy algorithm for \u03bc-coherent dictionaries. Axioms, 11.","DOI":"10.3390\/axioms11050186"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/5\/288\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:33:03Z","timestamp":1760106783000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/5\/288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,24]]},"references-count":34,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,5]]}},"alternative-id":["axioms13050288"],"URL":"https:\/\/doi.org\/10.3390\/axioms13050288","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,24]]}}}