ACCELERATED CORONARY MRI USING 3D SPIRIT-RAKI WITH SPARSITY REGULARIZATION

JSENSE-Pro: Joint sensitivity estimation and image reconstruction in parallel imaging using pre-learned subspaces of coil sensitivity functions

PURPOSE

To improve calibrationless parallel imaging using pre-learned subspaces of coil sensitivity functions.

THEORY AND METHODS

A subspace-based joint sensitivity estimation and image reconstruction method was developed for improved parallel imaging with no calibration data. Specifically, we proposed to use a probabilistic subspace model to capture prior information of the coil sensitivity functions from previous scans acquired using the same receiver system. Both the subspace basis and coefficient distributions were learned from a small set of training data. The learned subspace model was then incorporated into the regularized reconstruction formalism that includes a sparsity prior. The nonlinear optimization problem was solved using alternating minimization algorithm. Public fastMRI brain dataset was retrospectively undersampled by different schemes for performance evaluation of the proposed method.

RESULTS

With no calibration data, the proposed method consistently produced the most accurate coil sensitivity estimation and highest quality image reconstructions at all acceleration factors tested in comparison with state-of-the-art methods including JSENSE, DeepSENSE, P-LORAKS, and Sparse BLIP. Our results are comparable to or even better than those from SparseSENSE, which used calibration data for sensitivity estimation. The work also demonstrated that the probabilistic subspace model learned from T₂ w data can be generalized to aiding the reconstruction of FLAIR data acquired from the same receiver system.

CONCLUSION

A subspace-based method named JSENSE-Pro has been proposed for accelerated parallel imaging without the acquisition of companion calibration data. The method is expected to further enhance the practical utility of parallel imaging, especially in applications where calibration data acquisition is not desirable or limited.

Improving high frequency image features of deep learning reconstructions via k-space refinement with null-space kernel

PURPOSE

Deep learning (DL) based reconstruction using unrolled neural networks has shown great potential in accelerating MRI. However, one of the major drawbacks is the loss of high-frequency details and textures in the output. The purpose of the study is to propose a novel refinement method that uses null-space kernel to refine k-space and improve blurred image details and textures.

METHODS

The proposed method constrains the output of the DL to comply to the linear neighborhood relationship calibrated in the auto-calibration lines. To demonstrate efficacy, we tested our refinement method on the DL reconstruction under a variety of conditions (i.e., dataset, unrolled neural networks, and under-sampling scheme). Specifically, the method was tested on three large-scale public datasets (knee and brain) from fastMRI's multi-coil track.

RESULTS

The proposed scheme visually reduces the structural error in the k-space domain, enhance the homogeneity of the k-space intensity. Consequently, reconstructed image shows sharper images with enhanced details and textures. The proposed method is also successful in improving high-frequency image details (SSIM, GMSD) without sacrificing overall image error (PSNR).

CONCLUSION

Our findings imply that refining DL output using the proposed method may generally improve DL reconstruction as tested with various large-scale dataset and networks.

A review and experimental evaluation of deep learning methods for MRI reconstruction

Following the success of deep learning in a wide range of applications, neural network-based machine-learning techniques have received significant interest for accelerating magnetic resonance imaging (MRI) acquisition and reconstruction strategies. A number of ideas inspired by deep learning techniques for computer vision and image processing have been successfully applied to nonlinear image reconstruction in the spirit of compressed sensing for accelerated MRI. Given the rapidly growing nature of the field, it is imperative to consolidate and summarize the large number of deep learning methods that have been reported in the literature, to obtain a better understanding of the field in general. This article provides an overview of the recent developments in neural-network based approaches that have been proposed specifically for improving parallel imaging. A general background and introduction to parallel MRI is also given from a classical view of k-space based reconstruction methods. Image domain based techniques that introduce improved regularizers are covered along with k-space based methods which focus on better interpolation strategies using neural networks. While the field is rapidly evolving with plenty of papers published each year, in this review, we attempt to cover broad categories of methods that have shown good performance on publicly available data sets. Limitations and open problems are also discussed and recent efforts for producing open data sets and benchmarks for the community are examined.

Scan-specific artifact reduction in k-space (SPARK) neural networks synergize with physics-based reconstruction to accelerate MRI

PURPOSE

To develop a scan-specific model that estimates and corrects k-space errors made when reconstructing accelerated MRI data.

METHODS

Scan-specific artifact reduction in k-space (SPARK) trains a convolutional-neural-network to estimate and correct k-space errors made by an input reconstruction technique by back-propagating from the mean-squared-error loss between an auto-calibration signal (ACS) and the input technique's reconstructed ACS. First, SPARK is applied to generalized autocalibrating partially parallel acquisitions (GRAPPA) and demonstrates improved robustness over other scan-specific models, such as robust artificial-neural-networks for k-space interpolation (RAKI) and residual-RAKI. Subsequent experiments demonstrate that SPARK synergizes with residual-RAKI to improve reconstruction performance. SPARK also improves reconstruction quality when applied to advanced acquisition and reconstruction techniques like 2D virtual coil (VC-) GRAPPA, 2D LORAKS, 3D GRAPPA without an integrated ACS region, and 2D/3D wave-encoded imaging.

