{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007032566,0.0005472276,0.0006103733,0.0006479103,0.0003805467,0.0006186129,0.0008368076,0.0009452133,0.002485315],"category_scores_gemma":[0.001711223,0.0002882907,0.0003743034,0.0007068528,0.0006045739,0.001000196,0.001117681,0.001526102,0.00102479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004439519,"about_ca_system_score_gemma":0.0009224771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001236126,"about_ca_topic_score_gemma":0.001507207,"domain_scores_codex":[0.9995907,0.0001495002,0.00001556051,0.00004197532,0.0001751793,0.00002711519],"domain_scores_gemma":[0.999592,0.0001543984,0.00005017001,0.00005577453,0.0001229294,0.00002469521],"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.0004971755,0.0001649191,0.0005789026,0.0002101218,0.00005262457,0.0001677645,0.0002354339,0.3989639,0.0598134,0.07870478,0.005204867,0.4554061],"study_design_scores_gemma":[0.00001534979,0.00004344304,0.00005826193,0.000006301278,0.000003072336,0.00006698627,0.00001144679,0.9876289,0.005929286,0.003811385,0.002413369,0.00001218447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004709414,0.0001751295,0.9936292,0.0001261315,0.00002240189,0.00002265186,0.0000151343,0.0002356456,0.001064312],"genre_scores_gemma":[0.0879935,0.0002947269,0.908033,0.0001055698,0.00003457516,0.0001116603,0.0001126219,0.00007648489,0.003237873],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002485315,"threshold_uncertainty_score":0.008314192,"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."}}