Automated design of pulse sequences for magnetic resonance fingerprinting using physics-inspired optimization.

Magnetic resonance fingerprinting (MRF) is a method to extract quantitative tissue properties such as [Formula: see text] and [Formula: see text] relaxation rates from arbitrary pulse sequences using conventional MRI hardware. MRF pulse sequences have thousands of tunable parameters, which can be chosen to maximize precision and minimize scan time. Here, we perform de novo automated design of MRF pulse sequences by applying physics-inspired optimization heuristics. Our experimental data suggest that systematic errors dominate over random errors in MRF scans under clinically relevant conditions of high undersampling. Thus, in contrast to prior optimization efforts, which focused on statistical error models, we use a cost function based on explicit first-principles simulation of systematic errors arising from Fourier undersampling and phase variation. The resulting pulse sequences display features qualitatively different from previously used MRF pulse sequences and achieve fourfold shorter scan time than prior human-designed sequences of equivalent precision in [Formula: see text] and [Formula: see text] Furthermore, the optimization algorithm has discovered the existence of MRF pulse sequences with intrinsic robustness against shading artifacts due to phase variation.

3D magnetic resonance fingerprinting with quadratic RF phase.

PURPOSE: To implement 3D magnetic resonance fingerprinting (MRF) with quadratic RF phase (qRF-MRF) for simultaneous quantification of T1 , T2 , ΔB0 , and T2∗ . METHODS: 3D MRF data with effective undersampling factor of 3 in the slice direction were acquired with quadratic RF phase patterns for T1 , T2 , and T2∗ sensitivity. Quadratic RF phase encodes the off-resonance by modulating the on-resonance frequency linearly in time. Transition to 3D brings practical limitations for reconstruction and dictionary matching because of increased data and dictionary sizes. Randomized singular value decomposition (rSVD)-based compression in time and reduction in dictionary size with a quadratic interpolation method are combined to be able to process prohibitively large data sets in feasible reconstruction and matching times. RESULTS: Accuracy of 3D qRF-MRF maps in various resolutions and orientations are compared to 3D fast imaging with steady-state precession (FISP) for T1 and T2 contrast and to 2D qRF-MRF for T2∗ contrast and ΔB0 . The precision of 3D qRF-MRF was 1.5-2 times higher than routine clinical scans. 3D qRF-MRF ΔB0 maps were further processed to highlight the susceptibility contrast. CONCLUSION: Natively co-registered 3D whole brain T1 , T2 , T2∗ , ΔB0 , and QSM maps can be acquired in as short as 5 min with 3D qRF-MRF.

Magnetic resonance fingerprinting Part 1: Potential uses, current challenges, and recommendations.

Magnetic resonance fingerprinting (MRF) is a powerful quantitative MRI technique capable of acquiring multiple property maps simultaneously in a short timeframe. The MRF framework has been adapted to a wide variety of clinical applications, but faces challenges in technical development, and to date has only demonstrated repeatability and reproducibility in small studies. In this review, we discuss the current implementations of MRF and their use in a clinical setting. Based on this analysis, we highlight areas of need that must be addressed before MRF can be fully adopted into the clinic and make recommendations to the MRF community on standardization and validation strategies of MRF techniques. Level of Evidence: 2 Technical Efficacy: Stage 2 J. Magn. Reson. Imaging 2020;51:675-692.

Magnetic resonance fingerprinting review part 2: Technique and directions.

Magnetic resonance fingerprinting (MRF) is a general framework to quantify multiple MR-sensitive tissue properties with a single acquisition. There have been numerous advances in MRF in the years since its inception. In this work we highlight some of the recent technical developments in MRF, focusing on sequence optimization, modifications for reconstruction and pattern matching, new methods for partial volume analysis, and applications of machine and deep learning. Level of Evidence: 2 Technical Efficacy: Stage 2 J. Magn. Reson. Imaging 2020;51:993-1007.

Partial volume mapping using magnetic resonance fingerprinting.

