{"id":"https://openalex.org/W2097854131","doi":"https://doi.org/10.1109/icassp.2013.6638758","title":"Behavior of greedy sparse representation algorithms on nested supports","display_name":"Behavior of greedy sparse representation algorithms on nested supports","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2097854131","doi":"https://doi.org/10.1109/icassp.2013.6638758","mag":"2097854131"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2013.6638758","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2013.6638758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017886311","display_name":"Boris Mailh\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Boris Mailhe","raw_affiliation_strings":["Centre for Digital Music, Queen Mary, University of London, UK","Centre for Digital Music, Queen Mary Univ. of London, London, UK"],"affiliations":[{"raw_affiliation_string":"Centre for Digital Music, Queen Mary, University of London, UK","institution_ids":["https://openalex.org/I166337079"]},{"raw_affiliation_string":"Centre for Digital Music, Queen Mary Univ. of London, London, UK","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"middle","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 Sturm","raw_affiliation_strings":["Audio Analysis Laboratory, Aalborg University, Copenhagen, Denmark","Audio Anal. Lab., Aalborg Univ. Copenhagen, Aalborg, Denmark"],"affiliations":[{"raw_affiliation_string":"Audio Analysis Laboratory, Aalborg University, Copenhagen, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Audio Anal. Lab., Aalborg Univ. Copenhagen, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066967599","display_name":"Mark D. Plumbley","orcid":"https://orcid.org/0000-0002-9708-1075"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark D. Plumbley","raw_affiliation_strings":["Centre for Digital Music, Queen Mary, University of London, UK","Centre for Digital Music, Queen Mary Univ. of London, London, UK"],"affiliations":[{"raw_affiliation_string":"Centre for Digital Music, Queen Mary, University of London, UK","institution_ids":["https://openalex.org/I166337079"]},{"raw_affiliation_string":"Centre for Digital Music, Queen Mary Univ. of London, London, UK","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017886311"],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":null,"apc_paid":null,"fwci":0.691,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72620669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"5710","last_page":"5714"},"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.9991999864578247,"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/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.8581773042678833},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.818493664264679},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.7572455406188965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6768229007720947},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.6180654764175415},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5858781337738037},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5588151216506958},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5200017094612122},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5163823366165161},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.417235791683197},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2886029779911041},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25725454092025757}],"concepts":[{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.8581773042678833},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.818493664264679},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.7572455406188965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6768229007720947},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.6180654764175415},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5858781337738037},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5588151216506958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5200017094612122},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5163823366165161},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.417235791683197},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2886029779911041},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25725454092025757},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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":2,"locations":[{"id":"doi:10.1109/icassp.2013.6638758","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2013.6638758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/7c2cfcd9-2dff-4113-be46-a3ef1221fd9b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/7c2cfcd9-2dff-4113-be46-a3ef1221fd9b","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mailh\u00e9, B, Sturm, B L & Plumbley, M 2013, Behavior of greedy sparse representation algorithms on nested supports. in 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE (Institute of Electrical and Electronics Engineers), I E E E International Conference on Acoustics, Speech and Signal Processing. Proceedings, pp. 5710-5714, IEEE International Conference on Acoustics, Speech and Signal Processing , Victoria, BC, Canada, 26/05/2013. https://doi.org/10.1109/ICASSP.2013.6638758","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1328280616","display_name":null,"funder_award_id":"EP/E045235/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6723506329","display_name":null,"funder_award_id":"EP/G007144/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W228380312","https://openalex.org/W2020768304","https://openalex.org/W2028781966","https://openalex.org/W2069763185","https://openalex.org/W2112605393","https://openalex.org/W2116148865","https://openalex.org/W2118297240","https://openalex.org/W2119197726","https://openalex.org/W2128659236","https://openalex.org/W2151693816","https://openalex.org/W2154332973","https://openalex.org/W2293318283","https://openalex.org/W7015824223"],"related_works":["https://openalex.org/W2098521117","https://openalex.org/W2465351041","https://openalex.org/W4385694579","https://openalex.org/W2340242818","https://openalex.org/W4300881421","https://openalex.org/W2103001330","https://openalex.org/W4319793311","https://openalex.org/W2241396314","https://openalex.org/W3015194228","https://openalex.org/W2381127329"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3],"study":[4],"the":[5,8,20,31,75,139,142],"links":[6],"between":[7],"recovery":[9],"properties":[10],"of":[11,33,61,68,77,107,141],"sparse":[12,121],"signals":[13,60,67,95,131],"for":[14,128],"Orthogonal":[15],"Matching":[16],"Pursuit":[17],"(OMP)":[18],"and":[19,44,47,109],"whole":[21],"General":[22],"MP":[23],"class":[24],"over":[25],"nested":[26],"supports.":[27],"We":[28,71,101],"show":[29,73],"that":[30,55,74,120],"optimality":[32,76],"those":[34],"algorithms":[35,123],"is":[36,41,79,134],"not":[37,65],"locally":[38],"nested:":[39,81],"there":[40],"a":[42,104],"dictionary":[43],"supports":[45],"I":[46,53],"J":[48,50],"with":[49,96],"included":[51],"in":[52],"such":[54],"OMP":[56,78,83],"will":[57],"recover":[58,85,92],"all":[59,66,86,93,129],"support":[62,69],"I,":[63],"but":[64],"J.":[70],"also":[72,102],"globally":[80],"if":[82,132],"can":[84,91,124],"s-sparse":[87,130],"signals,":[88],"then":[89],"it":[90],"s'-sparse":[94],"s'":[97],"smaller":[98],"than":[99,137],"s.":[100],"provide":[103],"tighter":[105],"version":[106],"Donoho":[108],"Elad's":[110],"spark":[111,140],"theorem,":[112],"which":[113],"allows":[114],"us":[115],"to":[116],"complete":[117],"Tropp's":[118],"proof":[119],"representation":[122],"only":[125],"be":[126],"optimal":[127],"s":[133],"strictly":[135],"lower":[136],"half":[138],"dictionary.":[143]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}