{"id":"W3113501994","doi":"10.1016/j.cviu.2022.103415","title":"A non-alternating graph hashing algorithm for large-scale image search","year":2022,"lang":"en","type":"article","venue":"Computer Vision and Image Understanding","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Actua; University of Waterloo","funders":"","keywords":"Hash function; Computer science; Computational complexity theory; Locality-sensitive hashing; Binary code; Algorithm; Binary number; Relaxation (psychology); Coordinate descent; Mathematical optimization; Theoretical computer science; Mathematics; Hash table","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001050106,0.0002475851,0.0002916876,0.00037177,0.00158459,0.0008683183,0.0007769528,0.00003967002,0.00001526988],"category_scores_gemma":[0.00001343676,0.0002449283,0.0001485508,0.0005634483,0.0000759703,0.001632513,0.001845412,0.0003868805,0.000002359445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002665106,"about_ca_system_score_gemma":0.00003970016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007962534,"about_ca_topic_score_gemma":0.000001153022,"domain_scores_codex":[0.9977746,0.00008832809,0.0003350812,0.0007448954,0.0004613097,0.0005958047],"domain_scores_gemma":[0.9989811,0.0002224357,0.000122857,0.0004147428,0.00009844012,0.0001603836],"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.00007634278,0.0004283276,0.0001464493,0.0002120025,0.00008429463,0.0003019024,0.007281022,0.00008641901,0.03053583,0.02639429,0.01366453,0.9207886],"study_design_scores_gemma":[0.001211664,0.0006583545,0.000041245,0.00006625881,0.000007263357,0.00009093033,0.001303293,0.9668262,0.005933894,0.02125953,0.00222283,0.0003785563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001097183,0.0001282108,0.9967777,0.0004780955,0.0003714083,0.0005047572,0.0000237875,0.0003640975,0.0002547597],"genre_scores_gemma":[0.07529509,0.00005642102,0.9237048,0.0006443706,0.0001469143,0.00003651053,0.00001383108,0.0000340997,0.00006794064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9667398,"threshold_uncertainty_score":0.9997152,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03441565489459691,"score_gpt":0.3253175015625593,"score_spread":0.2909018466679624,"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."}}