An algorithm for sparse MRI reconstruction by Schatten p-norm minimization.
In recent years, there has been a concerted effort to reduce the MR scan time. Signal processing research aims at reducing the scan time by acquiring less K-space data. The image is reconstructed from the subsampled K-space data by employing compressed sensing (CS)-based reconstruction techniques. In this article, we propose an alternative approach to CS-based reconstruction. The proposed approach exploits the rank deficiency of the MR images to reconstruct the image. This requires minimizing the rank of the image matrix subject to data constraints, which is unfortunately a nondeterministic polynomial time (NP) hard problem. Therefore we propose to replace the NP hard rank minimization problem by its nonconvex surrogate - Schatten p-norm minimization. The same approach can be used for denoising MR images as well. Since there is no algorithm to solve the Schatten p-norm minimization problem, we derive an efficient first-order algorithm. Experiments on MR brain scans show that the reconstruction and denoising accuracy from our method is at par with that of CS-based methods. Our proposed method is considerably faster than CS-based methods.
Majumdar
Angshul
A
Department of Electrical and Computer Engineering, University of British Columbia, Kaiser 20102332 Main Mall, Vancouver, BC, Canada V6T1Z4. angshulm@ece.ubc.ca
Ward
Rabab K
RK
D000465:Algorithms; D003627:Data Interpretation, Statistical; D006801:Humans; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D008279:Magnetic Resonance Imaging / Q000379:methods*; D015203:Reproducibility of Results; D018401:Sample Size; D012680:Sensitivity and Specificity