{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008884507,0.0001611401,0.0001369519,0.00008199352,0.00009177589,0.0001072891,0.0001539903,0.00006486001,0.00005542523],"category_scores_gemma":[0.00001428985,0.0001797185,0.00003825097,0.0001103999,0.00006773943,0.0002895474,0.0000138238,0.0001702408,0.000006476477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001975546,"about_ca_system_score_gemma":0.00001007283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002942768,"about_ca_topic_score_gemma":0.00001013127,"domain_scores_codex":[0.999159,0.00001197787,0.0002024407,0.0002523265,0.0001030191,0.0002712349],"domain_scores_gemma":[0.9994701,0.00002613918,0.00003614953,0.0003211553,0.00008290678,0.000063539],"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.000002626037,0.00001011749,0.0005742672,0.000004069333,0.000001365137,0.000001761058,0.00003626413,0.00008842132,0.0559271,0.0000340051,0.008905867,0.9344141],"study_design_scores_gemma":[0.0002760944,0.00003361605,0.001125369,0.00003750558,0.0000114069,0.00005188967,0.00003513869,0.8555434,0.04499792,0.0007021069,0.09693899,0.000246503],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1575006,0.00658586,0.8263674,0.0004029566,0.002441756,0.0009154361,0.00008165036,0.002403443,0.003300966],"genre_scores_gemma":[0.365719,0.0003539786,0.6324065,0.0002119355,0.0005872719,0.0001429952,0.000077818,0.0001312059,0.0003692091],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9341676,"threshold_uncertainty_score":0.7328709,"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."}}