{"id":"W2972953868","doi":"10.1117/12.2526373","title":"Iterative and greedy algorithms for the sparsity in levels model in compressed sensing","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matching pursuit; Compressed sensing; Piecewise; Greedy algorithm; Algorithm; Thresholding; Computer science; Approximation algorithm; Context (archaeology); Encoder; Basis pursuit; Sampling (signal processing); Artificial intelligence; Mathematics; Image (mathematics); Computer vision","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.00009145827,0.0000948035,0.0001391261,0.0000626357,0.0000214069,0.00002945745,0.00005999702,0.00004628352,0.000003321139],"category_scores_gemma":[0.000005349859,0.00007294754,0.00001814855,0.00006917968,0.00001762035,0.00008536757,0.00003414011,0.0001060361,0.000001343816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002254754,"about_ca_system_score_gemma":0.000004892754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001034704,"about_ca_topic_score_gemma":0.0001537717,"domain_scores_codex":[0.9995602,0.00001169768,0.000109854,0.0001219953,0.0000502089,0.0001460203],"domain_scores_gemma":[0.9996821,0.000131851,0.00001116048,0.0001385681,0.00002143166,0.00001493496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003703123,0.00002800292,0.002710814,0.00004402822,0.00004253804,0.00001033901,0.00236623,0.9131266,0.05546723,0.002053059,0.000933895,0.02318021],"study_design_scores_gemma":[0.0003109817,0.0000100378,0.003160494,0.0000469666,0.000002737334,0.00000188325,0.0000681707,0.9769484,0.01765791,0.001616542,0.0000739045,0.0001019836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.576736,0.0001643181,0.4209426,0.00008171796,0.00006605352,0.0004540483,0.000005815463,0.000149856,0.001399624],"genre_scores_gemma":[0.9725848,0.00001508531,0.02721977,0.00008258008,0.0000125795,0.00000327822,9.27964e-7,0.00001261329,0.00006832655],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3958489,"threshold_uncertainty_score":0.2974714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0495775953521808,"score_gpt":0.2605631832484376,"score_spread":0.2109855878962568,"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."}}