{"id":"W4248606973","doi":"10.1145/500934.500936","title":"Parallel traversal of signature trees for fast CBIR","year":2001,"lang":"en","type":"article","venue":"","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Tree traversal; Computer science; Signature (topology); Histogram; Binary tree; Tree (set theory); k-d tree; Image (mathematics); Parallel computing; Pattern recognition (psychology); Artificial intelligence; Algorithm; Mathematics","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.0007882573,0.0007269338,0.0008571759,0.001689838,0.001185478,0.001067368,0.001493535,0.0007367873,0.007877981],"category_scores_gemma":[0.003064216,0.0005325622,0.000873458,0.002328953,0.0005075911,0.002550958,0.00127674,0.0008660725,0.002696674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009906311,"about_ca_system_score_gemma":0.00212886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007712269,"about_ca_topic_score_gemma":0.01206589,"domain_scores_codex":[0.9992218,0.0001276918,0.00007366167,0.0001296148,0.0003441159,0.0001031951],"domain_scores_gemma":[0.9985832,0.0004989636,0.00009085051,0.0004048556,0.0003480571,0.0000740879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005362803,0.0001811736,0.000970159,0.0003745154,0.00007064106,0.0001872006,0.0003269596,0.02213622,0.07653054,0.01934246,0.01002673,0.8693171],"study_design_scores_gemma":[0.0003554602,0.0004109458,0.001385635,0.00006913317,0.0001166407,0.001161016,0.0002827463,0.7824408,0.1024059,0.06126181,0.05001088,0.00009895081],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02335998,0.0006501048,0.9632898,0.0001817753,0.00006395314,0.0001892642,0.0002199955,0.007310242,0.004734894],"genre_scores_gemma":[0.1127932,0.0002666264,0.8829867,0.00008956094,0.00002919939,0.0001532108,0.0006047748,0.0004649228,0.002611841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007877981,"threshold_uncertainty_score":0.02635443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01982974794356116,"score_gpt":0.2620619618518226,"score_spread":0.2422322139082615,"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."}}