{"id":"W2089752091","doi":"10.1016/j.mri.2012.08.011","title":"Non-convex algorithm for sparse and low-rank recovery: Application to dynamic MRI reconstruction","year":2012,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Norm (philosophy); Algorithm; Rank (graph theory); Property (philosophy); Computer science; Regular polygon; SIGNAL (programming language); Mathematical optimization; Convex optimization; Space (punctuation); Dynamic contrast-enhanced MRI; Mathematics; Combinatorics; Magnetic resonance imaging","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.0001281274,0.0001607879,0.0001672321,0.0001045868,0.00006864577,0.00005132719,0.00008636162,0.00004485187,0.000008954858],"category_scores_gemma":[0.00001024008,0.00018139,0.00003523227,0.0001301054,0.00003749082,0.0002155262,0.00003029467,0.00008753873,0.00001663449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005890547,"about_ca_system_score_gemma":0.000006285527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002499349,"about_ca_topic_score_gemma":0.000003671183,"domain_scores_codex":[0.9991573,0.000008596649,0.000189932,0.000221201,0.00008123604,0.0003417448],"domain_scores_gemma":[0.9995515,0.00003498633,0.00003023827,0.0002485992,0.00004554479,0.00008915151],"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.000005500908,0.00000661439,0.0008696283,0.00001533649,0.000002205514,5.253798e-7,0.0000703679,0.0001129486,0.01151163,0.0000146923,0.001083464,0.9863071],"study_design_scores_gemma":[0.0002895415,0.00003635474,0.01607068,0.0001465776,0.00001968616,0.00006505127,0.00004818931,0.9386384,0.01155757,0.0007043238,0.03210279,0.0003208176],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09421093,0.008405792,0.89439,0.0001763049,0.0005644751,0.0008246771,0.00001658045,0.0004681748,0.0009430993],"genre_scores_gemma":[0.7965984,0.0005178134,0.2019421,0.0001926872,0.0002435148,0.0002714127,0.00001124252,0.00006876881,0.0001539994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9859863,"threshold_uncertainty_score":0.7396868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004359878919697714,"score_gpt":0.2146555014622159,"score_spread":0.2102956225425182,"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."}}