Fast and accurate modeling of transient-state, gradient-spoiled sequences by recurrent neural networks

GPU-accelerated Bloch simulations and MR-STAT reconstructions using the Julia programming language

PURPOSE

MR-STAT is a relatively new multiparametric quantitative MRI technique in which quantitative paramater maps are obtained by solving a large-scale nonlinear optimization problem. Managing reconstruction times is one of the main challenges of MR-STAT. In this work we leverage GPU hardware to reduce MR-STAT reconstruction times. A highly optimized, GPU-compatible Bloch simulation toolbox is developed as part of this work that can be utilized for other quantitative MRI techniques as well.

METHODS

The Julia programming language was used to develop a flexible yet highly performant and GPU-compatible Bloch simulation toolbox called BlochSimulators.jl. The runtime performance of the toolbox is benchmarked against other Bloch simulation toolboxes. Furthermore, a (partially matrix-free) modification of a previously presented (matrix-free) MR-STAT reconstruction algorithm is proposed and implemented using the Julia language on GPU hardware. The proposed algorithm is combined with BlochSimulators.jl and the resulting MR-STAT reconstruction times on GPU hardware are compared to previously presented MR-STAT reconstruction times.

RESULTS

The BlochSimulators.jl package demonstrates superior runtime performance on both CPU and GPU hardware when compared to other existing Bloch simulation toolboxes. The GPU-accelerated partially matrix-free MR-STAT reconstruction algorithm, which relies on BlochSimulators.jl, allows for reconstructions of 68 seconds per two-dimensional (2D slice).

CONCLUSION

By combining the proposed Bloch simulation toolbox and the partially matrix-free reconstruction algorithm, 2D MR-STAT reconstructions can be performed in the order of one minute on a modern GPU card. The Bloch simulation toolbox can be utilized for other quantitative MRI techniques as well, for example for online dictionary generation for MR Fingerprinting.

Efficient performance analysis and optimization of transient-state sequences for multiparametric magnetic resonance imaging

In transient-state multiparametric MRI sequences such as Magnetic Resonance Spin TomogrAphy in Time-domain (MR-STAT), MR fingerprinting, or hybrid-state imaging, the flip angle pattern of the RF excitation varies over the sequence. This gives considerable freedom to choose an optimal pattern of flip angles. For pragmatic reasons, most optimization methodologies choose for a single-voxel approach (i.e., without taking the spatial encoding scheme into account). Particularly in MR-STAT, the context of spatial encoding is important. In the current study, we present a methodology, called BLock Analysis of a K-space-domain Jacobian (BLAKJac), which is sufficiently fast to optimize a sequence in the context of a predetermined phase-encoding pattern. Based on MR-STAT acquisitions and reconstructions, we show that sequences optimized using BLAKJac are more reliable in terms of actually achieved precision than conventional single-voxel-optimized sequences. In addition, BLAKJac provides analytical tools that give insights into the performance of the sequence in a very limited computation time. Our experiments are based on MR-STAT, but the theory is equally valid for other transient-state multiparametric methods.

Acceleration Strategies for MR-STAT: Achieving High-Resolution Reconstructions on a Desktop PC Within 3 Minutes

MR-STAT is an emerging quantitative magnetic resonance imaging technique which aims at obtaining multi-parametric tissue parameter maps from single short scans. It describes the relationship between the spatial-domain tissue parameters and the time-domain measured signal by using a comprehensive, volumetric forward model. The MR-STAT reconstruction solves a large-scale nonlinear problem, thus is very computationally challenging. In previous work, MR-STAT reconstruction using Cartesian readout data was accelerated by approximating the Hessian matrix with sparse, banded blocks, and can be done on high performance CPU clusters with tens of minutes. In the current work, we propose an accelerated Cartesian MR-STAT algorithm incorporating two different strategies: firstly, a neural network is trained as a fast surrogate to learn the magnetization signal not only in the full time-domain but also in the compressed low-rank domain; secondly, based on the surrogate model, the Cartesian MR-STAT problem is re-formulated and split into smaller sub-problems by the alternating direction method of multipliers. The proposed method substantially reduces the computational requirements for runtime and memory. Simulated and in-vivo balanced MR-STAT experiments show similar reconstruction results using the proposed algorithm compared to the previous sparse Hessian method, and the reconstruction times are at least 40 times shorter. Incorporating sensitivity encoding and regularization terms is straightforward, and allows for better image quality with a negligible increase in reconstruction time. The proposed algorithm could reconstruct both balanced and gradient-spoiled in-vivo data within 3 minutes on a desktop PC, and could thereby facilitate the translation of MR-STAT in clinical settings.

