{"id":"W2083057505","doi":"10.1016/j.mri.2010.09.001","title":"An algorithm for sparse MRI reconstruction by Schatten p-norm minimization","year":2010,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Minification; Algorithm; Computer science; Norm (philosophy); Matrix completion; Noise reduction; Rank (graph theory); Nondeterministic algorithm; Iterative reconstruction; Time complexity; Matrix norm; Artificial intelligence; Mathematics; Mathematical optimization","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.0009486407,0.001092209,0.0009677269,0.0007729388,0.0005735352,0.0009321256,0.001546903,0.001896426,0.004367671],"category_scores_gemma":[0.003247743,0.0007030924,0.0008398148,0.001259372,0.0008876048,0.001457484,0.002064073,0.002638647,0.00300431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003951676,"about_ca_system_score_gemma":0.001350893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001487947,"about_ca_topic_score_gemma":0.002354195,"domain_scores_codex":[0.9994895,0.0001222769,0.00003095925,0.00008801942,0.0002431736,0.00002597094],"domain_scores_gemma":[0.9993026,0.000287358,0.0000454789,0.0001051123,0.000217183,0.00004225301],"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.0001799929,0.00009923653,0.0002429014,0.0002888493,0.00007577555,0.0001725355,0.0001811773,0.1852754,0.0257921,0.09610058,0.01364059,0.6779509],"study_design_scores_gemma":[0.00003651071,0.00007160738,0.0001141535,0.00002539422,0.00001931003,0.0003112177,0.00002081973,0.9465202,0.007261971,0.0326131,0.01297095,0.00003472727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002853987,0.00004278803,0.999136,0.00005814118,0.00002846641,0.00001314827,0.0000149746,0.000102741,0.0003183425],"genre_scores_gemma":[0.007206976,0.000134243,0.9906973,0.00006625054,0.00004198813,0.00008103651,0.0000759021,0.00008028496,0.001616013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004367671,"threshold_uncertainty_score":0.01461136,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005176297853252878,"score_gpt":0.2167130036065461,"score_spread":0.2115367057532932,"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."}}