{"id":"W2596774547","doi":"10.1109/lsp.2017.2682857","title":"Track-to-Track Association by Coherent Point Drift","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Track (disk drive); Expectation–maximization algorithm; Probabilistic logic; Computer science; Centroid; Point (geometry); Gaussian; Algorithm; Artificial intelligence; Maximization; Association (psychology); Computer vision; Maximum likelihood; Mathematics; Mathematical optimization; 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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000614111,0.0002466244,0.0002474845,0.00007959861,0.001063205,0.002079027,0.001717472,0.0001313708,0.00002795023],"category_scores_gemma":[0.00007725544,0.0002356206,0.00008944344,0.0001429173,0.00005757542,0.001249194,0.0001417453,0.0003934411,0.000203612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000139676,"about_ca_system_score_gemma":0.00004972106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005322973,"about_ca_topic_score_gemma":0.000006420236,"domain_scores_codex":[0.9976195,0.0000801264,0.0003584109,0.0006643354,0.0006902594,0.0005873392],"domain_scores_gemma":[0.9983044,0.000111765,0.0004960198,0.0007441173,0.0001261746,0.000217537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001912547,0.0001167193,0.002349473,0.0000393412,0.00003078345,0.00004171127,0.0008301425,0.001982135,0.1349745,0.00006469299,0.6807866,0.1787648],"study_design_scores_gemma":[0.005432672,0.0006607259,0.03660949,0.002061368,0.0001922651,0.000118602,0.0001560946,0.3207313,0.234205,0.002598646,0.3913938,0.005840156],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1385222,0.0001205676,0.8295758,0.02837357,0.001692384,0.0002612711,0.00002408503,0.000516329,0.0009137465],"genre_scores_gemma":[0.9799746,0.00000509094,0.01110977,0.007971716,0.0005000855,0.00001770488,0.00001121214,0.00002670927,0.0003831488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8414524,"threshold_uncertainty_score":0.9989569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0147413015517044,"score_gpt":0.2525848985902762,"score_spread":0.2378435970385718,"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."}}