MR Image Reconstruction via Sparse Representation: Modeling and Algorithm

To reduce acquisition time in magnetic resonance (MR) imaging, compressive sensing and sparse representation techniques have been developed to reconstruct MR images with partially acquired data. Although this has been a hot research topic in the field, it has not been used clinically due to three inherent problems of its current framework: potential loss of fine structures, difficulty to predefine model parameters, and long reconstruction time. The aim of this work is to tackle these problems. We propose to minimize the total variation of the underlying image, together with the `1 norm of the coefficients in its representation using a trained dictionary, as well as a fidelity term. Using a trained dictionary can take the advantage of prior knowledge and hence improve accuracy in reconstruction. Our data fidelity constraint is derived from the likelihood estimator of the recovering error in partial k-space to improve the robustness of the model to parameter selection. Moreover, a simple and efficient numerical scheme is provided to solve this model faster. The consequent experiments on both synthetic and in vivo data indicate the improvement of the proposed model in preserving fine structure, reducing computational cost, and flexibility of parameter decision.

[1]  Michael Elad,et al.  Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.

[2]  Michael Elad,et al.  Submitted to Ieee Transactions on Image Processing Image Decomposition via the Combination of Sparse Representations and a Variational Approach , 2022 .

[3]  J. C. Ye,et al.  Projection reconstruction MR imaging using FOCUSS , 2007, Magnetic resonance in medicine.

[4]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[5]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[6]  Stephen P. Boyd,et al.  An Efficient Method for Compressed Sensing , 2007, 2007 IEEE International Conference on Image Processing.

[7]  Joseph F. Murray,et al.  An improved FOCUSS-based learning algorithm for solving sparse linear inverse problems , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

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

[9]  Jian-Feng Cai,et al.  Linearized Bregman iterations for compressed sensing , 2009, Math. Comput..

[10]  Joseph F. Murray,et al.  Dictionary Learning Algorithms for Sparse Representation , 2003, Neural Computation.

[11]  R. Courant Variational methods for the solution of problems of equilibrium and vibrations , 1943 .

[12]  Junfeng Yang,et al.  A New Alternating Minimization Algorithm for Total Variation Image Reconstruction , 2008, SIAM J. Imaging Sci..

[13]  D. Donoho,et al.  Sparse MRI: The application of compressed sensing for rapid MR imaging , 2007, Magnetic resonance in medicine.

[14]  K. T. Block,et al.  Undersampled radial MRI with multiple coils. Iterative image reconstruction using a total variation constraint , 2007, Magnetic resonance in medicine.

[15]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

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

[17]  D. Donoho For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[18]  Wotao Yin,et al.  Bregman Iterative Algorithms for (cid:2) 1 -Minimization with Applications to Compressed Sensing ∗ , 2008 .

[19]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[20]  Emmanuel J. Candès,et al.  Signal recovery from random projections , 2005, IS&T/SPIE Electronic Imaging.

[21]  Junfeng Yang,et al.  A Fast TVL1-L2 Minimization Algorithm for Signal Reconstruction from Partial Fourier Data , 2008 .

[22]  Bin Dong,et al.  Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising , 2011, ArXiv.

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

[24]  Guillermo Sapiro,et al.  Sparse representations for limited data tomography , 2008, 2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[25]  L. He,et al.  MR Image Reconstruction from Sparse Radial Samples Using Bregman Iteration , 2006 .