{"id":"https://openalex.org/W2949382009","doi":"https://doi.org/10.1109/cdc.2018.8619666","title":"Sparse Recovery over Graph Incidence Matrices","display_name":"Sparse Recovery over Graph Incidence Matrices","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2949382009","doi":"https://doi.org/10.1109/cdc.2018.8619666","mag":"2949382009"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2018.8619666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8619666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1803.09631","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mengnan Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mengnan Zhao","raw_affiliation_strings":["Department of Electrical and Computer Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"M. Devrim Kaba","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Devrim Kaba","raw_affiliation_strings":["Department of Applied Mathematics and Statistics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Rene Vidal","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rene Vidal","raw_affiliation_strings":["Department of Biomedical Engineering, The Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Biomedical Engineering, The Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Daniel P. Robinson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel P. Robinson","raw_affiliation_strings":["Department of Applied Mathematics and Statistics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Enrique Mallada","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Enrique Mallada","raw_affiliation_strings":["Department of Electrical and Computer Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4572,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80802679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"364","last_page":"371"},"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/T10057","display_name":"Face and Expression Recognition","score":0.995199978351593,"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"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9945999979972839,"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/sparse-approximation","display_name":"Sparse approximation","score":0.6365000009536743},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.541700005531311},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.534500002861023},{"id":"https://openalex.org/keywords/incidence-matrix","display_name":"Incidence matrix","score":0.5120999813079834},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4823000133037567},{"id":"https://openalex.org/keywords/signal-recovery","display_name":"Signal recovery","score":0.40689998865127563},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.3644999861717224},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3628999888896942}],"concepts":[{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.6365000009536743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6017000079154968},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.541700005531311},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.534500002861023},{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.5120999813079834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5054000020027161},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4823000133037567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4124999940395355},{"id":"https://openalex.org/C2989281035","wikidata":"https://www.wikidata.org/wiki/Q120811","display_name":"Signal recovery","level":3,"score":0.40689998865127563},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3628999888896942},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.3395000100135803},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32659998536109924},{"id":"https://openalex.org/C61511704","wikidata":"https://www.wikidata.org/wiki/Q1671857","display_name":"Incidence (geometry)","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.3192000091075897},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2881999909877777},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2775999903678894},{"id":"https://openalex.org/C154771677","wikidata":"https://www.wikidata.org/wiki/Q17098361","display_name":"K-SVD","level":3,"score":0.27730000019073486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.26759999990463257},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2018.8619666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8619666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1803.09631","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.09631","pdf_url":"https://arxiv.org/pdf/1803.09631","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":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1803.09631","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.09631","pdf_url":"https://arxiv.org/pdf/1803.09631","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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W143004564","https://openalex.org/W272982077","https://openalex.org/W1943159047","https://openalex.org/W1991858502","https://openalex.org/W2003217181","https://openalex.org/W2020390700","https://openalex.org/W2030449718","https://openalex.org/W2045385910","https://openalex.org/W2053957335","https://openalex.org/W2065444577","https://openalex.org/W2099641086","https://openalex.org/W2101675075","https://openalex.org/W2119667497","https://openalex.org/W2122340891","https://openalex.org/W2126833874","https://openalex.org/W2128633079","https://openalex.org/W2129131372","https://openalex.org/W2129812935","https://openalex.org/W2145096794","https://openalex.org/W4250955649","https://openalex.org/W6609457598","https://openalex.org/W6686585099"],"related_works":[],"abstract_inverted_index":{"Classical":[0],"results":[1,28],"in":[2,32,90],"sparse":[3,48,74,99],"recovery":[4,49,100,138],"guarantee":[5],"the":[6,15,47,58,61,81,84,105,108,111,114,117,125,128,142],"exact":[7],"reconstruction":[8],"of":[9,50,63,80,83,107,110,116,130],"s-sparse":[10],"signals":[11,51],"under":[12],"assumptions":[13],"on":[14,38,78,104,124],"dictionary":[16,59],"that":[17,86,101,140],"are":[18,36],"either":[19],"too":[20],"strong":[21],"or":[22],"NP-hard":[23],"to":[24,133],"check.":[25],"Moreover,":[26],"such":[27],"may":[29],"be":[30,88],"pessimistic":[31],"practice":[33],"since":[34],"they":[35],"based":[37],"a":[39,54,135],"worst-case":[40],"analysis.":[41],"In":[42],"this":[43],"paper,":[44],"we":[45,120],"consider":[46],"defined":[52],"over":[53],"graph,":[55],"for":[56,73,98],"which":[57,76],"takes":[60],"form":[62],"an":[64],"incidence":[65,131],"matrix.":[66],"We":[67,93],"derive":[68,95],"necessary":[69],"and":[70,127],"sufficient":[71],"conditions":[72,97],"recovery,":[75],"depend":[77,102],"properties":[79,123],"cycles":[82,109],"graph":[85,112],"can":[87],"checked":[89],"polynomial":[91],"time.":[92],"also":[94],"support-dependent":[96],"only":[103],"intersection":[106],"with":[113],"support":[115],"signal.":[118],"Finally,":[119],"exploit":[121],"sparsity":[122],"measurements":[126],"structure":[129],"matrices":[132],"propose":[134],"specialized":[136],"sub-graph-based":[137],"algorithm":[139],"outperforms":[141],"standard":[143],"l1":[144],"-minimization":[145],"approach.":[146]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-06-27T00:00:00"}