{"id":"https://openalex.org/W2765473554","doi":"https://doi.org/10.23919/eusipco.2017.8081586","title":"Multi denoising approximate message passing for optimal recovery with lower computational cost","display_name":"Multi denoising approximate message passing for optimal recovery with lower computational cost","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2765473554","doi":"https://doi.org/10.23919/eusipco.2017.8081586","mag":"2765473554"},"language":"en","primary_location":{"id":"doi:10.23919/eusipco.2017.8081586","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2017.8081586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 25th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/b8553fb0-9fdb-412e-91ae-e8e748bb074a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074333189","display_name":"Alessandro Perelli","orcid":"https://orcid.org/0000-0002-0511-2293"},"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":"Alessandro Perelli","raw_affiliation_strings":["Institute for Digital Communications, The University of Edinburgh, (UK)"],"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, The University of Edinburgh, (UK)","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","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)"],"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, The University of Edinburgh, (UK)","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074333189"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15535742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2131","last_page":"2135"},"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/T10522","display_name":"Medical Imaging Techniques and Applications","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2741","display_name":"Radiology, Nuclear Medicine and Imaging"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12015","display_name":"Photoacoustic and Ultrasonic Imaging","score":0.9968000054359436,"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/computer-science","display_name":"Computer science","score":0.7039653658866882},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.646310031414032},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5379785299301147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5092657804489136},{"id":"https://openalex.org/keywords/iterative-reconstruction","display_name":"Iterative reconstruction","score":0.4755648970603943},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.45040541887283325},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4503558576107025},{"id":"https://openalex.org/keywords/fidelity","display_name":"Fidelity","score":0.4138084053993225},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3060792088508606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1799820363521576}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7039653658866882},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.646310031414032},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5379785299301147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5092657804489136},{"id":"https://openalex.org/C141379421","wikidata":"https://www.wikidata.org/wiki/Q6094427","display_name":"Iterative reconstruction","level":2,"score":0.4755648970603943},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.45040541887283325},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4503558576107025},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.4138084053993225},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3060792088508606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1799820363521576},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.23919/eusipco.2017.8081586","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2017.8081586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 25th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:discovery.dundee.ac.uk:openaire_cris_publications/b3da322a-b8ef-4d01-8d9d-a57083878fad","is_oa":false,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/b3da322a-b8ef-4d01-8d9d-a57083878fad","pdf_url":null,"source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Perelli, A & Davies, M E 2017, Multi denoising approximate message passing for optimal recovery with lower computational cost. in 2017 25th European Signal Processing Conference (EUSIPCO)., 8081586, IEEE, pp. 2131-2135, 2017 25th European Signal Processing Conference (EUSIPCO), 28/08/17. https://doi.org/10.23919/EUSIPCO.2017.8081586","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:discovery.dundee.ac.uk:publications/b3da322a-b8ef-4d01-8d9d-a57083878fad","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/8081586/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Perelli, A & Davies, M E 2017, Multi denoising approximate message passing for optimal recovery with lower computational cost. in 2017 25th European Signal Processing Conference (EUSIPCO)., 8081586, IEEE, pp. 2131-2135, 2017 25th European Signal Processing Conference (EUSIPCO), 28/08/17. https://doi.org/10.23919/EUSIPCO.2017.8081586","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/b8553fb0-9fdb-412e-91ae-e8e748bb074a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/b8553fb0-9fdb-412e-91ae-e8e748bb074a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Perelli, A & Davies, M 2017, Multi Denoising Approximate Message Passing for Optimal Recovery with Lower Computational Cost. in Proceedings of the 25th European Signal Processing Conference (EUSIPCO). Institute of Electrical and Electronics Engineers, 25th European Signal Processing Conference (EUSIPCO) 2017, Kos, Greece, 28/08/17. https://doi.org/10.23919/EUSIPCO.2017.8081586","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/b8553fb0-9fdb-412e-91ae-e8e748bb074a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/multi-denoising-approximate-message-passing-for-optimal-recovery-with-lower-computational-cost(b8553fb0-9fdb-412e-91ae-e8e748bb074a).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/b8553fb0-9fdb-412e-91ae-e8e748bb074a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/b8553fb0-9fdb-412e-91ae-e8e748bb074a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Perelli, A & Davies, M 2017, Multi Denoising Approximate Message Passing for Optimal Recovery with Lower Computational Cost. in Proceedings of the 25th European Signal Processing Conference (EUSIPCO). Institute of Electrical and Electronics Engineers, 25th European Signal Processing Conference (EUSIPCO) 2017, Kos, Greece, 28/08/17. https://doi.org/10.23919/EUSIPCO.2017.8081586","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1946258363","https://openalex.org/W2044810215","https://openalex.org/W2094757833","https://openalex.org/W2132001804","https://openalex.org/W2219834096","https://openalex.org/W2296112516","https://openalex.org/W2531862309","https://openalex.org/W2950991820","https://openalex.org/W2963676935","https://openalex.org/W2963706461","https://openalex.org/W3123837026","https://openalex.org/W6697452822"],"related_works":["https://openalex.org/W2158224665","https://openalex.org/W2379589510","https://openalex.org/W2381850946","https://openalex.org/W4380449851","https://openalex.org/W4300044672","https://openalex.org/W2810730439","https://openalex.org/W1881631164","https://openalex.org/W2896778670","https://openalex.org/W2792172447","https://openalex.org/W4224883704"],"abstract_inverted_index":{"An":[0],"emerging":[1],"issue":[2],"in":[3,17,19,42,54,129],"large-scale":[4],"inverse":[5],"problems":[6],"is":[7,27,136],"constituted":[8],"by":[9,87,166],"the":[10,48,97,123,140,148,151,160,175,192],"interdependency":[11],"between":[12],"computational":[13,37,168],"and":[14,60,94,117,170,190],"recovery":[15,152],"performance;":[16],"particular":[18],"practical":[20],"application,":[21],"such":[22],"as":[23,99,128],"medical":[24],"imaging,":[25],"it":[26],"crucial":[28],"to":[29,121,154,198],"provide":[30],"high":[31],"quality":[32],"estimates":[33],"given":[34,181],"bounds":[35],"on":[36,66,138],"time.":[38],"While":[39],"most":[40,125],"work":[41],"this":[43,55],"direction":[44],"has":[45],"gone":[46],"down":[47],"lines":[49],"of":[50,85,133,144,150,194],"improving":[51],"optimisation":[52],"schemes,":[53],"paper":[56],"we":[57,188],"are":[58],"proposing":[59],"investigating":[61],"a":[62,67,90,103,156,163],"different":[63],"approach":[64,135],"based":[65,137],"multi":[68],"denoising":[69],"approximate":[70],"message":[71],"passing":[72],"(MultiD-AMP)":[73],"framework":[74,177],"for":[75,102,158,178,196],"Compressive":[76],"Sensing":[77],"(CS)":[78],"image":[79,179,199],"reconstruction":[80,110,180],"which":[81,146],"exploits":[82],"an":[83,108],"hierarchy":[84],"denoisers":[86],"starting":[88,100],"with":[89],"low":[91],"fidelity":[92,105],"model":[93],"then":[95],"using":[96,122],"estimate":[98],"point":[101],"higher":[104],"models":[106],"through":[107],"iterative":[109],"algorithm.":[111],"MultiD-AMP":[112,176,195],"achieves":[113],"lower":[114],"time":[115],"complexity":[116,169],"same":[118,124],"accuracy":[119],"compared":[120],"accurate":[126],"denoiser":[127,161],"D-AMP.":[130],"The":[131],"novelty":[132],"our":[134],"exploiting":[139],"deterministic":[141],"state":[142],"evolution":[143],"AMP,":[145],"means":[147],"predictability":[149],"performances,":[153],"design":[155],"strategy":[157],"selecting":[159],"from":[162],"set":[164],"ordered":[165],"both":[167],"statistical":[171],"efficiency.":[172],"We":[173],"apply":[174],"noisy":[182],"Gaussian":[183],"random":[184],"linear":[185],"measurements.":[186],"Furthermore,":[187],"extend":[189],"show":[191],"applicability":[193],"CS":[197],"reconstruction.":[200]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}