{"id":"W2492095310","doi":"10.1109/tcsvt.2016.2592329","title":"Scalable Mammogram Retrieval Using Composite Anchor Graph Hashing With Iterative Quantization","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Government of Shandong Province; University of North Carolina at Charlotte; National Technical University of Athens; Natural Science Foundation of Shandong Province; University of Toronto; National Natural Science Foundation of China","keywords":"Computer science; Hash function; Scalability; Hamming space; Image retrieval; Quantization (signal processing); Binary code; Algorithm; Pattern recognition (psychology); Information retrieval; Hamming code; Theoretical computer science; Data mining; Artificial intelligence; Binary number; Image (mathematics); Mathematics; Database","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004085856,0.0002496426,0.0003634618,0.0006522189,0.000492815,0.0002017959,0.0003449293,0.0002053789,0.000001258576],"category_scores_gemma":[0.0000261936,0.0001732492,0.00006945428,0.001050537,0.0001956781,0.0009617702,0.000004888408,0.000176644,0.000001910613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009621114,"about_ca_system_score_gemma":0.00004759271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001999766,"about_ca_topic_score_gemma":0.000007101926,"domain_scores_codex":[0.9983231,0.00008355737,0.0003677648,0.0006156038,0.0002097953,0.0004001594],"domain_scores_gemma":[0.9986832,0.0002491063,0.0001938072,0.0004732629,0.0003170242,0.0000835727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000221852,0.0003036667,0.0006634399,0.0003030552,0.0002658163,0.00004341396,0.000325649,0.001161917,0.5420783,0.02991025,0.00008839658,0.4246342],"study_design_scores_gemma":[0.002501216,0.003078063,0.00003836228,0.001597874,0.00009048601,0.0005350144,0.0001645129,0.04098213,0.9376512,0.008520257,0.003876488,0.0009643774],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02239215,0.0004050708,0.9749171,0.0003330586,0.0002768328,0.0008595128,0.00003259837,0.0007670937,0.000016585],"genre_scores_gemma":[0.9824121,0.000119398,0.01718119,0.00007556045,0.00002579411,0.00005805664,8.879244e-7,0.00002973864,0.00009725001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.96002,"threshold_uncertainty_score":0.7064896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02852268932994216,"score_gpt":0.2779256295681876,"score_spread":0.2494029402382454,"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."}}