{"id":"W2140196696","doi":"10.1109/icassp.2005.1416098","title":"Flexible Tree-Search Based Orthogonal Matching Pursuit Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Matching pursuit; Tree (set theory); Algorithm; Computer science; Matching (statistics); Computation; Flexibility (engineering); Computational complexity theory; Sparse approximation; Search algorithm; Mathematical optimization; Mathematics; Compressed sensing","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.0007481934,0.0004141248,0.0008216517,0.0006185303,0.0004344818,0.0006584627,0.001128555,0.001196228,0.002181082],"category_scores_gemma":[0.002598043,0.0002167765,0.0004972765,0.001407995,0.0004628131,0.001196025,0.001433337,0.0009750931,0.001062992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002997429,"about_ca_system_score_gemma":0.0009072782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007987455,"about_ca_topic_score_gemma":0.0008045323,"domain_scores_codex":[0.9993342,0.000155126,0.00003682137,0.0001010797,0.0002982038,0.00007466742],"domain_scores_gemma":[0.9993227,0.0002283278,0.00007377858,0.0001094678,0.0002163986,0.00004941054],"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.0003999542,0.0001111801,0.000868653,0.0001685391,0.0000625846,0.0002216254,0.0001450317,0.3334521,0.03679176,0.08562459,0.006873148,0.5352809],"study_design_scores_gemma":[0.00002547287,0.00006676615,0.0001194139,0.000006405574,0.000006448006,0.0001220802,0.000009467602,0.984116,0.002728818,0.009720885,0.003064215,0.00001386476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004293686,0.0001138055,0.9942058,0.0000718654,0.00001995643,0.00002675906,0.00003242974,0.0001500241,0.001085654],"genre_scores_gemma":[0.2152903,0.0004037918,0.7803272,0.0001743825,0.0000539705,0.0001951319,0.0003282949,0.00008706987,0.003139938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002181082,"threshold_uncertainty_score":0.007296443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01256898054176599,"score_gpt":0.2259785236497846,"score_spread":0.2134095431080186,"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."}}