Sparsity-promoting calibration for GRAPPA accelerated parallel MRI reconstruction

Integrating data distribution prior via Langevin dynamics for end-to-end MR reconstruction

PURPOSE

To develop a novel deep learning-based method inheriting the advantages of data distribution prior and end-to-end training for accelerating MRI.

METHODS

Langevin dynamics is used to formulate image reconstruction with data distribution before facilitate image reconstruction. The data distribution prior is learned implicitly through the end-to-end adversarial training to mitigate the hyper-parameter selection and shorten the testing time compared to traditional probabilistic reconstruction. By seamlessly integrating the deep equilibrium model, the iteration of Langevin dynamics culminates in convergence to a fix-point, ensuring the stability of the learned distribution.

RESULTS

The feasibility of the proposed method is evaluated on the brain and knee datasets. Retrospective results with uniform and random masks show that the proposed method demonstrates superior performance both quantitatively and qualitatively than the state-of-the-art.

CONCLUSION

The proposed method incorporating Langevin dynamics with end-to-end adversarial training facilitates efficient and robust reconstruction for MRI. Empirical evaluations conducted on brain and knee datasets compellingly demonstrate the superior performance of the proposed method in terms of artifact removing and detail preserving.

Group feature selection for enhancing information gain in MRI reconstruction

Magnetic resonance imaging (MRI) has revolutionized the radiology. As a leading medical imaging modality, MRI not only visualizes the structures inside body, but also produces functional imaging. However, due to the slow imaging speed constrained by the MR physics, MRI cost is expensive, and patient may feel not comfortable in a scanner for a long time. Parallel MRI has accelerated the imaging speed through the sub-Nyquist sampling strategy and the missing data are interpolated by the multiple coil data acquired. Kernel learning has been used in the parallel MRI reconstruction to learn the interpolation weights and re-construct the undersampled data. However, noise and aliasing artifacts still exist in the reconstructed image and a large number of auto-calibration signal lines are needed. To further improve the kernel learning-based MRI reconstruction and accelerate the speed, this paper proposes a group feature selection strategy to improve the learning performance and enhance the reconstruction quality. An explicit kernel mapping is used for selecting a subset of features which contribute most to estimate the missing k-space data. The experimental results show that the learning behaviours can be better predicted and therefore the reconstructed image quality is improved.

Improving Nonlinear Interpolation of K-Space Data Using Semi-Supervised Learning and Autoregressive Model

Parallel magnetic resonance imaging (pMRI) accelerates data acquisition by undersampling k-space through an array of receiver coils. Finding accurate relationships between acquired and missing k-space data determines the interpolation performance and reconstruction quality. Autocalibration signals (ACS) are generally used to learn the interpolation coefficients for reconstructing the missing k-space data. Based on the estimation-approximation error analysis in machine learning, increasing training data size can reduce estimation error and therefore enhance generalization ability of the interpolator, but scanning time will be longer if more ACS data are acquired. We propose to augment training data using unacquired and acquired data outside of ACS region through semi-supervised learning idea and autoregressive model. Local neighbor unacquired k-space data can be used for training tasks and reducing the generalization error. Experimental results show that the proposed method outperforms the conventional methods by suppressing noise and aliasing artifacts.

Improved parallel magnetic resonance imaging reconstruction with multiple variable density sampling

Generalized auto-calibrating partially parallel acquisitions (GRAPPA) and other parallel Magnetic Resonance Imaging (pMRI) methods restore the unacquired data in k-space by linearly calculating the undersampled data around the missing points. In order to obtain the weight of the linear calculation, a small number of auto-calibration signal (ACS) lines need to be sampled at the center of the k-space. Therefore, the sampling pattern used in this type of method is to full sample data in the middle area and undersample in the outer k-space with nominal reduction factors. In this paper, we propose a novel reconstruction method with a multiple variable density sampling (MVDS) that is different from traditional sampling patterns. Our method can significantly improve the image quality using multiple reduction factors with fewer ACS lines. Specifically, the traditional sampling pattern only uses a single reduction factor to uniformly undersample data in the region outside the ACS, but we use multiple reduction factors. When sampling the k-space data, we keep the ACS lines unchanged, use a smaller reduction factor for undersampling data near the ACS lines and a larger reduction factor for the outermost part of k-space. The error is lower after reconstruction of this region by undersampled data with a smaller reduction factor. The experimental results show that with the same amount of data sampled, using NL-GRAPPA to reconstruct the k-space data sampled by our method can result in lower noise and fewer artifacts than traditional methods. In particular, our method is extremely effective when the number of ACS lines is small.

