{"id":"W2037286736","doi":"10.1117/12.489650","title":"<title>Viterbi-based data association techniques for target tracking</title>","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Infrared Target Detection Methodologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Viterbi algorithm; Computer science; Data association; Clutter; Computation; Soft output Viterbi algorithm; Tracking (education); Sliding window protocol; Track (disk drive); Algorithm; Artificial intelligence; Window (computing); Hidden Markov model; Decoding methods; Radar","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.0007728084,0.0005626501,0.0006109721,0.001127178,0.0005383739,0.001327944,0.001590996,0.001055697,0.06235249],"category_scores_gemma":[0.001952646,0.0002880152,0.0003055609,0.001784394,0.0005617667,0.00154942,0.0007385166,0.001058612,0.04308623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006832047,"about_ca_system_score_gemma":0.0005372374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00201289,"about_ca_topic_score_gemma":0.002781609,"domain_scores_codex":[0.9995866,0.00007249448,0.00002839471,0.00009821748,0.0001738735,0.00004046169],"domain_scores_gemma":[0.9990736,0.0002263531,0.00006925331,0.0002180197,0.0003687764,0.00004404629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003527912,0.00007231089,0.0003939899,0.0003904849,0.00003116451,0.000194076,0.00008011799,0.008221489,0.04326966,0.03279615,0.09187626,0.8223216],"study_design_scores_gemma":[0.0001306713,0.0004350193,0.00164496,0.000192698,0.00004057864,0.000909411,0.00005307829,0.2480275,0.1760489,0.02748063,0.5449104,0.000126201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006376719,0.00754771,0.9183208,0.002026946,0.00276359,0.0002650425,0.0008922038,0.00813885,0.0536681],"genre_scores_gemma":[0.139049,0.007738448,0.4905427,0.001173222,0.002016522,0.0003510311,0.004457615,0.002937542,0.351734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06235249,"threshold_uncertainty_score":0.2085898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02705558801002018,"score_gpt":0.2604954344065923,"score_spread":0.2334398463965721,"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."}}