{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007583927,0.0005654534,0.0005192384,0.0009296633,0.0003359475,0.0006433914,0.002880863,0.0002198475,0.000009901286],"category_scores_gemma":[0.00003032961,0.0004812455,0.0001752248,0.001060094,0.0003184125,0.0005445491,0.0003828879,0.0005035193,0.00003009137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001506408,"about_ca_system_score_gemma":0.0003282449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002386526,"about_ca_topic_score_gemma":0.0000153818,"domain_scores_codex":[0.9962481,0.0000268962,0.0004397974,0.001714363,0.0008605067,0.0007103155],"domain_scores_gemma":[0.9972938,0.0004365556,0.0002708907,0.00129975,0.0003441662,0.0003548248],"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.00002566616,0.0000293328,0.00000193301,0.00002707504,0.00001378829,0.00002967777,0.000421434,0.006815529,0.0009723866,0.02120134,0.00001406816,0.9704478],"study_design_scores_gemma":[0.001113351,0.0008099747,0.00001977534,0.0004567246,0.0000215816,0.00006492327,5.399488e-7,0.5856315,0.01462728,0.3953218,0.0007813873,0.001151165],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001626609,0.00009453737,0.9966219,0.0009525515,0.0006319146,0.001245643,0.0000180207,0.0002220385,0.0001971107],"genre_scores_gemma":[0.001323766,0.000003327169,0.9959627,0.001953535,0.00034028,0.00002788046,0.000008434013,0.00004289663,0.0003372221],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9692966,"threshold_uncertainty_score":0.9997639,"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."}}