{"id":"https://openalex.org/W3045962362","doi":"https://doi.org/10.23919/eusipco47968.2020.9287711","title":"DeepMP for Non\u2013Negative Sparse Decomposition","display_name":"DeepMP for Non\u2013Negative Sparse Decomposition","publication_year":2020,"publication_date":"2020-12-18","ids":{"openalex":"https://openalex.org/W3045962362","doi":"https://doi.org/10.23919/eusipco47968.2020.9287711","mag":"3045962362"},"language":"en","primary_location":{"id":"doi:10.23919/eusipco47968.2020.9287711","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco47968.2020.9287711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 28th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.research.ed.ac.uk/en/publications/d89d1451-a36d-490e-ae22-ca7f252d4978","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047346193","display_name":"Konstantinos Voulgaris","orcid":"https://orcid.org/0000-0001-6657-6430"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Konstantinos A. Voulgaris","raw_affiliation_strings":["Institute for Digital Communications, the University of Edinburgh, UK","Institute for Digital Communications, the University of Edinburgh,UK,EH9 3JL"],"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, the University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Institute for Digital Communications, the University of Edinburgh,UK,EH9 3JL","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057962470","display_name":"Mike E. Davies","orcid":"https://orcid.org/0000-0003-2327-236X"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mike E. Davies","raw_affiliation_strings":["Institute for Digital Communications, the University of Edinburgh, UK","Institute for Digital Communications, the University of Edinburgh,UK,EH9 3JL"],"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, the University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Institute for Digital Communications, the University of Edinburgh,UK,EH9 3JL","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038313743","display_name":"Mehrdad Yaghoobi","orcid":"https://orcid.org/0000-0002-9847-8234"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mehrdad Yaghoobi","raw_affiliation_strings":["Institute for Digital Communications, the University of Edinburgh, UK","University of Edinburgh,"],"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, the University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh,","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047346193"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08691614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2035","last_page":"2039"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"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":0.9998000264167786,"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.9997000098228455,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.7444818615913391},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6667035818099976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5892441868782043},{"id":"https://openalex.org/keywords/coherence","display_name":"Coherence (philosophical gambling strategy)","score":0.5040354132652283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47157448530197144},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45054447650909424},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4391283392906189},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3867446780204773},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35012340545654297},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3363657593727112},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29702550172805786},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.2225322723388672}],"concepts":[{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.7444818615913391},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6667035818099976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5892441868782043},{"id":"https://openalex.org/C2781181686","wikidata":"https://www.wikidata.org/wiki/Q4226068","display_name":"Coherence (philosophical gambling strategy)","level":2,"score":0.5040354132652283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47157448530197144},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45054447650909424},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4391283392906189},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3867446780204773},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35012340545654297},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3363657593727112},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29702550172805786},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.2225322723388672},{"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.23919/eusipco47968.2020.9287711","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco47968.2020.9287711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 28th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/d89d1451-a36d-490e-ae22-ca7f252d4978","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d89d1451-a36d-490e-ae22-ca7f252d4978","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Voulgaris, K, Davies, M & Yaghoobi Vaighan, M 2020, 'DeepMP for Non-Negative Sparse Decomposition', Paper presented at 2020 28th European Signal Processing Conference (EUSIPCO), Amsterdam, Netherlands, 18/01/21 - 21/01/21 pp. 2035-2039. https://doi.org/10.23919/Eusipco47968.2020.9287711","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2007.14281","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2007.14281","pdf_url":"https://arxiv.org/pdf/2007.14281","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3045962362","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2007.14281.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.ed.ac.uk:publications/d89d1451-a36d-490e-ae22-ca7f252d4978","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/deepmp-for-nonnegative-sparse-decomposition(d89d1451-a36d-490e-ae22-ca7f252d4978).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Voulgaris, K, Davies, M & Yaghoobi Vaighan, M 2020, 'DeepMP for Non-Negative Sparse Decomposition', Paper presented at 2020 28th European Signal Processing Conference (EUSIPCO), Amsterdam, Netherlands, 18/01/21 - 21/01/21 pp. 2035-2039. https://doi.org/10.23919/Eusipco47968.2020.9287711","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.2007.14281","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2007.14281","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/d89d1451-a36d-490e-ae22-ca7f252d4978","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d89d1451-a36d-490e-ae22-ca7f252d4978","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Voulgaris, K, Davies, M & Yaghoobi Vaighan, M 2020, 'DeepMP for Non-Negative Sparse Decomposition', Paper presented at 2020 28th European Signal Processing Conference (EUSIPCO), Amsterdam, Netherlands, 18/01/21 - 21/01/21 pp. 2035-2039. https://doi.org/10.23919/Eusipco47968.2020.9287711","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1927786901","display_name":null,"funder_award_id":"EP/S000631/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8726282573","display_name":null,"funder_award_id":"EP/K014277/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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1980454827","https://openalex.org/W2032944446","https://openalex.org/W2080009974","https://openalex.org/W2103399651","https://openalex.org/W2118103795","https://openalex.org/W2125298866","https://openalex.org/W2132984323","https://openalex.org/W2139427956","https://openalex.org/W2145889472","https://openalex.org/W2164647001","https://openalex.org/W2165685007","https://openalex.org/W2953713768","https://openalex.org/W4247541366","https://openalex.org/W6677645113"],"related_works":["https://openalex.org/W2964275022","https://openalex.org/W2005625450","https://openalex.org/W2156642959","https://openalex.org/W2993928980","https://openalex.org/W2543969232","https://openalex.org/W2382782653","https://openalex.org/W147992333","https://openalex.org/W2884832266","https://openalex.org/W2999243450","https://openalex.org/W2118152081","https://openalex.org/W2948586274","https://openalex.org/W2428738952","https://openalex.org/W2271594777","https://openalex.org/W2205061450","https://openalex.org/W2152116910","https://openalex.org/W2281931456","https://openalex.org/W215835337","https://openalex.org/W2932421136","https://openalex.org/W2952320540","https://openalex.org/W2398880933"],"abstract_inverted_index":{"Non-negative":[0],"signals":[1],"form":[2,114],"an":[3],"important":[4],"class":[5],"of":[6,48,78,83,115,135],"sparse":[7],"signals.":[8],"Many":[9],"algorithms":[10,24],"have":[11,40],"already":[12],"beenproposed":[13],"to":[14,44,140],"recover":[15],"such":[16,52],"non-negative":[17,71,108],"representations,":[18],"where":[19],"greedy":[20,32,84,143],"and":[21,68],"convex":[22],"relaxed":[23],"are":[25,34],"among":[26],"the":[27,46,49,76,79,96,101,107,113,124,147],"most":[28],"popular":[29],"methods.":[30],"The":[31,81],"techniques":[33],"low":[35],"computational":[36],"cost":[37],"algorithms,":[38,62,85,144],"which":[39,63],"also":[41],"been":[42,55],"modified":[43],"incorporate":[45],"non-negativity":[47,77],"representations.":[50],"One":[51],"modification":[53],"has":[54],"proposed":[56,125],"for":[57],"Matching":[58],"Pursuit":[59],"(MP)":[60],"based":[61],"first":[64,105],"chooses":[65],"positive":[66],"coefficients":[67],"uses":[69],"a":[70,116,130],"optimisation":[72],"technique":[73],"that":[74,123],"guarantees":[75],"coefficients.":[80],"performance":[82],"like":[86],"all":[87],"non-exhaustive":[88],"search":[89],"methods,":[90],"suffer":[91],"from":[92],"high":[93],"coherence":[94],"with":[95],"linear":[97],"generative":[98],"model,":[99],"called":[100],"dictionary.":[102],"We":[103,120],"here":[104],"reformulate":[106],"matching":[109],"pursuit":[110],"algorithm":[111],"in":[112,133],"deep":[117],"neural":[118],"network.":[119],"then":[121],"show":[122],"model":[126],"after":[127],"training":[128],"yields":[129],"significant":[131],"improvement":[132],"terms":[134],"exact":[136],"recovery":[137],"performance,":[138],"compared":[139],"other":[141],"non-trained":[142],"while":[145],"keeping":[146],"complexity":[148],"low.":[149]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}