Fast data-driven learning of parallel MRI sampling patterns for large scale problems

Emerging Trends in Magnetic Resonance Fingerprinting for Quantitative Biomedical Imaging Applications: A Review

Magnetic resonance imaging (MRI) stands as a vital medical imaging technique, renowned for its ability to offer high-resolution images of the human body with remarkable soft-tissue contrast. This enables healthcare professionals to gain valuable insights into various aspects of the human body, including morphology, structural integrity, and physiological processes. Quantitative imaging provides compositional measurements of the human body, but, currently, either it takes a long scan time or is limited to low spatial resolutions. Undersampled k-space data acquisitions have significantly helped to reduce MRI scan time, while compressed sensing (CS) and deep learning (DL) reconstructions have mitigated the associated undersampling artifacts. Alternatively, magnetic resonance fingerprinting (MRF) provides an efficient and versatile framework to acquire and quantify multiple tissue properties simultaneously from a single fast MRI scan. The MRF framework involves four key aspects: (1) pulse sequence design; (2) rapid (undersampled) data acquisition; (3) encoding of tissue properties in MR signal evolutions or fingerprints; and (4) simultaneous recovery of multiple quantitative spatial maps. This paper provides an extensive literature review of the MRF framework, addressing the trends associated with these four key aspects. There are specific challenges in MRF for all ranges of magnetic field strengths and all body parts, which can present opportunities for further investigation. We aim to review the best practices in each key aspect of MRF, as well as for different applications, such as cardiac, brain, and musculoskeletal imaging, among others. A comprehensive review of these applications will enable us to assess future trends and their implications for the translation of MRF into these biomedical imaging applications.

Optimizing variable flip angles in magnetization-prepared gradient-echo sequences for efficient 3D-T1ρ mapping

PURPOSE

To optimize the choice of the flip angles of magnetization-prepared gradient-echo sequences for improved accuracy, precision, and speed of 3D-T1ρ mapping.

METHODS

We propose a new optimization approach for finding variable flip-angle values that improve magnetization-prepared gradient-echo sequences used for 3D-T1ρ mapping. This new approach can improve the accuracy and SNR, while reducing filtering effects. We demonstrate the concept in the three different versions of the magnetization-prepared gradient-echo sequences that are typically used for 3D-T1ρ mapping and evaluate their performance in model agarose phantoms (n = 4) and healthy volunteers (n = 5) for knee joint imaging. We also tested the optimization with sequence parameters targeting faster acquisitions.

RESULTS

Our results show that optimized variable flip angle can improve the accuracy and the precision of the sequences, seen as a reduction of the mean of normalized absolute difference from about 5%-6% to 3%-4% in model phantoms and from 15%-16% to 11%-13% in the knee joint, and improving SNR from about 12-28 to 22-32 in agarose phantoms and about 7-14 to 13-17 in healthy volunteers. The optimization can also compensate for the loss in quality caused by making the sequence faster. This results in sequence configurations that acquire more data per unit of time with SNR and mean of normalized absolute difference measurements close to its slower versions.

CONCLUSION

The optimization of the variable flip angle can be used to increase accuracy and precision, and to improve the speed of the typical imaging sequences used for quantitative 3D-T1ρ mapping of the knee joint.

Efficient Approximation of Jacobian Matrices Involving a Non-Uniform Fast Fourier Transform (NUFFT)

There is growing interest in learning Fourier domain sampling strategies (particularly for magnetic resonance imaging, MRI) using optimization approaches. For non-Cartesian sampling, the system models typically involve non-uniform fast Fourier transform (NUFFT) operations. Commonly used NUFFT algorithms contain frequency domain interpolation, which is not differentiable with respect to the sampling pattern, complicating the use of gradient methods. This paper describes an efficient and accurate approach for computing approximate gradients involving NUFFTs. Multiple numerical experiments validate the improved accuracy and efficiency of the proposed approximation. As an application to computational imaging, the NUFFT Jacobians were used to optimize non-Cartesian MRI sampling trajectories via data-driven stochastic optimization. Specifically, the sampling patterns were learned with respect to various model-based image reconstruction (MBIR) algorithms. The proposed approach enables sampling optimization for image sizes that are infeasible with standard auto-differentiation methods due to memory limits. The synergistic acquisition and reconstruction design leads to remarkably improved image quality. In fact, we show that model-based image reconstruction methods with suitably optimized imaging parameters can perform nearly as well as CNN-based methods.

Data-driven optimization of sampling patterns for MR brain T1ρ mapping

PURPOSE

The goal of this study was to apply a fast data-driven optimization algorithm, called bias-accelerated subset selection, for MR brain T1ρ mapping to generate optimized sampling patterns (SPs) for compressed sensing reconstruction of brain 3D-T1ρ MRI.

METHODS

Five healthy volunteers were recruited, and fully sampled Cartesian 3D-T1ρ MRIs were obtained. Variable density (VD) and Poisson disc (PD) undersampling was used as the input to SP optimization process. The reconstruction used 3 compressed sensing methods: spatiotemporal finite differences, low-rank plus sparse with spatial finite differences, and low rank. The performance of images and T1ρ maps using PD-SP and VD-SP and their optimized sampling patterns (PD-OSP and VD-OSP) were compared to the fully sampled reference using normalized root mean square error (NRMSE).

RESULTS

The VD-OSP with spatiotemporal finite differences reconstruction (NRMSE = 0.078) and the PD-OSP with spatiotemporal finite differences reconstruction (NRMSE = 0.079) at the highest acceleration factors (AF = 30) showed the largest improvement compared to the respective nonoptimized SPs (VD NRMSE = 0.087 and PD NRMSE = 0.149). Prospective undersampling was tested at AF = 4, with VD-OSP NRMSE = 0.057 versus PD-OSP NRMSE = 0.060, with optimized sampling performing better that input PD or VD sampling. For brain T1ρ mapping, the VD-OSP with low rank reconstruction for AFs <10 and VD-OSP with spatiotemporal finite differences for AFs >10 perform better.

CONCLUSIONS

The study demonstrated that the appropriate use of data-driven optimized sampling and suitable compressed sensing reconstruction technique can be employed to potentially accelerate 3D T1ρ mapping for brain imaging applications.

Joint Optimization of k-t Sampling Pattern and Reconstruction of DCE MRI for Pharmacokinetic Parameter Estimation

This work proposes to develop and evaluate a deep learning framework that jointly optimizes k-t sampling patterns and reconstruction for head and neck dynamic contrast-enhanced (DCE) MRI aiming to reduce bias and uncertainty of pharmacokinetic (PK) parameter estimation. 2D Cartesian phase encoding k-space subsampling patterns for a 3D spoiled gradient recalled echo (SPGR) sequence along a time course of DCE MRI were jointly optimized in a deep learning-based dynamic MRI reconstruction network by a loss function concerning both reconstruction image quality and PK parameter estimation accuracy. During training, temporal k-space data sharing scheme was optimized as well. The proposed method was trained and tested by multi-coil complex digital reference objects of DCE images (mcDROs). The PK parameters estimated by the proposed method were compared with two published iterative DCE MRI reconstruction schemes using normalized root mean squared errors (NRMSEs) and Bland-Altman analysis at temporal resolutions of [Formula: see text] = 2s, 3s, 4s, and 5s, which correspond to undersampling rates of R = 50, 34, 25, and 20. The proposed method achieved low PK parameter NRMSEs at all four temporal resolutions compared with the benchmark methods on testing mcDROs. The Bland-Altman plots demonstrated that the proposed method reduced PK parameter estimation bias and uncertainty in tumor regions at temporal resolution of 2s. The proposed method also showed robustness to contrast arrival timing variations across patients. This work provides a potential way to increase PK parameter estimation accuracy and precision, and thus facilitate the clinical translation of DCE MRI.

B-Spline Parameterized Joint Optimization of Reconstruction and K-Space Trajectories (BJORK) for Accelerated 2D MRI

