{"id":"W1842941715","doi":"10.1007/3-540-70659-3_30","title":"A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Matching (statistics); Blossom algorithm; Graph; Image retrieval; Algorithm; 3-dimensional matching; Image (mathematics); Content-based image retrieval; Process (computing); Optimal matching; Pattern recognition (psychology); Artificial intelligence; Theoretical computer science; Mathematics; Bipartite graph","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.001181665,0.001661698,0.002570774,0.005293183,0.001588574,0.0023554,0.003741768,0.002800614,0.009752318],"category_scores_gemma":[0.004660734,0.001113318,0.001662756,0.00749758,0.001264179,0.00426504,0.003384702,0.002389708,0.006241531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001128226,"about_ca_system_score_gemma":0.001552557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00533059,"about_ca_topic_score_gemma":0.007110066,"domain_scores_codex":[0.9982223,0.0002093318,0.0001344882,0.0005557988,0.0007647404,0.0001133393],"domain_scores_gemma":[0.9983214,0.0005005111,0.00009785834,0.0004103708,0.0005764532,0.00009349452],"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.0001902133,0.0001784581,0.0002867518,0.0002363604,0.0001308486,0.000118725,0.00007545186,0.0190499,0.02627194,0.01433294,0.01438529,0.9247432],"study_design_scores_gemma":[0.0001935258,0.0002270509,0.000889143,0.00004658256,0.0001884098,0.001160741,0.00009761819,0.8674878,0.03554579,0.06114283,0.0329125,0.0001080455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001529542,0.000252275,0.9951335,0.00009721237,0.0001367993,0.0001204024,0.0001015057,0.001851608,0.0007771302],"genre_scores_gemma":[0.01138381,0.0002450755,0.9848043,0.00009766596,0.0001019423,0.00017841,0.0003344684,0.0003233815,0.00253101],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009752318,"threshold_uncertainty_score":0.03262472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01488831970409286,"score_gpt":0.2306929607435853,"score_spread":0.2158046410394924,"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."}}