{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001737976,0.001116342,0.00127475,0.0007122674,0.0006218612,0.001144128,0.001201264,0.001922464,0.003510212],"category_scores_gemma":[0.007803307,0.0004943113,0.0006560939,0.001507681,0.001153294,0.001453953,0.001723035,0.002759715,0.001262374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006013394,"about_ca_system_score_gemma":0.001557481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003739051,"about_ca_topic_score_gemma":0.005573914,"domain_scores_codex":[0.9994218,0.0001918398,0.00003152669,0.00007637879,0.0002435289,0.00003483944],"domain_scores_gemma":[0.9968565,0.002129464,0.0001798664,0.0002450114,0.0005032177,0.00008582504],"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.0002739135,0.0002378994,0.0003652427,0.0003244991,0.00006901605,0.0002745791,0.0002161678,0.5389451,0.017799,0.05663254,0.007546543,0.3773156],"study_design_scores_gemma":[0.00001177699,0.00002588792,0.00006037116,0.000006051564,0.000004676428,0.00005989363,0.00001295325,0.9912477,0.001911442,0.005413958,0.001236465,0.000008796445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001534441,0.0001111935,0.9974689,0.0001769129,0.00001665838,0.00001565891,0.00002094412,0.0001066275,0.0005486568],"genre_scores_gemma":[0.04595068,0.0005495489,0.9487123,0.0001284396,0.00008321711,0.0001253622,0.0001392794,0.0001665729,0.004144577],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003739051,"threshold_uncertainty_score":0.01174283,"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."}}