Optimizing k-space sampling trajectories is a promising yet challenging topic for fast magnetic resonance imaging (MRI). This work proposes to optimize a reconstruction method and sampling trajectories jointly concerning image reconstruction quality in a supervised learning manner. We parameterize trajectories with quadratic B-spline kernels to reduce the number of parameters and apply multi-scale optimization, which may help to avoid sub-optimal local minima. The algorithm includes an efficient non-Cartesian unrolled neural network-based reconstruction and an accurate approximation for backpropagation through the non-uniform fast Fourier transform (NUFFT) operator to accurately reconstruct and back-propagate multi-coil non-Cartesian data. Penalties on slew rate and gradient amplitude enforce hardware constraints. Sampling and reconstruction are trained jointly using large public datasets. To correct for possible eddy-current effects introduced by the curved trajectory, we use a pencil-beam trajectory mapping technique. In both simulations and in- vivo experiments, the learned trajectory demonstrates significantly improved image quality compared to previous model-based and learning-based trajectory optimization methods for 10× acceleration factors. Though trained with neural network-based reconstruction, the proposed trajectory also leads to improved image quality with compressed sensing-based reconstruction.

Optimization of spin-lock times in T1ρ mapping of knee cartilage: Cramér-Rao bounds versus matched sampling-fitting

PURPOSE

To compare different optimization approaches for choosing the spin-lock times (TSLs), in spin-lattice relaxation time in the rotating frame (T_1ρ ) mapping.

METHODS

Optimization criteria for TSLs based on Cramér-Rao lower bounds (CRLB) are compared with matched sampling-fitting (MSF) approaches for T_1ρ mapping on synthetic data, model phantoms, and knee cartilage. The MSF approaches are optimized using robust methods for noisy cost functions. The MSF approaches assume that optimal TSLs depend on the chosen fitting method. An iterative non-linear least squares (NLS) and artificial neural networks (ANN) are tested as two possible T_1ρ fitting methods for MSF approaches.

RESULTS

All optimized criteria were better than non-optimized ones. However, we observe that a modified CRLB and an MSF based on the mean of the normalized absolute error (MNAE) were more robust optimization approaches, performing well in all tested cases. The optimized TSLs obtained the best performance with synthetic data (3.5-8.0% error), model phantoms (1.5-2.8% error), and healthy volunteers (7.7-21.1% error), showing stable and improved quality results, comparing to non-optimized approaches (4.2-13.3% error on synthetic data, 2.1-6.2% error on model phantoms, 9.8-27.8% error on healthy volunteers).

CONCLUSION

A modified CRLB and the MSF based on MNAE are robust optimization approaches for choosing TSLs in T_1ρ mapping. All optimized criteria allowed good results even using rapid scans with two TSLs when a complex-valued fitting is done with iterative NLS or ANN.

Alternating Learning Approach for Variational Networks and Undersampling Pattern in Parallel MRI Applications

This work proposes an alternating learning approach to learn the sampling pattern (SP) and the parameters of variational networks (VN) in accelerated parallel magnetic resonance imaging (MRI). We investigate four variations of the learning approach, that alternates between improving the SP, using bias-accelerated subset selection, and improving parameters of the VN, using ADAM. The variations include the use of monotone or non-monotone alternating steps and systematic reduction of learning rates. The algorithms learn an effective pair to be used in future scans, including an SP that captures fewer k-space samples in which the generated undersampling artifacts are removed by the VN reconstruction. The quality of the VNs and SPs obtained by the proposed approaches is compared against different methods, including other kinds of joint learning methods and state-of-art reconstructions, on two different datasets at various acceleration factors (AF). We observed improvements visually and in three different figures of merit commonly used in deep learning (RMSE, SSIM, and HFEN) on AFs from 2 to 20 with brain and knee joint datasets when compared to the other approaches. The improvements ranged from 1% to 62% over the next best approach tested with VNs. The proposed approach has shown stable performance, obtaining similar learned SPs under different initial training conditions. We observe that the improvement is not only due to the learned sampling density, it is also due to the learned position of samples in k-space. The proposed approach was able to learn effective pairs of SPs and reconstruction VNs, improving 3D Cartesian accelerated parallel MRI applications.