RESULTS

SPARK yields SSIM improvement and 1.5 - 2× root mean squared error (RMSE) reduction when applied to GRAPPA and improves robustness to ACS size for various acceleration rates in comparison to other scan-specific techniques. When applied to advanced reconstruction techniques such as residual-RAKI, 2D VC-GRAPPA and LORAKS, SPARK achieves up to 20% RMSE improvement. SPARK with 3D GRAPPA also improves RMSE performance by ~2×, SSIM performance, and perceived image quality without a fully sampled ACS region. Finally, SPARK synergizes with non-Cartesian, 2D and 3D wave-encoding imaging by reducing RMSE between 20% and 25% and providing qualitative improvements.

CONCLUSION

SPARK synergizes with physics-based acquisition and reconstruction techniques to improve accelerated MRI by training scan-specific models to estimate and correct reconstruction errors in k-space.

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 dictionary-based graph-cut algorithm for MRI reconstruction

PURPOSE

Compressive sensing (CS)-based image reconstruction methods have proposed random undersampling schemes that produce incoherent, noise-like aliasing artifacts, which are easier to remove. The denoising process is critically assisted by imposing sparsity-enforcing priors. Sparsity is known to be induced if the prior is in the form of the L_p (0 ≤ p ≤ 1) norm. CS methods generally use a convex relaxation of these priors such as the L₁ norm, which may not exploit the full power of CS. An efficient, discrete optimization formulation is proposed, which works not only on arbitrary L_p -norm priors as some non-convex CS methods do, but also on highly non-convex truncated penalty functions, resulting in a specific type of edge-preserving prior. These advanced features make the minimization problem highly non-convex, and thus call for more sophisticated minimization routines.

THEORY AND METHODS

The work combines edge-preserving priors with random undersampling, and solves the resulting optimization using a set of discrete optimization methods called graph cuts. The resulting optimization problem is solved by applying graph cuts iteratively within a dictionary, defined here as an appropriately constructed set of vectors relevant to brain MRI data used here.

RESULTS

Experimental results with in vivo data are presented.

CONCLUSION

The proposed algorithm produces better results than regularized SENSE or standard CS for reconstruction of in vivo data.

High-Fidelity Accelerated MRI Reconstruction by Scan-Specific Fine-Tuning of Physics-Based Neural Networks

Long scan duration remains a challenge for high-resolution MRI. Deep learning has emerged as a powerful means for accelerated MRI reconstruction by providing data-driven regularizers that are directly learned from data. These data-driven priors typically remain unchanged for future data in the testing phase once they are learned during training. In this study, we propose to use a transfer learning approach to fine-tune these regularizers for new subjects using a self-supervision approach. While the proposed approach can compromise the extremely fast reconstruction time of deep learning MRI methods, our results on knee MRI indicate that such adaptation can substantially reduce the remaining artifacts in reconstructed images. In addition, the proposed approach has the potential to reduce the risks of generalization to rare pathological conditions, which may be unavailable in the training data.

Accelerated coronary MRI with sRAKI: A database-free self-consistent neural network k-space reconstruction for arbitrary undersampling

Purpose

To accelerate coronary MRI acquisitions with arbitrary undersampling patterns by using a novel reconstruction algorithm that applies coil self-consistency using subject-specific neural networks.

Methods

Self-consistent robust artificial-neural-networks for k-space interpolation (sRAKI) performs iterative parallel imaging reconstruction by enforcing self-consistency among coils. The approach bears similarity to SPIRiT, but extends the linear convolutions in SPIRiT to nonlinear interpolation using convolutional neural networks (CNNs). These CNNs are trained individually for each scan using the scan-specific autocalibrating signal (ACS) data. Reconstruction is performed by imposing the learned self-consistency and data-consistency, which enables sRAKI to support random undersampling patterns. Fully-sampled targeted right coronary artery MRI was acquired in six healthy subjects. The data were retrospectively undersampled, and reconstructed using SPIRiT, l₁-SPIRiT and sRAKI for acceleration rates of 2 to 5. Additionally, prospectively undersampled whole-heart coronary MRI was acquired to further evaluate reconstruction performance.

Results

sRAKI reduces noise amplification and blurring artifacts compared with SPIRiT and l₁-SPIRiT, especially at high acceleration rates in targeted coronary MRI. Quantitative analysis shows that sRAKI outperforms these techniques in terms of normalized mean-squared-error (~44% and ~21% over SPIRiT and l1-SPIRiT at rate 5) and vessel sharpness (~10% and ~20% over SPIRiT and l₁-SPIRiT at rate 5). Whole-heart data shows the sharpest coronary arteries when resolved using sRAKI, with 11% and 15% improvement in vessel sharpness over SPIRiT and l₁-SPIRiT, respectively.

Conclusion

sRAKI is a database-free neural network-based reconstruction technique that may further accelerate coronary MRI with arbitrary undersampling patterns, while improving noise resilience over linear parallel imaging and image sharpness over l₁ regularization techniques.

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.