{"id":"W4315780125","doi":"10.1007/978-3-031-20096-0_43","title":"Symmetry Structured Analysis Sparse Coding for Key Frame Extraction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Coding (social sciences); Sparse approximation; Neural coding; Key frame; Regularization (linguistics); Minimax; Computational complexity theory; Algorithm; Convex function; Key (lock); Mathematical optimization; Theoretical computer science; Artificial intelligence; Frame (networking); Regular polygon; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009722539,0.0005362419,0.0007205447,0.002290331,0.0004631556,0.001163863,0.00261968,0.0004381226,0.00001456006],"category_scores_gemma":[0.0002598818,0.0005057673,0.0003460984,0.002653747,0.0003110491,0.0008466007,0.0006958166,0.0007674495,0.00002827203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002945661,"about_ca_system_score_gemma":0.0004121182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001554357,"about_ca_topic_score_gemma":0.0001329937,"domain_scores_codex":[0.9957535,0.00002270979,0.0005770277,0.001836575,0.001003401,0.0008068274],"domain_scores_gemma":[0.9970187,0.0008107707,0.0004754412,0.00117355,0.0003259508,0.0001955829],"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.00001176272,0.00001880552,0.0001980266,0.0001069271,0.0001592157,0.00007616869,0.0005937746,0.05890631,0.001879716,0.01132444,0.0000545956,0.9266703],"study_design_scores_gemma":[0.0003182613,0.0001177814,0.0005502234,0.0003154795,0.0001398545,0.00003844055,5.554853e-7,0.6669357,0.02017398,0.3096732,0.0007593551,0.0009771115],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001698307,0.0001991514,0.9951339,0.0006066046,0.002525347,0.0003631034,0.00001397283,0.0003765544,0.0006115737],"genre_scores_gemma":[0.1440891,0.00004353081,0.8531809,0.001000885,0.0008184682,0.00001735396,0.00002273849,0.00005647604,0.0007704683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9256932,"threshold_uncertainty_score":0.999873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02816993114644537,"score_gpt":0.2828784859520778,"score_spread":0.2547085548056325,"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."}}