MR image reconstruction with block sparsity and iterative support detection.

This work aims to develop a novel magnetic resonance (MR) image reconstruction approach motivated by the recently proposed sampling framework with union-of-subspaces model (SUoS). Based on SUoS, we propose a mathematical formalism that effectively integrates a block sparsity constraint and support information which is estimated in an iterative fashion. The resulting optimization problem consists of a data fidelity term and a support detection based block sparsity (SDBS) promoting term penalizing entries within the complement of the estimated support. We provide optional strategies for block assignment, and we also derive unique and robust recovery conditions in terms of the structured restricted isometric property (RIP), namely the block-RIP. The block-RIP constant we derive is lower than that of the previous structured sparse method, which leads to a reduction of the measurements. Simulation results for reconstructing individual and multiple T1/T2-weighted images demonstrate the consistency with our theoretical claims, and show considerable improvement in comparison with methods using only block sparsity or support information.

[1]  Minh N. Do,et al.  A Theory for Sampling Signals from a Union of Subspaces , 2022 .

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

[3]  Mihailo Stojnic,et al.  Strong thresholds for ℓ2/ℓ1-optimization in block-sparse compressed sensing , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[4]  Minh N. Do,et al.  Interventional MRI with sparse sampling using union-of-subspaces , 2012, 2012 9th IEEE International Symposium on Biomedical Imaging (ISBI).

[5]  D. Sodickson,et al.  A generalized approach to parallel magnetic resonance imaging. , 2001, Medical physics.

[6]  Martin Vetterli,et al.  Sampling and reconstruction of signals with finite rate of innovation in the presence of noise , 2005, IEEE Transactions on Signal Processing.

[7]  M Usman,et al.  Group sparse reconstruction using intensity‐based clustering , 2013, Magnetic resonance in medicine.

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

[9]  Justin P. Haldar,et al.  Compressed-Sensing MRI With Random Encoding , 2011, IEEE Transactions on Medical Imaging.

[10]  M Usman,et al.  k‐t group sparse: A method for accelerating dynamic MRI , 2011, Magnetic resonance in medicine.

[11]  Babak Hassibi,et al.  On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements , 2008, IEEE Transactions on Signal Processing.

[12]  Zhong Chen,et al.  Compressed sensing MRI based on nonsubsampled contourlet transform , 2008, 2008 IEEE International Symposium on IT in Medicine and Education.

[13]  A. Haase,et al.  FLASH imaging: rapid NMR imaging using low flip-angle pulses. 1986. , 1986, Journal of magnetic resonance.

[14]  Peter Rex Johnston,et al.  Computational Inverse Problems in Electrocardiography , 2001 .

[15]  Junzhou Huang,et al.  Efficient MR Image Reconstruction for Compressed MR Imaging , 2010, MICCAI.

[16]  Yonina C. Eldar,et al.  Robust Recovery of Signals From a Structured Union of Subspaces , 2008, IEEE Transactions on Information Theory.

[17]  Shiqian Ma,et al.  An efficient algorithm for compressed MR imaging using total variation and wavelets , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[18]  Armando Manduca,et al.  Highly Undersampled Magnetic Resonance Image Reconstruction via Homotopic $\ell_{0}$ -Minimization , 2009, IEEE Transactions on Medical Imaging.

[19]  Rick Chartrand,et al.  Fast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data , 2009, 2009 IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[20]  Wotao Yin,et al.  Sparse Signal Reconstruction via Iterative Support Detection , 2009, SIAM J. Imaging Sci..

[21]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[22]  Namrata Vaswani,et al.  Modified-CS: Modifying compressive sensing for problems with partially known support , 2009, ISIT.

[23]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

[24]  Nick G. Kingsbury,et al.  Convex approaches to model wavelet sparsity patterns , 2011, 2011 18th IEEE International Conference on Image Processing.

[25]  Yonina C. Eldar,et al.  Block-Sparse Signals: Uncertainty Relations and Efficient Recovery , 2009, IEEE Transactions on Signal Processing.

[26]  ProblemsPer Christian HansenDepartment.  The L-curve and its use in the numerical treatment of inverse problems , 2000 .

[27]  Junfeng Yang,et al.  A Fast Alternating Direction Method for TVL1-L2 Signal Reconstruction From Partial Fourier Data , 2010, IEEE Journal of Selected Topics in Signal Processing.

[28]  Huiqian Du,et al.  Compressed sensing MR image reconstruction using a motion-compensated reference. , 2012, Magnetic resonance imaging.

[29]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[30]  T. Blumensath,et al.  Sampling Theorems for Signals from the Union of Linear Subspaces , 2008 .

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

[32]  Peter Boesiger,et al.  Compressed sensing in dynamic MRI , 2008, Magnetic resonance in medicine.

[33]  Namrata Vaswani,et al.  Support-Predicted Modified-CS for recursive robust principal components' Pursuit , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[34]  Justin P. Haldar,et al.  Motion compensation for reference-constrained image reconstruction from limited data , 2011, 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro.