{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T22:37:24Z","timestamp":1755038244992,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901037"],"award-info":[{"award-number":["11901037"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2018YFC2000605"],"award-info":[{"award-number":["2018YFC2000605"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Sport University (BSU) Research Funds","award":["2018GJ002"],"award-info":[{"award-number":["2018GJ002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2951573","type":"journal-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T15:38:41Z","timestamp":1572968321000},"page":"167157-167171","source":"Crossref","is-referenced-by-count":1,"title":["New Bounds Based on RIP for the Sparse Matrix Recovery via the Weighted $\\ell_{2,1}$  Minimization"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1132-373X","authenticated-orcid":false,"given":"Huanmin","family":"Ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0222-7896","authenticated-orcid":false,"given":"Run","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2791580"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2896653"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2808906"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4959797"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ChinaSIP.2015.7230375"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-016-3458-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472502"},{"key":"ref34","first-page":"159","article-title":"A method to compute the determinant of a \n$5\\times5$\n matrix","volume":"2","author":"farhadian","year":"2018","journal-title":"Open J Math Sci"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2010.05.025"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2167214"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2018.06.027"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2014.03.040"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.10.004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2218810"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2853158"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2820804"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2018.2811438"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2016.01.027"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2301980"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.07.010"},{"key":"ref27","article-title":"Stochastic greedy algorithms for multiple measurement vectors","author":"qin","year":"2017","journal-title":"arXiv 1711 01521"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.04.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2833121"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2506989"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288639"},{"key":"ref8","first-page":"483","article-title":"Weighted \n$\\ell_{1}$\n minimization for sparse recovery with prior information","author":"khajehnejad","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2876365"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2051150"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.2015.2406332"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.007"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288355"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICBBE.2009.5163167"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2195488"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2050477"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1186\/s13660-017-1601-y"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08891695.pdf?arnumber=8891695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:15Z","timestamp":1641987135000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8891695\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2951573","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}