Defining sub-regions in locally sparsified compressive sensing MRI

Magnetic Resonance Imaging (MRI) is an important imaging technique. However, it is a time consuming process. The aim of this study is to make the imaging process ef?cient. MR images are sparse in the sensing domain and Compressive Sensing exploits this sparsity. Locally sparsi?ed Compressed Sensing is a specialized case of CS which sub-divides the image and sparsi?es each region separately; later samples are taken based on sparsity level in that region. In this paper, a new structured approach is presented for de?ning the size and locality of sub-regions in image. Experiments were done on the regions de?ned by proposed framework and local sparsity constraints were used to achieve high sparsity level and to reduce the sample set. Experimental results and their comparison with global CS is presented in the paper.

[1]  P. Boesiger,et al.  SENSE: Sensitivity encoding for fast MRI , 1999, Magnetic resonance in medicine.

[2]  Robin M Heidemann,et al.  Generalized autocalibrating partially parallel acquisitions (GRAPPA) , 2002, Magnetic resonance in medicine.

[3]  D. L. Donoho,et al.  Rapid MR Imaging with "Compressed Sensing" and Randomly Under-Sampled 3DFT Trajectories , 2004 .

[4]  E.J. Candes.  Compressive Sampling , 2022 .

[5]  Joseph W. Carlson.  MRI data acquisition and image reconstruction from multiple, non-interacting receiver coils , 1989, Images of the Twenty-First Century. Proceedings of the Annual International Engineering in Medicine and Biology Society,.

[6]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[7]  Marseille,et al.  Nonuniform Phase-Encode Distributions for MRI Scan Time Reduction , 1996, Journal of magnetic resonance. Series B.

[8]  Michael Lustig,et al.  Faster Imaging with Randomly Perturbed, Undersampled Spirals and |L|_1 Reconstruction , 2004 .

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

[10]  Robert Bridson,et al.  Fast Poisson disk sampling in arbitrary dimensions , 2007, SIGGRAPH '07.

[11]  D. Donoho,et al.  SPIR-iT : Autocalibrating Parallel Imaging Compressed Sensing , 2008 .

[12]  Ying Dong,et al.  Novel compressive sensing MRI methods with combined sparsifying transforms , 2012, Proceedings of 2012 IEEE-EMBS International Conference on Biomedical and Health Informatics.

[13]  M. Lustig,et al.  SPIRiT: Iterative self‐consistent parallel imaging reconstruction from arbitrary k‐space , 2010, Magnetic resonance in medicine.

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

[15]  Ching-Hua Chang,et al.  Compressed sensing MRI with multi-channel data using multi-core processors , 2009, 2009 Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[16]  Saeid Nahavandi,et al.  Non-uniform sparsity in rapid compressive sensing MRI , 2012, 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[17]  James Demmel,et al.  Fast $\ell_1$ -SPIRiT Compressed Sensing Parallel Imaging MRI: Scalable Parallel Implementation and Clinically Feasible Runtime , 2012, IEEE Transactions on Medical Imaging.

[18]  Kurt Keutzer,et al.  Practical parallel imaging compressed sensing MRI: Summary of two years of experience in accelerating body MRI of pediatric patients , 2011, 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[19]  Cishen Zhang,et al.  Compressed sensing MRI by two-dimensional wavelet filter banks , 2011, The 2011 International Workshop on Multidimensional (nD) Systems.

[20]  Daniel K Sodickson,et al.  3Parallel magnetic resonance imaging with adaptive radius in k‐space (PARS): Constrained image reconstruction using k‐space locality in radiofrequency coil encoded data , 2005, Magnetic resonance in medicine.

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

[22]  Michael Lustig,et al.  k-t SPARSE: High frame rate dynamic MRI exploiting spatio-temporal sparsity , 2006 .