{"id":"W3111656085","doi":"10.18280/ts.370504","title":"Design and Application of a Greedy Pursuit Algorithm Adapted to Overcomplete Dictionary for Sparse Signal Recovery","year":2020,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Restricted isometry property; Compressed sensing; Matching pursuit; Orthonormal basis; SIGNAL (programming language); Greedy algorithm; Algorithm; Computer science; Signal reconstruction; Signal recovery; Matrix (chemical analysis); K-SVD; Subspace topology; Sparse approximation; Signal subspace; Signal processing; Pattern recognition (psychology); Artificial intelligence; Noise (video); Image (mathematics); Radar","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429927,0.0008125075,0.0008005751,0.0006134906,0.0003818397,0.0005504258,0.001082251,0.001152213,0.001306957],"category_scores_gemma":[0.001714858,0.0003265958,0.0006036337,0.0008904036,0.0005863358,0.0007115104,0.001223826,0.001007274,0.0007160119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002952255,"about_ca_system_score_gemma":0.001223782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007590106,"about_ca_topic_score_gemma":0.0008136414,"domain_scores_codex":[0.9993927,0.0001520477,0.00003461329,0.0001310726,0.0002424748,0.00004697282],"domain_scores_gemma":[0.9995172,0.0001413055,0.00006557743,0.00006463912,0.0001702709,0.00004100664],"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.0003103652,0.0001686487,0.001131783,0.0003150761,0.0001107094,0.0003363101,0.0001841183,0.4374225,0.08770092,0.04088141,0.003192133,0.428246],"study_design_scores_gemma":[0.00001778406,0.0001528994,0.00009955599,0.000006870765,0.00001003972,0.0001291651,0.00001244194,0.9915767,0.004286626,0.002184863,0.001510729,0.00001230207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002184827,0.00005863579,0.9971005,0.00004517927,0.00001686733,0.00003637874,0.000007429247,0.00008432642,0.0004657163],"genre_scores_gemma":[0.1786102,0.0003518389,0.819028,0.0001040676,0.00005093395,0.0003820586,0.00007866462,0.00003881445,0.001355419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001306957,"threshold_uncertainty_score":0.00437218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03293642103163985,"score_gpt":0.226703442672665,"score_spread":0.1937670216410251,"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."}}