{"id":"W2083904196","doi":"10.1117/12.381623","title":"<title>Adaptive hill climbing and iterative closest point algorithm for multisensor image registration with partial Hausdorff distance</title>","year":2000,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Iterative closest point; Hausdorff distance; Hill climbing; Outlier; Artificial intelligence; Algorithm; Computer science; Iterative method; Image registration; Matching (statistics); Pattern recognition (psychology); Point set registration; Feature (linguistics); Mathematics; Point (geometry); Computer vision; Image (mathematics); Point cloud","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.0007372424,0.0006923784,0.001032724,0.001424464,0.0005115933,0.001269452,0.001463537,0.001243609,0.03148622],"category_scores_gemma":[0.001762021,0.0002524925,0.0005222318,0.002511552,0.0005759068,0.00164611,0.0007171596,0.0009362971,0.02003553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005475369,"about_ca_system_score_gemma":0.0004481598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001850703,"about_ca_topic_score_gemma":0.00230196,"domain_scores_codex":[0.9992174,0.0001181527,0.00005790509,0.0001302161,0.0004347283,0.00004151413],"domain_scores_gemma":[0.99914,0.0001706118,0.00005608436,0.0002224806,0.000363818,0.00004687146],"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.0002635069,0.00007622292,0.0003034445,0.0002493965,0.00004823406,0.0003525743,0.00007413518,0.02678406,0.0251616,0.03969984,0.1013847,0.8056023],"study_design_scores_gemma":[0.00006462818,0.000218882,0.001376105,0.00007367248,0.00003407667,0.0008161191,0.00004544937,0.5424902,0.06960999,0.03167411,0.3534496,0.0001471895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003595328,0.001653285,0.9683462,0.0007449707,0.002194761,0.0001428505,0.0003872996,0.003239633,0.01969572],"genre_scores_gemma":[0.08786324,0.002653886,0.7662158,0.0004406532,0.00127139,0.0002564616,0.002521585,0.002468009,0.1363089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03148622,"threshold_uncertainty_score":0.1053319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009270750371717271,"score_gpt":0.234885173965534,"score_spread":0.2256144235938168,"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."}}