{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543837,0.001257271,0.001115664,0.0006784254,0.0006452107,0.001240077,0.001265573,0.001690696,0.005298777],"category_scores_gemma":[0.008296932,0.000510051,0.000703265,0.001020352,0.000853277,0.001695617,0.001544625,0.003013896,0.001075429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001012561,"about_ca_system_score_gemma":0.002455741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00413166,"about_ca_topic_score_gemma":0.006863986,"domain_scores_codex":[0.9992259,0.0002711198,0.00003936957,0.0001475729,0.0002231781,0.00009276046],"domain_scores_gemma":[0.9946556,0.004081982,0.0003523778,0.0003719385,0.0004372368,0.0001008453],"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.0001482988,0.0002015822,0.0005327907,0.0002630454,0.00004565336,0.00009760807,0.0001192549,0.7581346,0.003153566,0.04266739,0.007131873,0.1875043],"study_design_scores_gemma":[0.00002198839,0.0000227147,0.00005129113,0.000008998564,0.000004537549,0.00003028778,0.00002234881,0.9822568,0.0007618582,0.01590565,0.0009064273,0.000006993914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002415797,0.0001468821,0.9953972,0.0003238576,0.00002208396,0.00004998254,0.00004385399,0.0003097332,0.001290582],"genre_scores_gemma":[0.1337549,0.0005518895,0.8615996,0.0002728492,0.0001263015,0.0004732842,0.0003103364,0.0002246238,0.002686187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005298777,"threshold_uncertainty_score":0.01772612,"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."}}