{"id":"https://openalex.org/W1989685136","doi":"https://doi.org/10.1109/tit.2014.2300092","title":"On the Theorem of Uniform Recovery of Random Sampling Matrices","display_name":"On the Theorem of Uniform Recovery of Random Sampling Matrices","publication_year":2014,"publication_date":"2014-01-31","ids":{"openalex":"https://openalex.org/W1989685136","doi":"https://doi.org/10.1109/tit.2014.2300092","mag":"1989685136"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2014.2300092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2300092","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5107956476","display_name":"Joel Andersson","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Joel Andersson","raw_affiliation_strings":["Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden","Dept. of Math., R. Inst. of Technol., Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Dept. of Math., R. Inst. of Technol., Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076943501","display_name":"Jan-Olov Str\u00f6mberg","orcid":"https://orcid.org/0000-0002-9718-7275"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jan-Olov Stromberg","raw_affiliation_strings":["Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden","Dept. of Math., R. Inst. of Technol., Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Dept. of Math., R. Inst. of Technol., Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107956476"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":3.5372,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.91710096,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"60","issue":"3","first_page":"1700","last_page":"1710"},"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/T11210","display_name":"Mathematical Analysis and Transform Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9962999820709229,"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/mathematics","display_name":"Mathematics","score":0.5323702692985535},{"id":"https://openalex.org/keywords/nonuniform-sampling","display_name":"Nonuniform sampling","score":0.4244541525840759},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40305575728416443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38206782937049866},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3391185402870178},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.306857168674469}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5323702692985535},{"id":"https://openalex.org/C20326153","wikidata":"https://www.wikidata.org/wiki/Q7049638","display_name":"Nonuniform sampling","level":3,"score":0.4244541525840759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40305575728416443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38206782937049866},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3391185402870178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.306857168674469},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2014.2300092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2300092","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W143004564","https://openalex.org/W595086808","https://openalex.org/W1484715564","https://openalex.org/W1559242494","https://openalex.org/W2000150201","https://openalex.org/W2007439424","https://openalex.org/W2050220687","https://openalex.org/W2055064119","https://openalex.org/W2076684473","https://openalex.org/W2111067490","https://openalex.org/W2119323121","https://openalex.org/W2129638195","https://openalex.org/W2136235822","https://openalex.org/W2137198385","https://openalex.org/W2142455269","https://openalex.org/W2145096794","https://openalex.org/W2168458522","https://openalex.org/W2296616510","https://openalex.org/W2569444610","https://openalex.org/W2964003909","https://openalex.org/W4211184603","https://openalex.org/W4250955649","https://openalex.org/W4292855942"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"We":[0,47,85,102],"consider":[1,57],"two":[2],"theorems":[3],"from":[4,33],"the":[5,21,91,122],"theory":[6],"of":[7,16,23,74,121],"compressive":[8],"sensing.":[9],"Mainly":[10],"a":[11,60,70,88,118],"theorem":[12],"concerning":[13],"uniform":[14],"recovery":[15,99],"random":[17],"sampling":[18],"matrices,":[19],"where":[20],"number":[22],"samples":[24],"needed":[25],"in":[26],"order":[27],"to":[28,41,58,114],"recover":[29],"an":[30],"s-sparse":[31],"signal":[32],"linear":[34],"measurements":[35],"(with":[36],"high":[37],"probability)":[38],"is":[39,81,105],"known":[40],"be":[42,59,111],"m":[43,75],"\u2273":[44],"s(ln":[45],"s)<;sup>3<;/sup>lnN.":[46],"present":[48,87],"new":[49],"and":[50,107],"improved":[51,112],"constants":[52],"together":[53],"with":[54],"what":[55,80],"we":[56],"more":[61],"explicit":[62],"proof.":[63],"A":[64],"proof":[65],"that":[66,104,108],"also":[67,86],"allows":[68],"for":[69,117],"slightly":[71],"larger":[72],"class":[73],"\u00d7":[76],"N-matrices,":[77],"by":[78],"considering":[79],"called":[82],"effective":[83],"sparsity.":[84],"condition":[89,120],"on":[90],"so-called":[92],"restricted":[93],"isometry":[94],"constants,":[95],"\u03b4<;sub>s<;/sub>,":[96],"ensuring":[97],"sparse":[98],"via":[100],"\u2113<;sup>1<;/sup>-minimization.":[101],"show":[103],"sufficient":[106,119],"this":[109],"can":[110],"further":[113],"almost":[115],"allow":[116],"type":[123],".":[124]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":42},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}