{"id":"https://openalex.org/W3081362207","doi":"https://doi.org/10.1109/isit44484.2020.9174122","title":"Minimax Lower Bounds for Circular Source Localization","display_name":"Minimax Lower Bounds for Circular Source Localization","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3081362207","doi":"https://doi.org/10.1109/isit44484.2020.9174122","mag":"3081362207"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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/A5108396457","display_name":"Aolin Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aolin Xu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046582466","display_name":"Todd P. Coleman","orcid":"https://orcid.org/0000-0002-2144-2495"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Todd Coleman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108396457"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3084,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60960422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1242","last_page":"1247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9925000071525574,"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/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/minimax","display_name":"Minimax","score":0.7674674987792969},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7558506727218628},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6497060060501099},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.64359050989151},{"id":"https://openalex.org/keywords/cram\u00e9r\u2013rao-bound","display_name":"Cram\u00e9r\u2013Rao bound","score":0.47593358159065247},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.4496590793132782},{"id":"https://openalex.org/keywords/signal","display_name":"SIGNAL (programming language)","score":0.4409128427505493},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3870218098163605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38068610429763794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3271569311618805},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3144632577896118},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2755531072616577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2498718798160553},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08475080132484436}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7674674987792969},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7558506727218628},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6497060060501099},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.64359050989151},{"id":"https://openalex.org/C4978587","wikidata":"https://www.wikidata.org/wiki/Q1138810","display_name":"Cram\u00e9r\u2013Rao bound","level":3,"score":0.47593358159065247},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4496590793132782},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.4409128427505493},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3870218098163605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38068610429763794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3271569311618805},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3144632577896118},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2755531072616577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2498718798160553},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08475080132484436},{"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/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/isit44484.2020.9174122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1511694993","https://openalex.org/W1538452572","https://openalex.org/W1590772317","https://openalex.org/W2016980059","https://openalex.org/W2021102124","https://openalex.org/W2056363696","https://openalex.org/W2062890119","https://openalex.org/W2743930434","https://openalex.org/W2981058987","https://openalex.org/W3133603318","https://openalex.org/W4235461144"],"related_works":["https://openalex.org/W2120266201","https://openalex.org/W1479746946","https://openalex.org/W2055757274","https://openalex.org/W2511739151","https://openalex.org/W2143803213","https://openalex.org/W2155014562","https://openalex.org/W2134404114","https://openalex.org/W1964936841","https://openalex.org/W2026659681","https://openalex.org/W2185708237"],"abstract_inverted_index":{"We":[0,103],"consider":[1],"the":[2,6,26,30,35,42,46,54,57,59,62,65,67,72,86,119,122,126],"problem":[3,51,101],"of":[4,9,29,45,56,64,69,74,121],"estimating":[5],"unknown":[7],"location":[8],"a":[10,15,106],"spatial":[11],"signal":[12],"defined":[13,33],"on":[14,49],"circular":[16,36,127],"interval":[17],"from":[18],"noisy":[19],"measurements.":[20],"Lower":[21],"bounds":[22,40,90,96,124],"are":[23,83,91,97],"derived":[24],"for":[25,85,111,125],"minimax":[27],"risk":[28],"localization":[31,47],"error":[32,48],"by":[34],"distance.":[37],"The":[38],"lower":[39,89,95,109,123],"reveal":[41],"fundamental":[43],"dependence":[44],"various":[50],"parameters,":[52],"including":[53],"shape":[55],"signal,":[58],"noise":[60],"level,":[61],"length":[63],"interval,":[66],"number":[68,73],"sensors,":[70],"and":[71,80,93],"measurement":[75],"trials.":[76],"Le":[77],"Cam's":[78],"method":[79,82],"Fano's":[81],"used":[84],"derivation.":[87],"All":[88],"non-asymptotic,":[92],"different":[94,100],"tight":[98],"in":[99,129],"parameters.":[102],"also":[104],"derive":[105],"Bayesian":[107],"Cram\u00e9r-Rao":[108],"bound":[110],"linear":[112],"source":[113,128],"localization,":[114],"which":[115],"helps":[116],"us":[117],"understand":[118],"tightness":[120],"some":[130],"asymptotic":[131],"situations":[132],"as":[133],"well.":[134]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}