{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009447401,0.0001323559,0.0001224951,0.0001117991,0.00005477317,0.00007210189,0.0001484473,0.00006379647,0.0002243344],"category_scores_gemma":[0.000001353152,0.0001258493,0.00006100428,0.0001463917,0.00002135047,0.00007760933,0.00002741767,0.0001444925,0.00006921277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003363129,"about_ca_system_score_gemma":0.00001503507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002178934,"about_ca_topic_score_gemma":0.00004346747,"domain_scores_codex":[0.9992011,0.00001405163,0.0001435763,0.0001436125,0.0002233964,0.0002742481],"domain_scores_gemma":[0.999674,0.00003651458,0.000008890555,0.0002038702,0.00003359603,0.00004315446],"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.00001767929,0.0001703214,0.0008898837,0.00005023716,0.000074685,0.0001737608,0.00006050399,0.2049245,0.1613833,0.0158377,0.08719265,0.5292248],"study_design_scores_gemma":[0.0002674329,0.000028224,0.002513206,0.00004139026,0.000009785528,0.00001255173,0.00001787624,0.5374214,0.4428991,0.005499413,0.01095755,0.0003320158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03475786,0.0001248163,0.8655349,0.00008201437,0.000121743,0.00009930491,0.000005079728,0.002645339,0.09662894],"genre_scores_gemma":[0.8699971,0.000004737727,0.1283375,0.0001082086,0.0001990063,0.000008529326,0.00002384418,0.00004447038,0.001276573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8352392,"threshold_uncertainty_score":0.5131986,"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."}}