A Network-Driven Prior Induced Bregman Model for Parallel MR Imaging

Compressed sensing based parallel imaging (CS-PI) has attracted great attention in fast magnetic resonance imaging (MRI) community. In particular, Bregman iterative model has shown encouraging performance in solving this problem. However, its regularization term still has large room for improvement. In this work, we propose a network-driven prior induced Bregman model, dubbed as Breg-EDAEP, for CS-PI task. In the present model, the implicit property among different channel MR images is preliminarily explored by the network to obtain more structure details in iterative reconstruction procedure. Experiments on various acceleration factors and sampling patterns have shown that the proposed method outperforms the state-of-the-art algorithms. Breg-EDAEP possesses strong capability to restore image details and preserves well structure information.

Deep-Learning Methods for Parallel Magnetic Resonance Imaging Reconstruction: A Survey of the Current Approaches, Trends, and Issues

Following the success of deep learning in a wide range of applications, neural network-based machine learning techniques have received interest as a means of accelerating magnetic resonance imaging (MRI). A number of ideas inspired by deep learning techniques from computer vision and image processing have been successfully applied to non-linear image reconstruction in the spirit of compressed sensing for both low dose computed tomography and accelerated MRI. The additional integration of multi-coil information to recover missing k-space lines in the MRI reconstruction process, is still studied less frequently, even though it is the de-facto standard for currently used accelerated MR acquisitions. This manuscript provides an overview of the recent machine learning approaches that have been proposed specifically for improving parallel imaging. A general background introduction to parallel MRI is given that is structured around the classical view of image space and k-space based methods. Both linear and non-linear methods are covered, followed by a discussion of recent efforts to further improve parallel imaging using machine learning, and specifically using artificial neural networks. Image-domain based techniques that introduce improved regularizers are covered as well as k-space based methods, where the focus is on better interpolation strategies using neural networks. Issues and open problems are discussed as well as recent efforts for producing open datasets and benchmarks for the community.

KerNL: Kernel-Based Nonlinear Approach to Parallel MRI Reconstruction

The conventional calibration-based parallel imaging method assumes a linear relationship between the acquired multi-channel k-space data and the unacquired missing data, where the linear coefficients are estimated using some auto-calibration data. In this paper, we first analyze the model errors in the conventional calibration-based methods and demonstrate the nonlinear relationship. Then, a much more general nonlinear framework is proposed for auto-calibrated parallel imaging. In this framework, kernel tricks are employed to represent the general nonlinear relationship between acquired and unacquired k-space data without increasing the computational complexity. Identification of the nonlinear relationship is still performed by solving linear equations. Experimental results demonstrate that the proposed method can achieve reconstruction quality superior to GRAPPA and NL-GRAPPA at high net reduction factors.

Scan-specific robust artificial-neural-networks for k-space interpolation (RAKI) reconstruction: Database-free deep learning for fast imaging

PURPOSE

To develop an improved k-space reconstruction method using scan-specific deep learning that is trained on autocalibration signal (ACS) data.

THEORY

Robust artificial-neural-networks for k-space interpolation (RAKI) reconstruction trains convolutional neural networks on ACS data. This enables nonlinear estimation of missing k-space lines from acquired k-space data with improved noise resilience, as opposed to conventional linear k-space interpolation-based methods, such as GRAPPA, which are based on linear convolutional kernels.

METHODS

