{"id":"W1978360634","doi":"10.1109/jetcas.2012.2212774","title":"Algorithms to Approximately Solve NP Hard Row-Sparse MMV Recovery Problem: Application to Compressive Color Imaging","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Emerging and Selected Topics in Circuits and Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Algorithm; Nondeterministic algorithm; Sparse approximation; Convex optimization; Mathematical optimization; Regular polygon; Computational complexity theory; Computer science; Optimization problem; Row; Mathematics","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.0003576883,0.0002261617,0.0003448297,0.0002469357,0.0001670189,0.0002005781,0.0001178951,0.00009417048,0.00000123687],"category_scores_gemma":[0.0000247254,0.0002117061,0.00003133679,0.0003119466,0.00001388334,0.0001941496,0.00002073814,0.0003807581,0.000004060625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109461,"about_ca_system_score_gemma":0.0000117943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007346154,"about_ca_topic_score_gemma":0.000009865552,"domain_scores_codex":[0.9986067,0.00006422575,0.0004279821,0.0002278521,0.0002126641,0.0004605544],"domain_scores_gemma":[0.9992831,0.00005352842,0.0000963513,0.0001575229,0.0001487143,0.0002607719],"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.0001085494,0.0003509349,0.01864951,0.0004802323,0.0004024724,0.0001211313,0.01266976,0.2070079,0.2756829,0.002529355,0.02668018,0.4553171],"study_design_scores_gemma":[0.00297316,0.0009983716,0.03376873,0.004667966,0.0001997048,0.003227977,0.001703549,0.7096527,0.037547,0.001543434,0.2002029,0.003514526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.894434,0.002227056,0.09874614,0.0003556037,0.001669861,0.0008322363,0.000009755621,0.0003131487,0.001412241],"genre_scores_gemma":[0.9973764,0.0002667648,0.001224282,0.0001794007,0.0007852269,0.00005940928,0.000003536048,0.00003848258,0.00006644851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5026448,"threshold_uncertainty_score":0.8633124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02361823840519738,"score_gpt":0.2552226654830735,"score_spread":0.2316044270778761,"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."}}