An RIP Condition for Exact Support Recovery With Covariance-Assisted Matching Pursuit
The covariance-assisted matching pursuit (CAMP) algorithm has recently been proposed for recovering sparse signals <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula> from noisy linear measurements based on a priori knowledge of th...
Saved in:
| Published in | IEEE signal processing letters Vol. 26; no. 3; pp. 520 - 524 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
IEEE
01.03.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1070-9908 1558-2361 |
| DOI | 10.1109/LSP.2019.2896543 |
Cover
| Abstract | The covariance-assisted matching pursuit (CAMP) algorithm has recently been proposed for recovering sparse signals <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula> from noisy linear measurements based on a priori knowledge of the covariance and mean of the nonzero coefficients of <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula>. It utilizes the a priori knowledge by incorporating the Gauss-Markov theorem into the orthogonal matching pursuit (OMP) algorithm and has a significantly better reconstruction performance than OMP. This letter develops sufficient conditions of exact support recovery of any <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>-sparse signals <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula> via CAMP in <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula> iterations, under the <inline-formula><tex-math notation="LaTeX">\ell _2</tex-math></inline-formula>-bounded and Gaussian noises. These sufficient conditions are based on the restricted isometry constant of the sensing matrix and minimum magnitude of the nonzero elements of <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula>, and are much better than the existing ones. |
|---|---|
| AbstractList | The covariance-assisted matching pursuit (CAMP) algorithm has recently been proposed for recovering sparse signals <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula> from noisy linear measurements based on a priori knowledge of the covariance and mean of the nonzero coefficients of <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula>. It utilizes the a priori knowledge by incorporating the Gauss-Markov theorem into the orthogonal matching pursuit (OMP) algorithm and has a significantly better reconstruction performance than OMP. This letter develops sufficient conditions of exact support recovery of any <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>-sparse signals <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula> via CAMP in <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula> iterations, under the <inline-formula><tex-math notation="LaTeX">\ell _2</tex-math></inline-formula>-bounded and Gaussian noises. These sufficient conditions are based on the restricted isometry constant of the sensing matrix and minimum magnitude of the nonzero elements of <inline-formula><tex-math notation="LaTeX">\boldsymbol {f}</tex-math></inline-formula>, and are much better than the existing ones. The covariance-assisted matching pursuit (CAMP) algorithm has recently been proposed for recovering sparse signals [Formula Omitted] from noisy linear measurements based on a priori knowledge of the covariance and mean of the nonzero coefficients of [Formula Omitted]. It utilizes the a priori knowledge by incorporating the Gauss–Markov theorem into the orthogonal matching pursuit (OMP) algorithm and has a significantly better reconstruction performance than OMP. This letter develops sufficient conditions of exact support recovery of any [Formula Omitted]-sparse signals [Formula Omitted] via CAMP in [Formula Omitted] iterations, under the [Formula Omitted]-bounded and Gaussian noises. These sufficient conditions are based on the restricted isometry constant of the sensing matrix and minimum magnitude of the nonzero elements of [Formula Omitted], and are much better than the existing ones. |
| Author | Wang, Libo Ge, Huanmin Wen, Jinming Xian, Jun |
| Author_xml | – sequence: 1 givenname: Huanmin surname: Ge fullname: Ge, Huanmin email: gehuanmin@163.com organization: Sports Engineering College, Beijing Sport University, Beijing, China – sequence: 2 givenname: Libo orcidid: 0000-0003-4828-9221 surname: Wang fullname: Wang, Libo email: wanglibo12b@mails.ucas.ac.cn organization: College of Information Science and Technology, Jinan University, Guangzhou, China – sequence: 3 givenname: Jinming orcidid: 0000-0002-8181-0958 surname: Wen fullname: Wen, Jinming email: jinming.wen@mail.mcgill.ca organization: College of Information Science and Technology, Jinan University, Guangzhou, China – sequence: 4 givenname: Jun surname: Xian fullname: Xian, Jun email: xianjun@mail.sysu.edu.cn organization: Department of Mathematics, Sun Yat-sen University, Guangzhou, China |
| BookMark | eNp9kM9PwjAUxxuDiYDeTbw08Tzs61jXHglBJcFIQOJx6bZWSrDFtiPy3zsC8eDB03uH7-f9-PRQxzqrELoFMgAg4mG2nA8oATGgXLBsmF6gLmQZT2jKoNP2JCeJEIRfoV4IG0IIB5510Wpk8WI6x2NnaxONs1g7jyffsop42ex2zke8UJXbK3_A7yau2-ReeiNtpZJRCCZEVeMXGau1sR943vjQmHiNLrXcBnVzrn20epy8jZ-T2evTdDyaJRUVEBPKOAzzvNYlhToHBcA0UUyLrB7WZdYeyEuhyxIo6CznlOuaUWAMeM5ELknaR_enuTvvvhoVYrFxjbftyoICb0fznGZtip1SlXcheKWLykR5fDZ6abYFkOKosGgVFkeFxVlhC5I_4M6bT-kP_yF3J8QopX7jnKWEUEh_AJBwfL0 |
| CODEN | ISPLEM |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2021_3054807 crossref_primary_10_1109_ACCESS_2024_3386223 crossref_primary_10_1109_OJVT_2023_3300464 crossref_primary_10_1007_s00034_022_01972_1 crossref_primary_10_1109_TSP_2020_3016571 crossref_primary_10_1109_TVT_2023_3315325 crossref_primary_10_1016_j_sigpro_2019_05_016 |
| Cites_doi | 10.3934/ipi.2015.9.231 10.1109/TIT.2007.909108 10.1109/TIT.2014.2338314 10.1109/TIT.2011.2146090 10.1109/TASL.2011.2168211 10.1109/LSP.2015.2506684 10.1109/ACCESS.2018.2853158 10.1109/TSP.2016.2568162 10.1109/TSP.2016.2634550 10.1109/TIT.2011.2162263 10.1109/TIT.2010.2054653 10.1109/ACSSC.1993.342465 10.1109/TSP.2017.2711543 10.1109/TIT.2004.834793 10.1109/TIT.2005.858979 10.1049/el.2013.2222 10.1109/ICASSP.2017.7953063 10.1109/LSP.2018.2816573 10.1109/LSP.2012.2233734 10.1109/TIT.2009.2016006 10.1109/TIP.2006.881969 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/LSP.2019.2896543 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2361 |
| EndPage | 524 |
| ExternalDocumentID | 10_1109_LSP_2019_2896543 8630021 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 11871248; 11422102; 11631015; 11871481; 61472024; U1433203 funderid: 10.13039/501100001809 – fundername: Fundamental Research Funds grantid: 21618331; 21618329; 17lgjc27 – fundername: Guangdong Provincial Government of China |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH AAYJJ ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TAE TN5 VH1 AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D RIG |
| ID | FETCH-LOGICAL-c291t-2681477dfb21d71e116f0e6f95d4db51858b9fbb121f57828fd62166187697a03 |
| IEDL.DBID | RIE |
| ISSN | 1070-9908 |
| IngestDate | Mon Jun 30 01:58:33 EDT 2025 Wed Oct 01 01:11:39 EDT 2025 Thu Apr 24 23:07:27 EDT 2025 Wed Aug 27 03:00:46 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c291t-2681477dfb21d71e116f0e6f95d4db51858b9fbb121f57828fd62166187697a03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-8181-0958 0000-0003-4828-9221 |
| PQID | 2184778725 |
| PQPubID | 75747 |
| PageCount | 5 |
| ParticipantIDs | crossref_citationtrail_10_1109_LSP_2019_2896543 crossref_primary_10_1109_LSP_2019_2896543 ieee_primary_8630021 proquest_journals_2184778725 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2019-03-01 |
| PublicationDateYYYYMMDD | 2019-03-01 |
| PublicationDate_xml | – month: 03 year: 2019 text: 2019-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE signal processing letters |
| PublicationTitleAbbrev | LSP |
| PublicationYear | 2019 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref23 ref15 ref14 ref20 ref22 ref10 ref21 ref2 ref1 ref17 ref16 ref19 ref8 ref7 ref9 ref4 ref3 ref6 ref5 wen (ref11) 0 mo (ref18) 2015 |
| References_xml | – ident: ref17 doi: 10.3934/ipi.2015.9.231 – ident: ref7 doi: 10.1109/TIT.2007.909108 – ident: ref16 doi: 10.1109/TIT.2014.2338314 – ident: ref9 doi: 10.1109/TIT.2011.2146090 – ident: ref5 doi: 10.1109/TASL.2011.2168211 – ident: ref1 doi: 10.1109/LSP.2015.2506684 – ident: ref10 doi: 10.1109/ACCESS.2018.2853158 – ident: ref19 doi: 10.1109/TSP.2016.2568162 – ident: ref20 doi: 10.1109/TSP.2016.2634550 – ident: ref13 doi: 10.1109/TIT.2011.2162263 – ident: ref8 doi: 10.1109/TIT.2010.2054653 – ident: ref2 doi: 10.1109/ACSSC.1993.342465 – year: 2015 ident: ref18 article-title: A sharp restricted isometry constant bound of orthogonal matching pursuit publication-title: 1501 01708 – ident: ref21 doi: 10.1109/TSP.2017.2711543 – ident: ref6 doi: 10.1109/TIT.2004.834793 – ident: ref12 doi: 10.1109/TIT.2005.858979 – ident: ref15 doi: 10.1049/el.2013.2222 – ident: ref3 doi: 10.1109/ICASSP.2017.7953063 – year: 0 ident: ref11 article-title: Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit publication-title: Appl Comput Harmon Anal – ident: ref22 doi: 10.1109/LSP.2018.2816573 – ident: ref14 doi: 10.1109/LSP.2012.2233734 – ident: ref23 doi: 10.1109/TIT.2009.2016006 – ident: ref4 doi: 10.1109/TIP.2006.881969 |
| SSID | ssj0008185 |
| Score | 2.3057156 |
| Snippet | The covariance-assisted matching pursuit (CAMP) algorithm has recently been proposed for recovering sparse signals <inline-formula><tex-math... The covariance-assisted matching pursuit (CAMP) algorithm has recently been proposed for recovering sparse signals [Formula Omitted] from noisy linear... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 520 |
| SubjectTerms | Algorithms Covariance Covariance matrices Covariance-assisted matching pursuit (CAMP) Gauss-Markov theorem Gaussian noise Markov processes Matched pursuit Matching Matching pursuit algorithms Noise measurement Recovery restricted isometry property (RIP) Sensors Signal processing algorithms Sparse matrices sparse recovery |
| Title | An RIP Condition for Exact Support Recovery With Covariance-Assisted Matching Pursuit |
| URI | https://ieeexplore.ieee.org/document/8630021 https://www.proquest.com/docview/2184778725 |
| Volume | 26 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1558-2361 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008185 issn: 1070-9908 databaseCode: RIE dateStart: 19940101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDI5gJzjwGojBQDlwQaJdE9qmOU7TpoEYmoCJ3aqmTcUE6tDWIuDXY_clXkLcekiqyHb8iO3PhJwwobRkoWdoS3EIULRtKM2kwT2w7xxBrPJhMKNrdzixL6fOdIWc1b0wWuu8-Eyb-Jnn8qN5mOFTWcdDfCjsGl8Vnlv0atVaFw1PUV9oGaBhvSolacnO1e0Ya7ikCcEFtlJ-MUH5TJUfiji3LoNNMqrOVRSVPJpZqszw_Rtk438PvkU2SjeTdgu52CYrOtkh65_AB5tk0k3ozcWY9uaYtQb2UPBfaf81CFOKsz7BL6cYnIKsv9H7WfoAK18gskYxMYCrKB8RHYEqx0csOs4Wy2yW7pLJoH_XGxrlkAUj5JKlBnc9ZgsRxYqzSDDNmBtb2o2lE9mRcoCqnpKxUoyzGKHvvThyOQOrDmpUisA63yONZJ7ofUJZoMH745YtQnCydKAwbeoGInajACTBaZFORXc_LBHIcRDGk59HIpb0gVM-csovOdUip_WO5wJ944-1TSR8va6keYu0K9b65fVc-hjXClBV3Dn4fdchWcN_F8VmbdJIF5k-Au8jVce52H0APoTTUQ |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDLamcQAOvAZiMCAHLkh0a0JfOU4INGBFE2yCW9W0qZhAG4IWAb8eu-0qXkLcekjUyHb8iO3PAPvcVVryyDO0qQQGKNoylObSEB7ad0EgVvkwGP_S6Y2s81v7tgaHVS-M1jovPtNt-sxz-fE0yuiprOMRPhR1jc_ZlmXZRbdWpXfJ9BQVhqaBOtabJSVN2elfD6iKS7YxvKBmyi9GKJ-q8kMV5_bldBn82cmKspL7dpaqdvT-DbTxv0dfgaXS0WTdQjJWoaYna7D4CX6wAaPuhF2dDdjxlPLWyCCGHiw7eQ2jlNG0T_TMGYWnKO1v7Gac3uHKF4ytSVAM5CtJSMx8VOb0jMUG2dNzNk7XYXR6MjzuGeWYBSMSkqeGcDxuuW6cKMFjl2vOncTUTiLt2IqVjVT1lEyU4oInBH7vJbEjONp1VKTSDc2jDahPphO9CYyHGv0_YVpuhG6WDhUlTp3QTZw4RFmwm9CZ0T2ISgxyGoXxEOSxiCkD5FRAnApKTjXhoNrxWOBv_LG2QYSv1pU0b0JrxtqgvKDPAUW2LiorYW_9vmsP5ntDvx_0zy4vtmGB_lOUnrWgnj5legd9kVTt5iL4AXrL1p4 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+RIP+Condition+for+Exact+Support+Recovery+With+Covariance-Assisted+Matching+Pursuit&rft.jtitle=IEEE+signal+processing+letters&rft.au=Ge%2C+Huanmin&rft.au=Wang%2C+Libo&rft.au=Wen%2C+Jinming&rft.au=Xian%2C+Jun&rft.date=2019-03-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1070-9908&rft.eissn=1558-2361&rft.volume=26&rft.issue=3&rft.spage=520&rft_id=info:doi/10.1109%2FLSP.2019.2896543&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1070-9908&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1070-9908&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1070-9908&client=summon |