{"id":"https://openalex.org/W4289655206","doi":"https://doi.org/10.1109/isit50566.2022.9834687","title":"Unlimited Sampling via Generalized Thresholding","display_name":"Unlimited Sampling via Generalized Thresholding","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655206","doi":"https://doi.org/10.1109/isit50566.2022.9834687"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834687","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834687","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5036367852","display_name":"Dorian Florescu","orcid":"https://orcid.org/0000-0002-1169-674X"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Dorian Florescu","raw_affiliation_strings":["Imperial College London,Dept. of Electrical and Electronic Engg.,London,UK,SW7 2AZ"],"affiliations":[{"raw_affiliation_string":"Imperial College London,Dept. of Electrical and Electronic Engg.,London,UK,SW7 2AZ","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029074414","display_name":"Ayush Bhandari","orcid":"https://orcid.org/0000-0002-4485-2569"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ayush Bhandari","raw_affiliation_strings":["Imperial College London,Dept. of Electrical and Electronic Engg.,London,UK,SW7 2AZ"],"affiliations":[{"raw_affiliation_string":"Imperial College London,Dept. of Electrical and Electronic Engg.,London,UK,SW7 2AZ","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036367852"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":0.6622,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78012263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1606","last_page":"1611"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.9991999864578247,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9976000189781189,"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/T10323","display_name":"Analog and Mixed-Signal Circuit Design","score":0.996399998664856,"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/modulo","display_name":"Modulo","score":0.6872697472572327},{"id":"https://openalex.org/keywords/nyquist\u2013shannon-sampling-theorem","display_name":"Nyquist\u2013Shannon sampling theorem","score":0.5926603674888611},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5463545322418213},{"id":"https://openalex.org/keywords/dynamic-range","display_name":"Dynamic range","score":0.5131290555000305},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4848679006099701},{"id":"https://openalex.org/keywords/bandlimiting","display_name":"Bandlimiting","score":0.47132280468940735},{"id":"https://openalex.org/keywords/upsampling","display_name":"Upsampling","score":0.46616417169570923},{"id":"https://openalex.org/keywords/finite-impulse-response","display_name":"Finite impulse response","score":0.4229377508163452},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36576616764068604},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20092138648033142},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.13857600092887878},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13470175862312317},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0988379418849945}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6872697472572327},{"id":"https://openalex.org/C288623","wikidata":"https://www.wikidata.org/wiki/Q679800","display_name":"Nyquist\u2013Shannon sampling theorem","level":2,"score":0.5926603674888611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5463545322418213},{"id":"https://openalex.org/C87133666","wikidata":"https://www.wikidata.org/wiki/Q1161699","display_name":"Dynamic range","level":2,"score":0.5131290555000305},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4848679006099701},{"id":"https://openalex.org/C129997835","wikidata":"https://www.wikidata.org/wiki/Q806263","display_name":"Bandlimiting","level":3,"score":0.47132280468940735},{"id":"https://openalex.org/C110384440","wikidata":"https://www.wikidata.org/wiki/Q1143270","display_name":"Upsampling","level":3,"score":0.46616417169570923},{"id":"https://openalex.org/C198386975","wikidata":"https://www.wikidata.org/wiki/Q117785","display_name":"Finite impulse response","level":2,"score":0.4229377508163452},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36576616764068604},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20092138648033142},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.13857600092887878},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13470175862312317},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0988379418849945},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834687","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834687","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W2034940072","https://openalex.org/W2166500461","https://openalex.org/W2737827235","https://openalex.org/W2798190016","https://openalex.org/W2802183119","https://openalex.org/W2886711647","https://openalex.org/W2930502000","https://openalex.org/W2940392246","https://openalex.org/W2944333051","https://openalex.org/W3089504710","https://openalex.org/W3099366122","https://openalex.org/W3105381059","https://openalex.org/W3114622418","https://openalex.org/W3117279078","https://openalex.org/W3161477338","https://openalex.org/W3162265782","https://openalex.org/W3199048522","https://openalex.org/W3217376978","https://openalex.org/W4214871684","https://openalex.org/W4221017392","https://openalex.org/W4225323109","https://openalex.org/W6787503580","https://openalex.org/W6788323420","https://openalex.org/W6795742494"],"related_works":["https://openalex.org/W2936515547","https://openalex.org/W2170014524","https://openalex.org/W2125529598","https://openalex.org/W1421666895","https://openalex.org/W1549176107","https://openalex.org/W2153002160","https://openalex.org/W2148909075","https://openalex.org/W1995675818","https://openalex.org/W4247246397","https://openalex.org/W2140510750"],"abstract_inverted_index":{"The":[0,112,139],"Unlimited":[1],"Sensing":[2],"Framework":[3],"(USF)":[4],"provides":[5],"an":[6,27,191],"alternative":[7],"protocol":[8],"for":[9,65,115,158,172,194],"high":[10],"dynamic":[11,44,61],"range":[12,45],"(HDR)":[13],"acquisition":[14,101,165],"of":[15,46,67,93,142,155],"real":[16],"world":[17],"signals.":[18,70],"By":[19],"incorporating":[20],"a":[21,74,90,99,137,148],"modulo":[22,53,87,95],"non-linearity":[23],"prior":[24],"to":[25,33,36,58,79,146,181],"sampling,":[26],"HDR":[28,68],"signal,":[29],"which":[30],"is":[31,39,145,189],"prone":[32],"clipping":[34],"due":[35],"sensor":[37],"saturation,":[38],"folded":[40],"back":[41],"into":[42],"the":[43,47,52,80,86,94,153,163,185],"analog-to-digital":[48],"converter":[49],"(ADC).":[50],"Thereafter,":[51],"samples":[54],"are":[55,118],"algorithmically":[56],"unfolded":[57],"their":[59],"native":[60],"range,":[62],"thus":[63],"allowing":[64],"recovery":[66,84,113,170],"input":[69,169],"For":[71],"bandlimited":[72],"functions,":[73],"sampling":[75],"density":[76],"criterion":[77],"akin":[78],"Shannon-Nyquist":[81],"theorem":[82],"guarantees":[83,114,171],"from":[85],"samples.":[88],"Recently,":[89],"hardware":[91],"implementation":[92],"ADC":[96],"has":[97],"motivated":[98],"generalized":[100],"model":[102,117],"called":[103],"modulo-hysteresis":[104,164],"that":[105,151],"can":[106,127],"handle":[107,129],"non-idealities":[108],"observed":[109],"in":[110],"practice.":[111],"this":[116,143],"currently":[119],"based":[120],"on":[121,162],"finite":[122,186],"difference":[123,187],"filters.":[124],"Such":[125],"filters":[126,157,176],"not":[128,190],"practical":[130],"scenarios":[131],"where":[132,184],"noise":[133],"and":[134,177],"perturbation":[135],"play":[136],"role.":[138],"main":[140],"goal":[141],"work":[144],"introduce":[147],"principled":[149],"approach":[150],"explains":[152],"role":[154],"general":[156,175],"signal":[159],"recovery.":[160],"Based":[161],"model,":[166],"we":[167],"formulate":[168],"thresholding":[173],"with":[174],"give":[178],"numerical":[179],"simulations":[180],"show":[182],"cases":[183],"filter":[188],"optimal":[192],"choice":[193],"reconstruction.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}