{"id":"https://openalex.org/W2976284247","doi":"https://doi.org/10.1109/isit.2019.8849576","title":"Compressive Sensing with a Multiple Convex Sets Domain","display_name":"Compressive Sensing with a Multiple Convex Sets Domain","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976284247","doi":"https://doi.org/10.1109/isit.2019.8849576","mag":"2976284247"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","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/A5100438423","display_name":"Hang Zhang","orcid":"https://orcid.org/0000-0001-5019-7209"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hang Zhang","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005771765","display_name":"Afshin Abdi","orcid":"https://orcid.org/0000-0002-2038-4772"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Afshin Abdi","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083854532","display_name":"Faramarz Fekri","orcid":"https://orcid.org/0000-0001-5008-8803"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Faramarz Fekri","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100438423"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.387,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60406956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"592","last_page":"596"},"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.9998999834060669,"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.9998999834060669,"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/T10727","display_name":"Ultrasound Imaging and Elastography","score":0.9894999861717224,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9828000068664551,"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/compressed-sensing","display_name":"Compressed sensing","score":0.8210208415985107},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.668645977973938},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.6031395196914673},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5872669219970703},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5562569499015808},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5485138297080994},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5469928979873657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5012655258178711},{"id":"https://openalex.org/keywords/phase-retrieval","display_name":"Phase retrieval","score":0.4927389919757843},{"id":"https://openalex.org/keywords/signal","display_name":"SIGNAL (programming language)","score":0.48087552189826965},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46847668290138245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4656416177749634},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4344259202480316},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42083901166915894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3716665506362915},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2405821979045868},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14242023229599},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.07345974445343018},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0722220242023468}],"concepts":[{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.8210208415985107},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.668645977973938},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.6031395196914673},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5872669219970703},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5562569499015808},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5485138297080994},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5469928979873657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5012655258178711},{"id":"https://openalex.org/C81793267","wikidata":"https://www.wikidata.org/wiki/Q7180962","display_name":"Phase retrieval","level":3,"score":0.4927389919757843},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.48087552189826965},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46847668290138245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4656416177749634},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4344259202480316},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42083901166915894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3716665506362915},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2405821979045868},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14242023229599},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.07345974445343018},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0722220242023468},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W74946117","https://openalex.org/W143004564","https://openalex.org/W221278985","https://openalex.org/W568673721","https://openalex.org/W1650828317","https://openalex.org/W1874865363","https://openalex.org/W2044762091","https://openalex.org/W2077723394","https://openalex.org/W2100556411","https://openalex.org/W2125680629","https://openalex.org/W2150865801","https://openalex.org/W2167077875","https://openalex.org/W2787633523","https://openalex.org/W2910940141","https://openalex.org/W2950515139","https://openalex.org/W2963049063","https://openalex.org/W2963680357","https://openalex.org/W2963865165","https://openalex.org/W2976284247","https://openalex.org/W3124617746","https://openalex.org/W4245577611","https://openalex.org/W4300263211","https://openalex.org/W4302550371","https://openalex.org/W6608805005","https://openalex.org/W6636867841","https://openalex.org/W6639491065","https://openalex.org/W6675134457","https://openalex.org/W6751281983"],"related_works":["https://openalex.org/W2158224665","https://openalex.org/W2379589510","https://openalex.org/W2810730439","https://openalex.org/W4300044672","https://openalex.org/W1881631164","https://openalex.org/W4318195686","https://openalex.org/W2975999359","https://openalex.org/W2358292267","https://openalex.org/W2755810846","https://openalex.org/W4313177131"],"abstract_inverted_index":{"In":[0,36],"this":[1,76],"paper,":[2],"we":[3,71,94,130,135],"study":[4],"a":[5,96],"general":[6],"framework":[7],"for":[8,100,126],"compressive":[9,65],"sensing":[10],"assuming":[11],"the":[12,15,22,46,49,61,73,80,88,91,138,145],"existence":[13],"of":[14,24,41,75,83,90],"prior":[16,77],"knowledge":[17,78],"that":[18],"x*":[19,28],"belongs":[20],"to":[21,54,86,133],"union":[23],"multiple":[25],"convex":[26,43],"sets,":[27],"\u03b5":[29],"\u03c5i":[30],"\u2112":[31],"<sub":[32],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[33],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[34],".":[35],"fact,":[37],"by":[38,141],"proper":[39],"choices":[40],"these":[42],"sets":[44],"in":[45],"above":[47],"framework,":[48],"problem":[50],"can":[51,136],"be":[52],"transformed":[53],"well":[55],"known":[56],"CS":[57],"problems":[58],"such":[59],"as":[60,132],"phase":[62],"retrieval,":[63],"quantized":[64],"sensing,":[66],"and":[67,108,118,124],"model-based":[68],"CS.":[69],"First":[70],"analyze":[72],"impact":[74],"on":[79,114],"minimum":[81],"number":[82],"measurements":[84],"M":[85],"guarantee":[87],"uniqueness":[89],"solution.":[92],"Then":[93],"formulate":[95],"universal":[97],"objective":[98,146],"function":[99],"signal":[101,127,139],"recovery,":[102],"which":[103],"is":[104,122],"both":[105],"computationally":[106],"inexpensive":[107],"flexible.":[109],"Then,":[110],"an":[111],"algorithm":[112],"based":[113],"multiplicative":[115],"weight":[116],"update":[117],"proximal":[119],"gradient":[120],"descent":[121],"proposed":[123],"analyzed":[125],"reconstruction.":[128],"Finally,":[129],"investigate":[131],"how":[134],"improve":[137],"recovery":[140],"introducing":[142],"regularizers":[143],"into":[144],"function.":[147]},"counts_by_year":[{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}