Magnetic resonance fingerprinting (MRF) is a quantitative imaging technique that maps multiple tissue properties through pseudorandom signal excitation and dictionary-based reconstruction. The aim of this study is to estimate and validate partial volumes from MRF signal evolutions (PV-MRF), and to characterize possible sources of error. Partial volume model inversion (pseudoinverse) and dictionary-matching approaches to calculate brain tissue fractions (cerebrospinal fluid, gray matter, white matter) were compared in a numerical phantom and seven healthy subjects scanned at 3 T. Results were validated by comparison with ground truth in simulations and ROI analysis in vivo. Simulations investigated tissue fraction errors arising from noise, undersampling artifacts, and model errors. An expanded partial volume model was investigated in a brain tumor patient. PV-MRF with dictionary matching is robust to noise, and estimated tissue fractions are sensitive to model errors. A 6% error in pure tissue T1 resulted in average absolute tissue fraction error of 4% or less. A partial volume model within these accuracy limits could be semi-automatically constructed in vivo using k-means clustering of MRF-mapped relaxation times. Dictionary-based PV-MRF robustly identifies pure white matter, gray matter and cerebrospinal fluid, and partial volumes in subcortical structures. PV-MRF could also estimate partial volumes of solid tumor and peritumoral edema. We conclude that PV-MRF can attribute subtle changes in relaxation times to altered tissue composition, allowing for quantification of specific tissues which occupy a fraction of a voxel.

Three-dimensional MR Fingerprinting for Quantitative Breast Imaging.

Purpose To develop a fast three-dimensional method for simultaneous T1 and T2 quantification for breast imaging by using MR fingerprinting. Materials and Methods In this prospective study, variable flip angles and magnetization preparation modules were applied to acquire MR fingerprinting data for each partition of a three-dimensional data set. A fast postprocessing method was implemented by using singular value decomposition. The proposed technique was first validated in phantoms and then applied to 15 healthy female participants (mean age, 24.2 years ± 5.1 [standard deviation]; range, 18-35 years) and 14 female participants with breast cancer (mean age, 55.4 years ± 8.8; range, 39-66 years) between March 2016 and April 2018. The sensitivity of the method to B1 field inhomogeneity was also evaluated by using the Bloch-Siegert method. Results Phantom results showed that accurate and volumetric T1 and T2 quantification was achieved by using the proposed technique. The acquisition time for three-dimensional quantitative maps with a spatial resolution of 1.6 × 1.6 × 3 mm3 was approximately 6 minutes. For healthy participants, averaged T1 and T2 relaxation times for fibroglandular tissues at 3.0 T were 1256 msec ± 171 and 46 msec ± 7, respectively. Compared with normal breast tissues, higher T2 relaxation time (68 msec ± 13) was observed in invasive ductal carcinoma (P < .001), whereas no statistical difference was found in T1 relaxation time (1183 msec ± 256; P = .37). Conclusion A method was developed for breast imaging by using the MR fingerprinting technique, which allows simultaneous and volumetric quantification of T1 and T2 relaxation times for breast tissues. © RSNA, 2018 Online supplemental material is available for this article.

Slice profile and B1 corrections in 2D magnetic resonance fingerprinting.

PURPOSE: The goal of this study is to characterize and improve the accuracy of 2D magnetic resonance fingerprinting (MRF) scans in the presence of slice profile (SP) and B1 imperfections, which are two main factors that affect quantitative results in MRF. METHODS: The SP and B1 imperfections are characterized and corrected separately. The SP effect is corrected by simulating the radiofrequency pulse in the dictionary, and the B1 is corrected by acquiring a B1 map using the Bloch-Siegert method before each scan. The accuracy, precision, and repeatability of the proposed method are evaluated in phantom studies. The effects of both SP and B1 imperfections are also illustrated and corrected in the in vivo studies. RESULTS: The SP and B1 corrections improve the accuracy of the T1 and T2 values, independent of the shape of the radiofrequency pulse. The T1 and T2 values obtained from different excitation patterns become more consistent after corrections, which leads to an improvement of the robustness of the MRF design. CONCLUSION: This study demonstrates that MRF is sensitive to both SP and B1 effects, and that corrections can be made to improve the accuracy of MRF with only a 2-s increase in acquisition time. Magn Reson Med 78:1781-1789, 2017. © 2017 International Society for Magnetic Resonance in Medicine.

SVD compression for magnetic resonance fingerprinting in the time domain.

Magnetic resonance (MR) fingerprinting is a technique for acquiring and processing MR data that simultaneously provides quantitative maps of different tissue parameters through a pattern recognition algorithm. A predefined dictionary models the possible signal evolutions simulated using the Bloch equations with different combinations of various MR parameters and pattern recognition is completed by computing the inner product between the observed signal and each of the predicted signals within the dictionary. Though this matching algorithm has been shown to accurately predict the MR parameters of interest, one desires a more efficient method to obtain the quantitative images. We propose to compress the dictionary using the singular value decomposition, which will provide a low-rank approximation. By compressing the size of the dictionary in the time domain, we are able to speed up the pattern recognition algorithm, by a factor of between 3.4-4.8, without sacrificing the high signal-to-noise ratio of the original scheme presented previously.