Introduction: To develop and test the feasibility of free-breathing (FB), high-resolution quantitative first-pass perfusion cardiac MR (FPP-CMR) using dual-echo Dixon (FOSTERS; Fat-water separation for mOtion-corrected Spatio-TEmporally accelerated myocardial peRfuSion). Materials and Methods: FOSTERS was performed in FB using a dual-saturation single-bolus acquisition with dual-echo Dixon and a dynamically variable Cartesian k-t undersampling (8-fold) approach, with low-rank and sparsity constrained reconstruction, to achieve high-resolution FPP-CMR images. FOSTERS also included automatic in-plane motion estimation and T (Formula presented.) correction to obtain quantitative myocardial blood flow (MBF) maps. High-resolution (1.6 x 1.6 mm²) FB FOSTERS was evaluated in eleven patients, during rest, against standard-resolution (2.6 x 2.6 mm²) 2-fold SENSE-accelerated breath-hold (BH) FPP-CMR. In addition, MBF was computed for FOSTERS and spatial wavelet-based compressed sensing (CS) reconstruction. Two cardiologists scored the image quality (IQ) of FOSTERS, CS, and standard BH FPP-CMR images using a 4-point scale (1–4, non-diagnostic – fully diagnostic). Results: FOSTERS produced high-quality images without dark-rim and with reduced motion-related artifacts, using an 8x accelerated FB acquisition. FOSTERS and standard BH FPP-CMR exhibited excellent IQ with an average score of 3.5 ± 0.6 and 3.4 ± 0.6 (no statistical difference, p > 0.05), respectively. CS images exhibited severe artifacts and high levels of noise, resulting in an average IQ score of 2.9 ± 0.5. MBF values obtained with FOSTERS presented a lower variance than those obtained with CS. Discussion: FOSTERS enabled high-resolution FB FPP-CMR with MBF quantification. Combining motion correction with a low-rank and sparsity-constrained reconstruction results in excellent image quality.

Adaptive intelligence aims at empowering machine learning techniques with the additional use of domain knowledge. In this work, we present the application of adaptive intelligence to accelerate MR acquisition. Starting from undersampled k-space data, an iterative learning-based reconstruction scheme inspired by compressed sensing theory is used to reconstruct the images. We developed a novel deep neural network to refine and correct prior reconstruction assumptions given the training data. The network was trained and tested on a knee MRI dataset from the 2019 fastMRI challenge organized by Facebook AI Research and NYU Langone Health. All submissions to the challenge were initially ranked based on similarity with a known groundtruth, after which the top 4 submissions were evaluated radiologically. Our method was evaluated by the fastMRI organizers on an independent challenge dataset. It ranked #1, shared #1, and #3 on respectively the 8× accelerated multi-coil, the 4× multi-coil, and the 4× single-coil tracks. This demonstrates the superior performance and wide applicability of the method.

Demyelination is the key pathological process in multiple sclerosis (MS). The extent of demyelination can be quantified with magnetic resonance imaging by assessing the myelin water fraction (MWF). However, long computation times and high noise sensitivity hinder the translation of MWF imaging to clinical practice. In this work, we introduce a more efficient and noise robust method to determine the MWF using a joint sparsity constraint and a pre-computed B₁⁺-T₂ dictionary. A single component analysis with this dictionary is used in an initial step to obtain a B₁⁺ map. The T₂ distribution is then determined from a reduced dictionary corresponding to the estimated B₁⁺ map using a combination of a non-negativity and a joint sparsity constraint. The non-negativity constraint ensures that a feasible solution with non-negative contribution of each T₂ component is obtained. The joint sparsity constraint restricts the T₂ distribution to a small set of T₂ relaxation times shared between all voxels and reduces the noise sensitivity. The applied Sparsity Promoting Iterative Joint NNLS (SPIJN) algorithm can be implemented efficiently, reducing the computation time by a factor of 50 compared to the commonly used regularized non-negative least squares algorithm. The proposed method was validated in simulations and in 8 healthy subjects with a 3D multi-echo gradient- and spin echo scan at 3 ​T. In simulations, the absolute error in the MWF decreased from 0.031 to 0.013 compared to the regularized NNLS algorithm for SNR ​= ​250. The in vivo results were consistent with values reported in literature and improved MWF-quantification was obtained especially in the frontal white matter. The maximum standard deviation in mean MWF in different regions of interest between subjects was smaller for the proposed method (0.0193) compared to the regularized NNLS algorithm (0.0266). In conclusion, the proposed method for MWF estimation is less computationally expensive and less susceptible to noise compared to state of the art methods. These improvements might be an important step towards clinical translation of MWF measurements.

Purpose

To develop an efficient algorithm for multi‐component analysis of magnetic resonance fingerprinting (MRF) data without making a priori assumptions about the exact number of tissues or their relaxation properties.
Methods

Different tissues or components within a voxel are potentially separable in MRF because of their distinct signal evolutions. The observed signal evolution in each voxel can be described as a linear combination of the signals for each component with a non‐negative weight. An assumption that only a small number of components are present in the measured field of view is usually imposed in the interpretation of multi‐component data. In this work, a joint sparsity constraint is introduced to utilize this additional prior knowledge in the multi‐component analysis of MRF data. A new algorithm combining joint sparsity and non‐negativity constraints is proposed and compared to state‐of‐the‐art multi‐component MRF approaches in simulations and brain MRF scans of 11 healthy volunteers.
Results

Simulations and in vivo measurements show reduced noise in the estimated tissue fraction maps compared to previously proposed methods. Applying the proposed algorithm to the brain data resulted in 4 or 5 components, which could be attributed to different brain structures, consistent with previous multi‐component MRF publications.
Conclusions

The proposed algorithm is faster than previously proposed methods for multi‐component MRF and the simulations suggest improved accuracy and precision of the estimated weights. The results are easier to interpret compared to voxel‐wise methods, which combined with the improved speed is an important step toward clinical evaluation of multi‐component MRF.