The training algorithm is implemented using a mean square error loss function over the target points in the ACS region, using a gradient descent algorithm. The neural network contains 3 layers of convolutional operators, with 2 of these including nonlinear activation functions. The noise performance and reconstruction quality of the RAKI method was compared with GRAPPA in phantom, as well as in neurological and cardiac in vivo data sets.

RESULTS

Phantom imaging shows that the proposed RAKI method outperforms GRAPPA at high (≥4) acceleration rates, both visually and quantitatively. Quantitative cardiac imaging shows improved noise resilience at high acceleration rates (rate 4:23% and rate 5:48%) over GRAPPA. The same trend of improved noise resilience is also observed in high-resolution brain imaging at high acceleration rates.

CONCLUSION

The RAKI method offers a training database-free deep learning approach for MRI reconstruction, with the potential to improve many existing reconstruction approaches, and is compatible with conventional data acquisition protocols.

Improving parallel imaging by jointly reconstructing multi-contrast data

PURPOSE

To develop parallel imaging techniques that simultaneously exploit coil sensitivity encoding, image phase prior information, similarities across multiple images, and complementary k-space sampling for highly accelerated data acquisition.

METHODS

We introduce joint virtual coil (JVC)-generalized autocalibrating partially parallel acquisitions (GRAPPA) to jointly reconstruct data acquired with different contrast preparations, and show its application in 2D, 3D, and simultaneous multi-slice (SMS) acquisitions. We extend the joint parallel imaging concept to exploit limited support and smooth phase constraints through Joint (J-) LORAKS formulation. J-LORAKS allows joint parallel imaging from limited autocalibration signal region, as well as permitting partial Fourier sampling and calibrationless reconstruction.

RESULTS

We demonstrate highly accelerated 2D balanced steady-state free precession with phase cycling, SMS multi-echo spin echo, 3D multi-echo magnetization-prepared rapid gradient echo, and multi-echo gradient recalled echo acquisitions in vivo. Compared to conventional GRAPPA, proposed joint acquisition/reconstruction techniques provide more than 2-fold reduction in reconstruction error.

CONCLUSION

JVC-GRAPPA takes advantage of additional spatial encoding from phase information and image similarity, and employs different sampling patterns across acquisitions. J-LORAKS achieves a more parsimonious low-rank representation of local k-space by considering multiple images as additional coils. Both approaches provide dramatic improvement in artifact and noise mitigation over conventional single-contrast parallel imaging reconstruction. Magn Reson Med 80:619-632, 2018. © 2018 International Society for Magnetic Resonance in Medicine.

Subject-Specific Convolutional Neural Networks for Accelerated Magnetic Resonance Imaging

Magnetic Resonance Imaging (MRI) is one of the leading modalities for medical imaging, providing excellent soft-tissue contrast without exposure to ionizing radiation. Despite continuing advances in MRI, long scan times remain a major limitation in clinical applications. Parallel imaging is a technique for scan time acceleration in MRI, which utilizes the spatial variations in the reception profiles of receiver coil arrays to reconstruct images from undersampled Fourier space, i.e. k-space. One of the most commonly used parallel imaging techniques employs interpolation of missing k-space information by using linear shift-invariant convolutional kernels. These kernels are trained on a limited amount of autocalibration signal (ACS) for each scan. We propose a novel method for parallel imaging, Robust Artificial-neural-networks for k-space Interpolation (RAKI), which uses scan-specific convolutional neural networks (CNNs) to perform improved k-space interpolation. Three-layer CNNs are trained using only scan-specific ACS data, alleviating the need for large training databases. The proposed method was tested in ultra-high resolution brain MRI and quantitative cardiac MRI, acquired with various acceleration rates. Improved noise resilience as compared to existing parallel imaging methods was observed for high acceleration rates or in the presence of low signal-to-noise ratio (SNR). Furthermore, RAKI successfully reconstructed images for quantitative cardiac MRI, even when using the same CNN across images with varying contrasts. These results indicate that RAKI achieves improved noise performance without overfitting to specific image contents, and offers great promise for improved acceleration in a wide range of MRI applications.

