{"id":"W2133079381","doi":"10.2316/p.2012.782-022","title":"Fast Dual-based Linearized Bregman Algorithm for Compressive Sensing of Digital Images","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Compressed sensing; Dual (grammatical number); Algorithm; Basis pursuit; Signal reconstruction; Signal recovery; Computer science; SIGNAL (programming language); Nonlinear system; Basis (linear algebra); Sampling (signal processing); Mathematics; Signal processing; Mathematical optimization; Artificial intelligence; Computer vision; Digital signal processing; Matching pursuit; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.00005244303,0.0001620328,0.0002406212,0.00008173127,0.00003729255,0.00004356377,0.00006392675,0.00006906201,0.00001390533],"category_scores_gemma":[0.00001812763,0.0001498392,0.00010571,0.0000753777,0.00005262059,0.0002061267,0.00002865888,0.00007596924,0.000005375881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001783255,"about_ca_system_score_gemma":0.00000935471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001014417,"about_ca_topic_score_gemma":5.662693e-7,"domain_scores_codex":[0.9992833,0.000009316603,0.0002077968,0.0001053541,0.000107773,0.0002864271],"domain_scores_gemma":[0.9994186,0.0001406218,0.000047315,0.0002122757,0.000108674,0.00007252988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005561646,0.0002418446,0.0003822197,0.0001440554,0.0003134366,0.00001458139,0.0003973646,0.01134083,0.3573742,0.0002366634,0.02707167,0.6024275],"study_design_scores_gemma":[0.0003789951,0.00002773988,0.00006905998,0.00005726586,0.00002146416,0.000008152893,0.00003969785,0.4478262,0.5498999,0.000109478,0.001390061,0.0001719555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01038199,0.0001909964,0.983321,0.00002046894,0.0001916132,0.0002272107,0.0000636123,0.0007509445,0.004852144],"genre_scores_gemma":[0.8180588,0.000003411973,0.1815777,0.00002766227,0.0001576278,0.000003765295,0.00003189284,0.00003858197,0.0001005137],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8076768,"threshold_uncertainty_score":0.6110265,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01608635088194947,"score_gpt":0.2423308274753727,"score_spread":0.2262444765934233,"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."}}