{"id":"W2113894747","doi":"10.1109/tpami.2006.207","title":"Graphical Models and Point Pattern Matching","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Australian Government; National ICT Australia","keywords":"Euclidean geometry; 3-dimensional matching; Matching (statistics); Algorithm; Time complexity; Graphical model; Mathematics; Graph; Euclidean distance; Point (geometry); Mathematical optimization; Polynomial; Dimension (graph theory); Blossom algorithm; Computer science; Artificial intelligence; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.001667594,0.001482758,0.001464882,0.002872385,0.001044404,0.002639622,0.003608232,0.002989857,0.006859635],"category_scores_gemma":[0.01213226,0.001165304,0.002507418,0.004099869,0.002400815,0.00635948,0.003852411,0.002677025,0.002156335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365043,"about_ca_system_score_gemma":0.001234991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003281541,"about_ca_topic_score_gemma":0.003047644,"domain_scores_codex":[0.9962845,0.001256346,0.0002037269,0.0009460797,0.001089826,0.0002196112],"domain_scores_gemma":[0.9954862,0.002140312,0.0006116718,0.001261335,0.0003752091,0.0001252689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008572832,0.00006348596,0.0005808424,0.0002472606,0.00009966279,0.0002114158,0.0002400767,0.3342757,0.001874181,0.553497,0.004328483,0.1044962],"study_design_scores_gemma":[0.00001924328,0.00002406734,0.000117055,0.00003000326,0.00002347579,0.0001363834,0.00003986615,0.4195789,0.0007347261,0.5709933,0.008280628,0.0000223296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001691849,0.0001447182,0.9963325,0.0001584665,0.00001974088,0.00002857007,0.0001059756,0.0003520082,0.001166235],"genre_scores_gemma":[0.1680174,0.001012896,0.822682,0.0003476045,0.0001617441,0.0003702607,0.001567216,0.0003918224,0.005449187],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006859635,"threshold_uncertainty_score":0.02294773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01418689186455034,"score_gpt":0.241652290326984,"score_spread":0.2274653984624336,"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."}}