{"id":"https://openalex.org/W2047559543","doi":"https://doi.org/10.1109/acssc.2011.6190193","title":"Cyclic pure greedy algorithms for recovering compressively sampled sparse signals","display_name":"Cyclic pure greedy algorithms for recovering compressively sampled sparse signals","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2047559543","doi":"https://doi.org/10.1109/acssc.2011.6190193","mag":"2047559543"},"language":"en","primary_location":{"id":"doi:10.1109/acssc.2011.6190193","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2011.6190193","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://vbn.aau.dk/da/publications/a2ca66c5-ea5d-470e-9133-5093711219e6","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054217723","display_name":"Bob L. Sturm","orcid":"https://orcid.org/0000-0003-2549-6367"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Bob L. Sturm","raw_affiliation_strings":["Department of Architecture, Design and Media Technology, Aalborg University Copenhagen, Denmark","Department of Architecture, Design, and Media Technology, Aalborg University, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Architecture, Design and Media Technology, Aalborg University Copenhagen, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department of Architecture, Design, and Media Technology, Aalborg University, Copenhagen, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026658144","display_name":"Mads Gr\u00e6sb\u00f8ll Christensen","orcid":"https://orcid.org/0000-0003-3586-7969"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mads G. Christensen","raw_affiliation_strings":["Department of Architecture, Design and Media Technology, Aalborg University Copenhagen, Denmark","Dept. of Architecture, Design and Media Technology, Aalborg University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Architecture, Design and Media Technology, Aalborg University Copenhagen, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Dept. of Architecture, Design and Media Technology, Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041230403","display_name":"R\u00e9mi Gribonval","orcid":"https://orcid.org/0000-0002-9450-8125"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210133778","display_name":"Centre Inria de l'Universit\u00e9 de Rennes","ror":"https://ror.org/04040yw90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Remi Gribonval","raw_affiliation_strings":["INRIA-Rennes-Bretagne Atlantique, Rennes, France","Inria Rennes, Bretagne-Atlantique, Campus de Beaulieu, 35042 Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA-Rennes-Bretagne Atlantique, Rennes, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]},{"raw_affiliation_string":"Inria Rennes, Bretagne-Atlantique, Campus de Beaulieu, 35042 Cedex, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1143","last_page":"1147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11739","display_name":"Microwave Imaging and Scattering Analysis","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7374553680419922},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7167180180549622},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6113618016242981},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.6095062494277954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5606350898742676},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5439100861549377},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5404843091964722},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5177358984947205},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5100641846656799},{"id":"https://openalex.org/keywords/signal-recovery","display_name":"Signal recovery","score":0.5034684538841248},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.4601673483848572},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.365217000246048},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3036995530128479}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7374553680419922},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7167180180549622},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6113618016242981},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.6095062494277954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5606350898742676},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5439100861549377},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5404843091964722},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5177358984947205},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5100641846656799},{"id":"https://openalex.org/C2989281035","wikidata":"https://www.wikidata.org/wiki/Q120811","display_name":"Signal recovery","level":3,"score":0.5034684538841248},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.4601673483848572},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.365217000246048},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3036995530128479},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/acssc.2011.6190193","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2011.6190193","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/a2ca66c5-ea5d-470e-9133-5093711219e6","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/a2ca66c5-ea5d-470e-9133-5093711219e6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sturm, B L, Christensen, M G & Gribonval, R 2011, 'Cyclic Pure Greedy Algorithms for Recovering Compressively Sampled Sparse Signals', Asilomar Conference on Signals, Systems and Computers. Conference Record, pp. 1143-1147. https://doi.org/10.1109/ACSSC.2011.6190193","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.370.2245","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.370.2245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/76/61/99/PDF/SCG_04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.888.752","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.888.752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-00766199/document/","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00766199v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00766199","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ASILOMAR 2011 - Forty Fifth Asilomar Conference on Signals, Systems and Computers, Nov 2011, Asilomar, United States. pp.1143--1147, ⟨10.1109/ACSSC.2011.6190193⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/a2ca66c5-ea5d-470e-9133-5093711219e6","is_oa":true,"landing_page_url":"http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6190193","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sturm , B L , Christensen , M G & Gribonval , R 2011 , ' Cyclic Pure Greedy Algorithms for Recovering Compressively Sampled Sparse Signals ' , Asilomar Conference on Signals, Systems and Computers. Conference Record , pp. 1143-1147 . https://doi.org/10.1109/ACSSC.2011.6190193","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/a2ca66c5-ea5d-470e-9133-5093711219e6","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/a2ca66c5-ea5d-470e-9133-5093711219e6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sturm, B L, Christensen, M G & Gribonval, R 2011, 'Cyclic Pure Greedy Algorithms for Recovering Compressively Sampled Sparse Signals', Asilomar Conference on Signals, Systems and Computers. Conference Record, pp. 1143-1147. https://doi.org/10.1109/ACSSC.2011.6190193","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W43282915","https://openalex.org/W84497933","https://openalex.org/W228380312","https://openalex.org/W1498539055","https://openalex.org/W1908644376","https://openalex.org/W1986931325","https://openalex.org/W2021302824","https://openalex.org/W2054877413","https://openalex.org/W2065829287","https://openalex.org/W2082029531","https://openalex.org/W2100068253","https://openalex.org/W2112605393","https://openalex.org/W2116148865","https://openalex.org/W2116437043","https://openalex.org/W2128659236","https://openalex.org/W2145096794","https://openalex.org/W2151439195","https://openalex.org/W2151693816","https://openalex.org/W2154596889","https://openalex.org/W2160955696","https://openalex.org/W2160979406","https://openalex.org/W2296616510","https://openalex.org/W2540615876","https://openalex.org/W2540877014","https://openalex.org/W4231428347","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W2098521117","https://openalex.org/W3015194228","https://openalex.org/W2381127329","https://openalex.org/W4385694579","https://openalex.org/W2465351041","https://openalex.org/W4319793311","https://openalex.org/W2138498353","https://openalex.org/W1815093352","https://openalex.org/W2145977033","https://openalex.org/W2379256376"],"abstract_inverted_index":{"The":[0],"pure":[1],"greedy":[2],"algorithms":[3],"matching":[4],"pursuit":[5],"(MP)":[6],"and":[7,60,103],"complementary":[8],"MP":[9,59],"(CompMP)":[10],"are":[11,47],"extremely":[12],"computationally":[13,52],"simple,":[14],"but":[15,85],"can":[16,81,90],"perform":[17],"poorly":[18],"in":[19,77],"solving":[20],"the":[21,27,43,97],"linear":[22],"inverse":[23],"problems":[24],"posed":[25],"by":[26,37],"recovery":[28,68,92,99],"of":[29,45,101],"compressively":[30],"sampled":[31],"sparse":[32],"signals.":[33],"We":[34,74],"show":[35,56,88],"that":[36,57],"applying":[38],"a":[39],"cyclic":[40,71,105],"minimization":[41],"principle,":[42],"performance":[44],"both":[46,104],"significantly":[48],"improved":[49],"while":[50,58],"remaining":[51],"simple.":[53],"Our":[54],"simulations":[55,87],"CompMP":[61,102],"may":[62],"not":[63],"be":[64,82],"competitive":[65],"with":[66],"state-of-the-art":[67],"algorithms,":[69],"their":[70,79],"variations":[72],"are.":[73],"discuss":[75],"ways":[76],"which":[78],"complexity":[80],"further":[83],"reduced,":[84],"our":[86],"these":[89],"hurt":[91],"performance.":[93],"Finally,":[94],"we":[95],"derive":[96],"exact":[98],"condition":[100],"algorithms.":[106]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}