{"id":"https://openalex.org/W2162182236","doi":"https://doi.org/10.1109/tsp.2010.2051153","title":"On the Bayesian Cram\u00e9r-Rao Bound for Markovian Switching Systems","display_name":"On the Bayesian Cram\u00e9r-Rao Bound for Markovian Switching Systems","publication_year":2010,"publication_date":"2010-05-28","ids":{"openalex":"https://openalex.org/W2162182236","doi":"https://doi.org/10.1109/tsp.2010.2051153","mag":"2162182236"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2010.2051153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2010.2051153","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"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 Signal Processing","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/A5029413988","display_name":"Lennart Svensson","orcid":"https://orcid.org/0000-0003-0206-9186"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Lennart Svensson","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, Goteborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, Goteborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029413988"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":2.296,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.90043315,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"58","issue":"9","first_page":"4507","last_page":"4516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9829000234603882,"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"}},{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9819999933242798,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5968655347824097},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5466766953468323},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5151642560958862},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.4712429642677307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46054500341415405},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.46006667613983154},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.459179162979126},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45555955171585083},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4466889500617981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4364001154899597},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.42938148975372314},{"id":"https://openalex.org/keywords/cram\u00e9r\u2013rao-bound","display_name":"Cram\u00e9r\u2013Rao bound","score":0.4187872111797333},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3600066304206848},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3310006260871887},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2599182724952698},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.24985384941101074},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12274181842803955}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5968655347824097},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5466766953468323},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5151642560958862},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.4712429642677307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46054500341415405},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.46006667613983154},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.459179162979126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45555955171585083},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4466889500617981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4364001154899597},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.42938148975372314},{"id":"https://openalex.org/C4978587","wikidata":"https://www.wikidata.org/wiki/Q1138810","display_name":"Cram\u00e9r\u2013Rao bound","level":3,"score":0.4187872111797333},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3600066304206848},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3310006260871887},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2599182724952698},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.24985384941101074},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12274181842803955},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tsp.2010.2051153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2010.2051153","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"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 Signal Processing","raw_type":"journal-article"},{"id":"pmh:oai:publications.lib.chalmers.se:124667","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/124667-on-the-bayesian-cramer-rao-bound-for-markovian-switching-systems","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:124667","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/124667","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1500551892","https://openalex.org/W1509783656","https://openalex.org/W2021484850","https://openalex.org/W2034663708","https://openalex.org/W2090562304","https://openalex.org/W2104130465","https://openalex.org/W2117397690","https://openalex.org/W2123211114","https://openalex.org/W2143180486","https://openalex.org/W2149074579","https://openalex.org/W2162488823","https://openalex.org/W2565753657","https://openalex.org/W4246841922"],"related_works":["https://openalex.org/W2164801693","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],"propose":[1,79],"a":[2,41],"numerical":[3],"algorithm":[4,36,81],"to":[5,54,73],"evaluate":[6],"the":[7,21,30,56,101,107,111],"Bayesian":[8],"Cram\u00e9r-Rao":[9],"bound":[10],"(BCRB)":[11],"for":[12,47,58],"multiple":[13,59],"model":[14,32,60],"filtering":[15,61],"problems.":[16],"It":[17],"is":[18,33,37,83,91,109,113],"assumed":[19],"that":[20,29,110],"individual":[22],"models":[23],"have":[24],"additive":[25],"Gaussian":[26],"noise":[27],"and":[28,89],"measurement":[31],"linear.":[34],"The":[35],"also":[38],"given":[39],"in":[40],"recursive":[42],"form,":[43],"making":[44],"it":[45],"applicable":[46],"sequences":[48],"of":[49,100],"arbitrary":[50],"length.":[51],"Previous":[52],"attempts":[53],"calculate":[55],"BCRB":[57,112],"problems":[62],"are":[63],"based":[64,84],"on":[65,85],"rough":[66],"approximations":[67,99],"which":[68,82,90,120],"usually":[69],"make":[70],"them":[71],"simple":[72],"calculate.":[74],"In":[75],"this":[76],"paper,":[77],"we":[78,121],"an":[80],"Monte":[86],"Carlo":[87],"sampling,":[88],"hence":[92],"more":[93,114],"computationally":[94],"demanding,":[95],"but":[96],"yields":[97],"accurate":[98],"BCRB.":[102],"An":[103],"important":[104],"observation":[105],"from":[106],"simulations":[108],"overoptimistic":[115],"than":[116],"previously":[117],"suggested":[118],"bounds,":[119],"motivate":[122],"using":[123],"theoretical":[124],"results.":[125]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}