Low-rank plus sparse reconstruction using dictionary learning for 3D-MRI

This work proposes a low-rank plus sparse model using dictionary learning for 3D-MRI reconstruction from downsampling k-space data. The scheme decomposes the dynamic image signal into two parts: low-rank part L and sparse part S and then, constructing it as a constrained optimization problem. In the optimization process,a nonconvex penalty function is used to optimize the low rank part L. The sparse part S is expressed by a over-complete dictionary using blind compressed sensing and we formulate the sparsity of coffecient matrix using l1 norm. To avoid the ill-posed of the problem, the Frobenius norm is used in dictionary. We adopt an alternate optimization algorithm to solve the problem, which cycles through the minimization of five subproblems. Finally, we prove the effectiveness of proposed method in two cardiac cine data sets. Experimental results were compared with exsiting L+S, L&S and BCS schemes, which demonstrate that the proposed method behaves better in removal of artifacts and maintaining the image details.

[1]  Yoram Bresler,et al.  MR Image Reconstruction From Highly Undersampled k-Space Data by Dictionary Learning , 2011, IEEE Transactions on Medical Imaging.

[2]  Pascal Frossard,et al.  Dictionary Learning , 2011, IEEE Signal Processing Magazine.

[3]  Mathews Jacob,et al.  A Fast Majorize–Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices , 2012, IEEE Transactions on Image Processing.

[4]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[5]  Jeffrey A. Fessler,et al.  Nonuniform fast Fourier transforms using min-max interpolation , 2003, IEEE Trans. Signal Process..

[6]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[7]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[8]  Daniel K Sodickson,et al.  Low‐rank plus sparse matrix decomposition for accelerated dynamic MRI with separation of background and dynamic components , 2015, Magnetic resonance in medicine.

[9]  Mathews Jacob,et al.  Blind Compressive Sensing Dynamic MRI , 2013, IEEE Transactions on Medical Imaging.

[10]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[11]  Rick Chartrand,et al.  Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition , 2012, IEEE Transactions on Signal Processing.

[12]  Eero P. Simoncelli,et al.  Image quality assessment: from error visibility to structural similarity , 2004, IEEE Transactions on Image Processing.

[13]  Jong Chul Ye,et al.  k‐t FOCUSS: A general compressed sensing framework for high resolution dynamic MRI , 2009, Magnetic resonance in medicine.

[14]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[15]  Yonina C. Eldar,et al.  Blind Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[16]  Mathews Jacob,et al.  Accelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR , 2011, IEEE Transactions on Medical Imaging.