{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001157756,0.000151787,0.0001998217,0.00007152245,0.00004547937,0.00002510803,0.0001160663,0.00005003675,0.00003775073],"category_scores_gemma":[0.000004745595,0.0001651577,0.00005190192,0.0001305992,0.00002164413,0.00009023447,0.00003067251,0.00006358985,0.000004019726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002833847,"about_ca_system_score_gemma":0.00001099483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001012264,"about_ca_topic_score_gemma":6.611479e-7,"domain_scores_codex":[0.9991634,0.00002249191,0.0002590961,0.0002132828,0.0001754721,0.0001662496],"domain_scores_gemma":[0.999603,0.00009046029,0.0000462488,0.00009322454,0.00006110749,0.0001059912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003334013,0.00006995815,0.00003733814,0.00007229269,0.0001959941,0.000005035239,0.0004155152,0.1527367,0.5741558,0.0004040073,0.01106407,0.2605099],"study_design_scores_gemma":[0.0004855867,0.0006215988,0.0004156248,0.0000385395,0.00005307231,0.000004726661,0.00002398763,0.9345948,0.05635229,0.0007234565,0.006483183,0.0002031046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008368107,0.0001209913,0.9899392,0.0002128211,0.00003130112,0.0008974563,0.00005445857,0.0003047953,0.00007093092],"genre_scores_gemma":[0.8448416,0.00001504866,0.1544552,0.0003113252,0.0001546665,0.000154308,0.00003207509,0.00003214454,0.000003584093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8364735,"threshold_uncertainty_score":0.6734934,"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."}}