Learning Joint-Sparse Codes for Calibration-Free Parallel MR Imaging

The integration of compressed sensing and parallel imaging (CS-PI) has shown an increased popularity in recent years to accelerate magnetic resonance (MR) imaging. Among them, calibration-free techniques have presented encouraging performances due to its capability in robustly handling the sensitivity information. Unfortunately, existing calibration-free methods have only explored joint-sparsity with direct analysis transform projections. To further exploit joint-sparsity and improve reconstruction accuracy, this paper proposes to Learn joINt-sparse coDes for caliBration-free parallEl mR imaGing (LINDBERG) by modeling the parallel MR imaging problem as an - - minimization objective with an norm constraining data fidelity, Frobenius norm enforcing sparse representation error and the mixed norm triggering joint sparsity across multichannels. A corresponding algorithm has been developed to alternatively update the sparse representation, sensitivity encoded images and K-space data. Then, the final image is produced as the square root of sum of squares of all channel images. Experimental results on both physical phantom and in vivo data sets show that the proposed method is comparable and even superior to state-of-the-art CS-PI reconstruction approaches. Specifically, LINDBERG has presented strong capability in suppressing noise and artifacts while reconstructing MR images from highly undersampled multichannel measurements.

Efficient operator splitting algorithm for joint sparsity-regularized SPIRiT-based parallel MR imaging reconstruction

Self-consistent parallel imaging (SPIRiT) is an auto-calibrating model for the reconstruction of parallel magnetic resonance imaging, which can be formulated as a regularized SPIRiT problem. The Projection Over Convex Sets (POCS) method was used to solve the formulated regularized SPIRiT problem. However, the quality of the reconstructed image still needs to be improved. Though methods such as NonLinear Conjugate Gradients (NLCG) can achieve higher spatial resolution, these methods always demand very complex computation and converge slowly. In this paper, we propose a new algorithm to solve the formulated Cartesian SPIRiT problem with the JTV and JL1 regularization terms. The proposed algorithm uses the operator splitting (OS) technique to decompose the problem into a gradient problem and a denoising problem with two regularization terms, which is solved by our proposed split Bregman based denoising algorithm, and adopts the Barzilai and Borwein method to update step size. Simulation experiments on two in vivo data sets demonstrate that the proposed algorithm is 1.3 times faster than ADMM for datasets with 8 channels. Especially, our proposal is 2 times faster than ADMM for the dataset with 32 channels.

Efficient Compressed Sensing SENSE pMRI Reconstruction With Joint Sparsity Promotion

The theory and techniques of compressed sensing (CS) have shown their potential as a breakthrough in accelerating k-space data acquisition for parallel magnetic resonance imaging (pMRI). However, the performance of CS reconstruction models in pMRI has not been fully maximized, and CS recovery guarantees for pMRI are largely absent. To improve reconstruction accuracy from parsimonious amounts of k-space data while maintaining flexibility, a new CS SENSitivity Encoding (SENSE) pMRI reconstruction framework promoting joint sparsity (JS) across channels (JS CS SENSE) is proposed in this paper. The recovery guarantee derived for the proposed JS CS SENSE model is demonstrated to be better than that of the conventional CS SENSE model and similar to that of the coil-by-coil CS model. The flexibility of the new model is better than the coil-by-coil CS model and the same as that of CS SENSE. For fast image reconstruction and fair comparisons, all the introduced CS-based constrained optimization problems are solved with split Bregman, variable splitting, and combined-variable splitting techniques. For the JS CS SENSE model in particular, these techniques lead to an efficient algorithm. Numerical experiments show that the reconstruction accuracy is significantly improved by JS CS SENSE compared with the conventional CS SENSE. In addition, an accurate residual-JS regularized sensitivity estimation model is also proposed and extended to calibration-less (CaL) JS CS SENSE. Numerical results show that CaL JS CS SENSE outperforms other state-of-the-art CS-based calibration-less methods in particular for reconstructing non-piecewise constant images.