{"id":"W2095765012","doi":"10.1109/mmsp.2008.4665170","title":"Fast Johnson-Lindenstrauss Transform for robust and secure image hashing","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hash function; Computer science; Robustness (evolution); K-independent hashing; Universal hashing; Dynamic perfect hashing; Singular value decomposition; Matrix decomposition; Random projection; Algorithm; Dimensionality reduction; Feature hashing; Non-negative matrix factorization; Artificial intelligence; Theoretical computer science; Hash table; Pattern recognition (psychology); Double hashing; Computer security","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.0008108512,0.000361623,0.0004418091,0.0007387446,0.0003710818,0.0005894953,0.0004271985,0.0005343449,0.001525652],"category_scores_gemma":[0.002602205,0.0001758948,0.000378859,0.0008228524,0.0007176593,0.001058631,0.0006365876,0.0007011183,0.0006972186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005115743,"about_ca_system_score_gemma":0.0007438262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006043611,"about_ca_topic_score_gemma":0.0008220878,"domain_scores_codex":[0.9993393,0.0001589021,0.00002755602,0.00006667593,0.0003703131,0.00003735251],"domain_scores_gemma":[0.9992909,0.0002638904,0.0001086567,0.0001577418,0.0001433201,0.00003545272],"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.0004670506,0.0001471769,0.00125462,0.0002244302,0.00005445827,0.0003042979,0.0002147727,0.1062363,0.1552612,0.1606696,0.005596809,0.5695695],"study_design_scores_gemma":[0.00003663027,0.0002567707,0.0008862134,0.00001668605,0.00001548458,0.0006596421,0.00005554184,0.9160623,0.05147593,0.0226148,0.00785823,0.00006170195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02434165,0.0005961368,0.9729311,0.0001791056,0.00005767174,0.00003624762,0.00004462166,0.0003315768,0.001481795],"genre_scores_gemma":[0.3931718,0.0006926797,0.6028522,0.0001230519,0.0001108671,0.00008417208,0.000169299,0.00004008869,0.002755852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001525652,"threshold_uncertainty_score":0.005103767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03165891914092377,"score_gpt":0.2747031836536726,"score_spread":0.2430442645127489,"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."}}