Artificial intelligence in cardiac magnetic resonance fingerprinting

Magnetic resonance fingerprinting (MRF) is a fast MRI-based technique that allows for multiparametric quantitative characterization of the tissues of interest in a single acquisition. In particular, it has gained attention in the field of cardiac imaging due to its ability to provide simultaneous and co-registered myocardial T₁ and T₂ mapping in a single breath-held cardiac MRF scan, in addition to other parameters. Initial results in small healthy subject groups and clinical studies have demonstrated the feasibility and potential of MRF imaging. Ongoing research is being conducted to improve the accuracy, efficiency, and robustness of cardiac MRF. However, these improvements usually increase the complexity of image reconstruction and dictionary generation and introduce the need for sequence optimization. Each of these steps increase the computational demand and processing time of MRF. The latest advances in artificial intelligence (AI), including progress in deep learning and the development of neural networks for MRI, now present an opportunity to efficiently address these issues. Artificial intelligence can be used to optimize candidate sequences and reduce the memory demand and computational time required for reconstruction and post-processing. Recently, proposed machine learning-based approaches have been shown to reduce dictionary generation and reconstruction times by several orders of magnitude. Such applications of AI should help to remove these bottlenecks and speed up cardiac MRF, improving its practical utility and allowing for its potential inclusion in clinical routine. This review aims to summarize the latest developments in artificial intelligence applied to cardiac MRF. Particularly, we focus on the application of machine learning at different steps of the MRF process, such as sequence optimization, dictionary generation and image reconstruction.

MR fingerprinting of the prostate

Multiparametric magnetic resonance imaging (mpMRI) has been adopted as the key tool for detection, localization, characterization, and risk stratification of patients suspected to have prostate cancer. Despite advantages over systematic biopsy, the interpretation of prostate mpMRI has limitations including a steep learning curve, leading to considerable interobserver variation. There is growing interest in clinical translation of quantitative imaging techniques for more objective lesion assessment. However, traditional mapping techniques are slow, precluding their use in the clinic. Magnetic resonance fingerprinting (MRF) is an efficient approach for quantitative maps of multiple tissue properties simultaneously. The T₁ and T₂ values obtained with MRF have been validated with phantom studies as well as in normal volunteers and patients. Studies have shown that MRF-derived T₁ and T₂ along with ADC values are all significant independent predictors in the differentiation between normal prostate tissue and prostate cancer, and hold promise in differentiating low and intermediate/high-grade cancers. This review seeks to introduce the basics of the prostate MRF technique, discuss the potential applications of prostate MRF for the characterization of prostate cancer, and describes ongoing areas of research.

A unifying view on extended phase graphs and Bloch simulations for quantitative MRI

Quantitative MRI methods and learning-based algorithms require exact forward simulations. One critical factor to correctly describe magnetization dynamics is the effect of slice-selective RF pulses. While contemporary simulation techniques correctly capture their influence, they only provide final magnetization distributions, require to be run for each parameter set separately, and make it hard to derive general theoretical conclusions and to generate a fundamental understanding of echo formation in the presence of slice-profile effects. This work aims to provide a mathematically exact framework, which is equally intuitive as extended phase graphs (EPGs), but also considers slice-profiles through their natural spatial representation. We show, through an analytical, hybrid Bloch-EPG formalism, that the spatially-resolved EPG approach allows to exactly predict the signal dependency on off-resonance, spoiling moment, microscopic dephasing, and echo time. We also demonstrate that our formalism allows to use the same phase graph to simulate both gradient-spoiled and balanced SSFP-based MR sequences. We present a derivation of the formalism and identify the connection to existing methods, i.e. slice-selective Bloch, slice-selective EPG, and the partitioned EPG. As a use case, the proposed hybrid Bloch-EPG framework is applied to MR Fingerprinting.