{"id":"https://openalex.org/W2153727837","doi":"https://doi.org/10.1109/icassp.2003.1201618","title":"A note on state estimation as a convex optimization problem","display_name":"A note on state estimation as a convex optimization problem","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2153727837","doi":"https://doi.org/10.1109/icassp.2003.1201618","mag":"2153727837"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2003.1201618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2003.1201618","pdf_url":null,"source":{"id":"https://openalex.org/S4363608982","display_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","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":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-55914","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083090794","display_name":"Thomas B. Sch\u00f6n","orcid":"https://orcid.org/0000-0001-5183-234X"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"T. Schon","raw_affiliation_strings":["Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058002446","display_name":"Fredrik Gustafsson","orcid":"https://orcid.org/0000-0003-3270-171X"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"F. Gustafsson","raw_affiliation_strings":["Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017570497","display_name":"Anders Hansson","orcid":"https://orcid.org/0000-0002-7934-6009"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"A. Hansson","raw_affiliation_strings":["Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083090794"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":1.0102,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.76973073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"VI","last_page":"61"},"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.9979000091552734,"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.9979000091552734,"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.9959999918937683,"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.9843000173568726,"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/kalman-filter","display_name":"Kalman filter","score":0.6469948887825012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5986740589141846},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5560061931610107},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.5053794980049133},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4943053722381592},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.484239786863327},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.46740251779556274},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.462760865688324},{"id":"https://openalex.org/keywords/state-vector","display_name":"State vector","score":0.4611656069755554},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.44914841651916504},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.44455888867378235},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.44097796082496643},{"id":"https://openalex.org/keywords/extended-kalman-filter","display_name":"Extended Kalman filter","score":0.4402563273906708},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.43223798274993896},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3760467767715454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30467647314071655},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10405024886131287},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.0979694128036499}],"concepts":[{"id":"https://openalex.org/C157286648","wikidata":"https://www.wikidata.org/wiki/Q846780","display_name":"Kalman filter","level":2,"score":0.6469948887825012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5986740589141846},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5560061931610107},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.5053794980049133},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4943053722381592},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.484239786863327},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.46740251779556274},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.462760865688324},{"id":"https://openalex.org/C2777798563","wikidata":"https://www.wikidata.org/wiki/Q7603916","display_name":"State vector","level":2,"score":0.4611656069755554},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.44914841651916504},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.44455888867378235},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.44097796082496643},{"id":"https://openalex.org/C206833254","wikidata":"https://www.wikidata.org/wiki/Q5421817","display_name":"Extended Kalman filter","level":3,"score":0.4402563273906708},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.43223798274993896},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3760467767715454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30467647314071655},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10405024886131287},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.0979694128036499},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/icassp.2003.1201618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2003.1201618","pdf_url":null,"source":{"id":"https://openalex.org/S4363608982","display_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","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":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.1735","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.1735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.rt.isy.liu.se/~schon/Publications/SchonGH2003.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.6113","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.control.isy.liu.se/~fredrik/reports/03icasspschon.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.333.2368","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.333.2368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.isy.liu.se/en/rt/fredrik/reports/03icasspschon.pdf","raw_type":"text"},{"id":"pmh:oai:DiVA.org:liu-55914","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-55914","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:liu-55914","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-55914","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1608003780","https://openalex.org/W2023976076","https://openalex.org/W2084232218","https://openalex.org/W2107503352","https://openalex.org/W2122512809","https://openalex.org/W2170081783","https://openalex.org/W2296319761","https://openalex.org/W2783438209","https://openalex.org/W6747593391"],"related_works":["https://openalex.org/W2026600343","https://openalex.org/W1978014154","https://openalex.org/W4382519084","https://openalex.org/W2999421545","https://openalex.org/W2376997122","https://openalex.org/W2478309485","https://openalex.org/W3175838852","https://openalex.org/W2040676043","https://openalex.org/W165488893","https://openalex.org/W2391247224"],"abstract_inverted_index":{"The":[0],"Kalman":[1,24],"filter":[2,25],"computes":[3],"the":[4,11,23,27,40,63,67,75],"maximum":[5],"a":[6,30,48,70],"posteriori":[7],"(MAP)":[8],"estimate":[9],"of":[10,55],"states":[12],"for":[13],"linear":[14,56],"state":[15,42,76],"space":[16],"models":[17],"with":[18,47],"Gaussian":[19],"noise.":[20],"We":[21,65],"interpret":[22],"as":[26],"solution":[28],"to":[29,44,85],"convex":[31,59],"optimization":[32],"problem,":[33],"and":[34,52,58,83],"show":[35],"that":[36,80],"we":[37],"can":[38],"generalize":[39],"MAP":[41],"estimator":[43],"any":[45,53],"noise":[46],"log-concave":[49],"density":[50],"function":[51],"combination":[54],"equality":[57],"inequality":[60],"constraints":[61],"on":[62,69],"states.":[64],"illustrate":[66],"principle":[68],"hidden":[71],"Markov":[72],"model,":[73],"where":[74],"vector":[77],"contains":[78],"probabilities":[79],"are":[81],"positive":[82],"sum":[84],"one.":[86]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}