{"id":"W2028641788","doi":"10.1016/j.automatica.2003.07.011","title":"Analysis of the Kalman filter based estimation algorithm: an orthogonal decomposition approach","year":2003,"lang":"en","type":"article","venue":"Automatica","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Kalman filter; Covariance intersection; Algorithm; Subspace topology; Covariance matrix; Mathematics; Covariance; Extended Kalman filter; Orthogonal matrix; Decomposition; Fast Kalman filter; Matrix (chemical analysis); Tracking (education); Invariant extended Kalman filter; Control theory (sociology); Computer science; Mathematical optimization; Artificial intelligence; Orthogonal basis; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001952937,0.000712739,0.0007417836,0.0007318126,0.0003533067,0.001108392,0.0006829538,0.0007188188,0.00325146],"category_scores_gemma":[0.007415477,0.000507579,0.0007368097,0.0009120473,0.0005406708,0.001994011,0.0008468667,0.001188954,0.000835585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006000549,"about_ca_system_score_gemma":0.001234975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003837227,"about_ca_topic_score_gemma":0.002076826,"domain_scores_codex":[0.999123,0.0002471221,0.00005115952,0.0001129308,0.0004032556,0.00006236201],"domain_scores_gemma":[0.9977355,0.001322479,0.0001680043,0.0001375448,0.0006101291,0.0000261883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009997771,0.00005193839,0.001053119,0.0002197856,0.00009839635,0.00008217443,0.0001099881,0.6280527,0.005177372,0.1569902,0.002489736,0.2055746],"study_design_scores_gemma":[0.000003251603,0.00001379675,0.0002969291,0.00001304041,0.0000104388,0.00002912866,0.000006761945,0.9880083,0.0007678777,0.009877057,0.0009622847,0.00001109957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002921826,0.0003336868,0.9954031,0.00008213644,0.00003037504,0.00001034141,0.00002051534,0.00005217968,0.001145846],"genre_scores_gemma":[0.4321195,0.003315445,0.5539126,0.0001571198,0.000285931,0.0002606544,0.0005723857,0.0003751102,0.009001294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003837227,"threshold_uncertainty_score":0.01087725,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0140880804668966,"score_gpt":0.261488105443886,"score_spread":0.2474000249769894,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}