Abstract
Magnetic resonance fingerprinting (MRF), as an emerging versatile and noninvasive imaging technique, provides simultaneous quantification of multiple quantitative MRI parameters, which have been used to detect changes in cartilage composition and structure in osteoarthritis. Deep learning (DL)-based methods for quantification mapping in MRF overcome the memory constraints and offer faster processing compared to the conventional dictionary matching (DM) method. However, limited attention has been given to the fine-tuning of neural networks (NNs) in DL and fair comparison with DM. In this study, we investigate the impact of training parameter choices on NN performance and compare the fine-tuned NN with DM for multiparametric mapping in MRF. Our approach includes optimizing NN hyperparameters, analyzing the singular value decomposition (SVD) components of MRF data, and optimization of the DM method. We conducted experiments on synthetic data, the NIST/ISMRM MRI system phantom with ground truth, and in vivo knee data from 14 healthy volunteers. The results demonstrate the critical importance of selecting appropriate training parameters, as these significantly affect NN performance. The findings also show that NNs improve the accuracy and robustness of T1, T2, and T1ρ mappings compared to DM in synthetic datasets. For in vivo knee data, the NN achieved comparable results for T1, with slightly lower T2 and slightly higher T1ρ measurements compared to DM. In conclusion, the fine-tuned NN can be used to increase accuracy and robustness for multiparametric quantitative mapping from MRF of the knee joint.
Keywords: Quantitative MRI, MR Fingerprinting, Musculoskeletal Imaging, Deep learning
1. INTRODUCTION
Osteoarthritis (OA), as one of the most common and debilitating chronic joint diseases, is primarily characterized by the progressive degeneration of articular cartilage and other joint structures1. Quantitative MRI techniques, including spin-lattice relaxation time (T1), spin-spin relaxation time (T2), and spin-lattice relaxation time in the rotating frame (T1ρ), have been used to detect changes in cartilage composition and structure during the early stages of the disease before the onset of morphologic cartilage loss2. Cartilage T2 and T1ρ measurements, which have been shown to reliably distinguish between subjects with and without knee OA3,4, are commonly performed together in OA research studies for evaluation of cartilage composition and structure5.
Magnetic resonance fingerprinting (MRF) is a new versatile and noninvasive imaging technique, allowing for simultaneous quantification of multiple quantitative MRI parameters, which can reduce the MRI examination times in research studies6. In MRF, pulse sequence parameters such as flip-angles (FAs) and repetition times (TRs) are modulated in such a way that results in a unique signal evolution (SE), also called MR fingerprint, for a particular type of tissue, depending on the T1, T2, and T1ρ values. The measured voxel-wise MR fingerprints are then matched to a precomputed dictionary of simulated signals for different combinations of parameters using the scalar product, usually adopted as a similarity measure. This approach is referred to as dictionary matching (DM), and it is a brute-force grid search. This approach is simple but has known practical challenges, such as discretization errors and the so-called curse of dimensionality7, which essentially corresponds to the exponential increase of memory, and computation time requirements with the linear increase in the number of biophysical parameters8,9. Part of the computational burden of DM can be alleviated by singular value decomposition (SVD) techniques.9–14 Nonetheless, these improvements do not overcome the curse of dimensionality, and the computational burden is prohibitive for models with many parameters15. In contrast, dictionary-free regression methods16,17, as well as deep learning (DL) methods can overcome this issue. As a result, these methods are very fast once the network has been trained.
Although the feasibility of neural network (NN) approaches for quantitative mapping from MRF has been investigated in previous works15,18–23, little consideration has been given to the fine-tuning of NN for quantitative mapping from MRF. Previously, different sampling strategies were considered, Virtue et al.23 constructed the training dataset by sampling the MR parameter space using a random uniform distribution, while Hoppe et al.21, Cohen et al.19, and Golbabee et al.18 used a grid sampling of the MR parameter space. Different strategies have been studied regarding using noise during the training phase, mainly the use of additive Gaussian noise with zero mean and 1% standard deviation 15,19 or using no noise at all21,23. The choice of the compressed dimension that should be used, the noise level during training, and the learning rate can largely affect the accuracy, and robustness of the NN, however, few works have investigated those aspects, and no work has been done to compare the noise robustness between NN and DM.
In this sense, this study has two main goals: 1) to investigate how the performance of the NNs is affected by these training choices, and 2) to compare the performance of the fine-tuned NN against DM in multiparametric mapping from MRF. To have a fair comparison, the DM is also optimized. To achieve these aims, we first explored the fine-tuning of NN in different aspects, including the SVD components of MRF, training hyperparameters, and the optimization of DM, including the SVD components and dictionary size, and tested them in synthetic data, and NIST/ISMRM MRI system phantom data with ground truth. We then studied the noise robustness of the fine-tuned NN and optimized DM by adding different noise levels to a test dataset with sampled T1, T2, and T1ρ covering the range in the knee joint. Finally, we compared the results of both approaches for T1, T2, and T1ρ mapping in 14 healthy subjects.
2. METHODS
2.1. Pulse sequences
A 3D-golden-angle radial stack-of-stars sequence, which quantifies four parameters: T1, T2, T1ρ, and B1+, was used for the MRF acquisition24,25. This 3D-MRF sequence consists of an inversion recovery preparation followed by two FISP segments, two FLASH segments, each with 250 flip-angles, and 4 T1ρ-prepared FLASH segments, each with 125 flip-angles, resulting in a total of 1500 radial spokes for each shot. A slab-selective excitation was used to allow the imaging with less than full coverage of the knee joint. A detailed description of the sequence parameters can be found in Table 1.
Table 1.
Imaging parameters of the 3D-MRF sequence.
| Parameters | MRF |
|---|---|
| Sequence | 3D-T1ρMRF |
| Scan plane | Sagital |
| FOV(mm2) | 140x140 |
| TR(ms) | 7.5 |
| TE(ms) | 3.4 |
| TI(ms) | 15 |
| TSL/T2 preparation (ms) | 0.5,3.8,9.8,21.8 |
| FA(°) | 0–60 |
| Slice Thickness(mm) | 3 |
| Number of slices | 18 |
| Matrix size | 192×192 |
| Receiver bandwidth(Hz/px) | 490 |
| TA(min:s) | 4:30/shot |
Abbreviations: FOV, field of view; TR, repetition time; TE, echo time; TI, inversion time; TSL, spin-lock pulse duration; FA, flip angle; TA, acquisition time.
2.2. MRF dictionary construction
Dictionaries of simulated MR fingerprints based on extended phase graphs (EPG)26 were created with a T1 range of 50–2000 ms, T2 range of 2–200 ms, and T1ρ range of 2–200 ms and flip-angle ranges of 30° to 90° in steps of 15°. For the DM method, cartilage T1, T2, and T1ρ maps were created using an iterative pattern-matching algorithm utilizing maximum correlation. In order to find the balance between computation burden and performance, dictionaries were simulated with different step sizes by varying the scaling factors (SF) in the parameter range. The larger the SF is, the smaller the number of points sampled from the value range of the parameter, leading to a smaller dictionary size and vice versa. The details of the simulated dictionaries are displayed in Figure 1(a).
Figure 1:

(a) Details of the simulated dictionaries with different scaling factors (SF) in the 3 segments of the sampling range of T1, T2, and T1ρ. (b) Details of the architecture of the modified fully connected network (MFCN) used in this study. The 2D complex-valued coefficients of each voxel are concatenated and fed into the MFCN. The network outputs the tissue parameters of T1, T2, and T1ρ.
The measured MR fingerprints, and the simulated dictionary were compressed using SVD to speed up the offline dictionary matching15,27. The number of components is decided by the cumulative percentage of variance (CPV) 28 which is defined as:
| (1) |
Where is the set of singular value components, indexed by and ordered from the largest, i.e. , to the smallest, i.e. . D is the number of components used in the compressed representation (that are also the first and largest components) and M is the total number of components.
2.3. Test dataset simulation
We built a test dataset using parameter ranges that cover the ranges in the knee joint, which are T1 ranging from 400 ms to 1400 ms with a stepsize of 50 ms, T2, and T1ρ ranging from 10 ms to 140 ms with a stepsize of 5 ms, resulting in a total of 309582 entries of fingerprints. We refer to this as “test dataset”. This dataset is used for the optimization of DM and the noise robustness comparison between NN and DM.
2.4. Network training and fine-tuning
In this study, we used a modified fully connected network (MFCN) that was used in a previously reported MRF study15. It consists of 14 fully connected layers with rectifier linear units activation functions, group normalization, and 4 skip connections were used to avoid the vanishing gradient during training29–31. Figure 1(b) shows the details of the MFCN structure. During training, the weights of the network were initialized randomly using the ADAM optimizer with a batch size of 512. The network was trained for 400 epochs. Mean relative absolute error (MRAE) was used as a loss function during the training. We used the simulated dictionary with SF=0.15 described in Section 2.2 as our training dataset. We chose the largest dictionary to reduce the overfitting possibility. During training, 75% of the data were used for training and 25% were used for validation. To optimize the performance of the network for the specified task of estimating T1, T2, and T1ρ from MRF data in the knee joint, we systematically tuned the network for the learning rate, noise level, and SVD compression dimension.
Learning rates (LR) tuning:
The learning rate was initially set to a specified value and decayed by half every 20 epochs with a minimum limit of 0.00005. In our study, we searched initial LR values from 0.0001 to 0.1.
Noise level tuning:
To increase the noise robustness of the trained network, we added noise to the training data. While random perturbations in MRF signals may be difficult to accurately model, we noticed that the use of Gaussian statistics seems good enough. In this sense, we added Gaussian noise, supported by the Central Limit Theorem41 and by some recent studies42 that followed the same direction. The noise level is defined as the standard deviation (SD) of the zero-mean Gaussian distribution. In our study, we searched noise levels ranging from 0.0001 to 0.1.
Training data SVD dimension (D) tuning:
As shown in equation (1), the variance explained by the SVD compression is determined by the number of components used, denominated as D. In our study, we explored CPV ranging from 82% to 99.9999% percent, which changed D from 10 to 100.
Sequential search strategy:
A joint optimization in the entire space is not practical, so we sequentially tuned the three parameters. For this reason, we called the procedure “fine-tuned”, instead of optimized. In our approach, in order to find a good starting point for fine-tuning, we roughly tuned the parameters in a very large range with coarse step sizes. In our sequential fine-tunning approach, we first fine-tunned the parameter of LR, and we fixed D components at 30 as it showed good convergence in the rough tunning step, and we found noise level at 0.003 as it gave good performance on the validation dataset in the rough tunning step. Then D was tuned next, by fixing LR at the previous optimized value of 0.005 and noise level at 0.003. Finally, the noise level was tuned, with LR at the optimized value of 0.005 and the noise level at the optimized value of 0.002. After the network was tuned, the same trained network was used for estimation in the noise robustness analysis, NIST/ISMRM MRI system phantom study, and in-vivo knee joint study.
2.5. Dictionary matching optimization
We optimized the SF and the number of SVD components (D) for the DM method on the test dataset, and on the NIST/ISMRM MRI system phantom data as well. The computation burden for a high-dimensional dictionary is known, therefore, in addition to the accuracy, we also need to consider the computation demand for practical use. To give a clear idea of the fitting time used for each SF, we computed the fitting time for a volume with matrix based on the averaged fitting time for each fingerprint for each SF. After the DM was optimized, the same dictionary size and SVD components were used for estimation in the noise robustness analysis, NIST/ISMRM MRI system phantom study, and in-vivo knee joint study.
2.6. Noise robustness analysis
After the network was tuned, and the DM method was optimized, we analyzed the noise robustness of both methods on the test dataset. Four different levels of noise, which were 0.001, 0.003, 0.007, and 0.01, were added to the test dataset. We have 10 different realizations for each noise level, which results in 40 realizations of each fingerprint. The mean and standard deviation of MRAE were calculated.
2.7. NIST/ISMRM MRI system phantom study
We used a model system phantom developed by the NIST in collaboration with the ISMRM Ad-Hoc Committee on Standards for Quantitative Magnetic Resonance 32–34. The phantom compartments contain solutions with a broad range of T1 and T2 values that have been well characterized by NIST33,34. We scanned this phantom on a 3.0T MRI scanner (MAGNETOM Prisma, Siemens Healthcare, Germany) using a 20-channel receive-only birdcage head coil (Siemens Healthcare), due to its size, with the 3D-MRF sequence, and we scanned this phantom at room temperature by setting the phantom in the scanner room for several hours to allow the temperature to stabilize. It takes about 20 minutes to acquire 36 slices on the phantom. The T1 and T2 reference values in the phantom profiled were used as ground truth. As the dictionaries were simulated with the T1, T2, and T1ρ ranges covering the knee joint, we only analyzed the spheres in the phantom that cover the same ranges.
2.8. In-vivo knee joint study
Fourteen healthy volunteers (35.4±9.3 years, age range 19–62 years; eight males) with no current or prior history of knee pain, trauma, surgery, OA, or inflammatory or crystalline-induced arthritis were recruited. This study was performed in compliance with the Health Insurance Portability and Accountability Act (HIPAA) regulations and with approval from our Institutional Review Board. All subjects provided written informed consent prior to their participation in the study. The scans were acquired on the same 3T MRI scanner used for the phantom study (MAGNETOM Prisma) using a 15-channel Tx/Rx knee coil (Quality Electrodynamics, Mayville, OH, USA) with the 3D-MR. It takes less than 10 minutes to acquire 18 slices with 192×192 matrix size on the knee joint. Five cartilage regions of interest (ROI) were manually drawn, including medial femoral condyle (MFC) and lateral femoral condyle (LFC), medial tibial condyle (MTC) and lateral tibial condyle (LTC), and patellar cartilage (PC). All MRF parameter comparisons were conducted in those ROIs.
3. Results
Figure 2 shows the details of the fine-tuning of the network. From 2(a) and 2(b), we can see that LR plays a critical role in the converged value of the loss. Based on the results, we used 0.005 as the LR for the network. Figures 2(c) and 2(d) show the validation loss for a different number of components in the SVD compression, and the CPV explained by the corresponding D components. From 2(c) and 2(d), we observed the MRAE decreased first and then increased while SVD components got larger, which is due to the information of the signal and noise contained in the components. As the D increases, the effects of excessive compression are reduced and the validation loss is reduced. However, the validation loss started to increase again when D>30. This indicates that D=30 is a good choice for the SVD compression. Also, our choice of D=30 corresponds to CPV=99.5% for the compression.
Figure 2:

Validation loss (MRAE) during training for different learning rates (a), SVD dimensions (c), and noise levels (e) for the neural network using a dictionary with SF=0.15. (b) shows the zoom-in of the red box in (a). (d) displays the converged loss and CPV of the D components in the SVD compression, and the y-axis of the converged validation loss has the same range as in (c). (f) demonstrates the loss (mean±std) when mixed noise levels were added to the testing data for each model trained with a fixed noise level as shown in (e). LR: learning rate; Noise level: standard deviation of the Gaussian distributed noise; D: Dimension in the SVD-compression.
Figure 2(e) shows the validation loss for different noise levels added during training and Figure 2(f) shows the mean and standard deviation of the error on the test dataset with the model trained in Figure 2(e). In Figure 2(e), each model was trained with a fixed noise level. In Figure 2(f), 10 different noise levels were added to the test dataset to test the robustness and generability of the trained model, and for each noise level, 40 realizations were used. Figure 2(e) shows that training noise level=0.001 has the smallest converged error, however, training noise level=0.002 has better performance on the test dataset when subject to different testing noise levels. Therefore, we chose noise level=0.002 for training as it has an overall smaller error for a broader noise range. By choosing the noise level that has the best performance for a wider noise range, the trained network is more robust to different noise levels in estimation. Supporting Information Figure S2 shows the performance for specific noise levels added to the testing data and more details in Figure 2(f). Supporting Information Figure S3 demonstrates a wider range of noise levels (0.0001 to 0.1) with a large step size. From the rough training, it is shown that when the noise level added in the training is too large or too small, the prediction performance of the network will degrade when using testing data. This indicates that the best choice for added training noise with fine-tuning should be in the range between 0.001 and 0.01, which echoes the noise level choice presented in the literature15, as seen in Figure 2.
Table 2 shows the detailed results of the DM optimization on the simulated test dataset with 4 different added noise levels. To show the fitting time clearly, we display the average time for fitting a volume data with 192×192 matrix size and 18 slices. As shown in the table, the fitting time for SF=0.15 and 0.25 is too long to be used in practice, while the MRAE is not reduced on a large scale. For SF=1 and 2, the MRAE is too large which shows a large bias and large standard deviation. For SF=0.5, it takes about 7.5 hours to perform the fitting tasks on a volume of 18 slices using MATLAB with a good performance in T1 and T2 with an acceptable error for T1ρ. CPV=0.95 with 28 SVD components reaches an overall good performance compared to higher CPV. Therefore, based on those results, we should choose SF=0.5 with D=28 as a compromise for fitting time and fitting accuracy for the DM method.
Table 2.
Optimization results on the test dataset for dictionary matching method. The estimation error (MRAE) is too large for SF=1 and 2 while the time for fitting is too long for SF=0.15 and 0.25. SF=0.5 is a good balance between fitting time and accuracy.
| SF | CPV | Time(hour/Vol) (192*192*18) | MRAE (%, mean±std) |
|||
|---|---|---|---|---|---|---|
| T1 | T2 | T1ρ | ||||
|
| ||||||
| 0.15 | 0.82 | 22.85 | 6.79 ± 5.32 | 8.19 ± 10.61 | 46.45 ± 51.67 | |
| 0.90 | 5.91 ± 4.32 | 4.01 ± 3.58 | 32.51 ± 34.37 | |||
| 0.95 | 4.20 ± 3.15 | 3.41 ± 3.01 | 17.96 ± 14.77 | |||
| 0.99 | 4.23 ± 3.63 | 3.50 ± 3.25 | 18.21 ± 15.46 | |||
| 0.9999 | 4.25 ± 3.71 | 3.62 ± 3.19 | 18.27 ± 15.69 | |||
|
| ||||||
| 0.25 | 0.82 | 14.51 | 6.80 ± 5.35 | 8.20 ± 10.68 | 46.10 ± 51.44 | |
| 0.90 | 5.93 ± 4.51 | 4.05 ± 4.40 | 36.80 ± 38.66 | |||
| 0.95 | 4.25 ± 3.45 | 3.56 ± 3.81 | 18.26 ± 15.53 | |||
| 0.99 | 4.29 ± 3.55 | 3.54 ± 3.75 | 18.81 ± 16.04 | |||
| 0.9999 | 4.27 ± 3.43 | 3.71 ± 3.64 | 18.57 ± 16.11 | |||
|
| ||||||
| 0.5 | 0.82 | 7.46 | 7.04 ± 5.68 | 10.14 ± 10.20 | 45.85 ± 49.40 | |
| 0.90 | 5.91 ± 4.69 | 7.40 ± 5.74 | 36.42 ± 36.71 | |||
| 0.95 | 4.12 ± 3.57 | 7.30 ± 5.73 | 19.93 ± 16.71 | |||
| 0.99 | 4.19 ± 3.64 | 7.27 ± 5.74 | 20.22 ± 17.48 | |||
| 0.9999 | 4.19 ± 3.64 | 7.27 ± 5.74 | 20.18 ± 17.46 | |||
|
| ||||||
| 1 | 0.82 | 3.69 | 8.72 ± 7.10 | 12.45 ± 11.32 | 44.11 ± 49.75 | |
| 0.90 | 7.53 ± 5.86 | 10.41 ± 7.62 | 76.35 ± 155.14 | |||
| 0.95 | 5.81 ± 5.24 | 10.28 ± 7.48 | 71.14 ± 148.32 | |||
| 0.99 | 5.85 ± 5.27 | 10.26 ± 7.46 | 69.75 ± 145.69 | |||
| 0.9999 | 5.85 ± 5.27 | 10.26 ± 7.46 | 69.72 ± 145.76 | |||
|
| ||||||
| 2 | 0.82 | 0.35 | 9.51 ± 7.63 | 22.26 ± 24.62 | 40.52 ± 47.21 | |
| 0.90 | 8.24 ± 6.64 | 20.55 ± 21.04 | 42.09 ± 55.36 | |||
| 0.95 | 6.98 ± 5.92 | 20.50 ± 20.93 | 39.32 ± 42.13 | |||
| 0.99 | 7.03 ± 5.95 | 20.48 ± 20.91 | 38.75 ± 39.24 | |||
| 0.9999 | 7.03 ± 5.95 | 20.48 ± 20.91 | 38.73 ± 39.27 | |||
Figure 3 shows the mean of the normalized absolute error (MNAE) for different dictionary sizes on the NIST/ISMRM MRI system phantom for T1 and T2. As shown in the figure, the dictionary size affects T2 to a large degree while having less impact on T1 for the step size used. With SF=0.15 and 0.25, the error decreased around 2–3% in bias. Ideally, the finer dictionary for T2 measurement is preferred, however, this will increase the computation requirement substantially as shown in Figure 1 and Table 2. Therefore, as a compromise of performance and computation burden based on Table 2 and Figure 3, we chose SF=0.5 for building the dictionary for DM in this study.
Figure 3:

Mean of the normalized absolute error (MNAE) of measurements from dictionary matching and neural network for different dictionary sizes on the NIST/ISMRM MRI system phantom with ground truth provided by the phantom profile.
Figure 3 also shows the comparison of NN and DM for different SFs. The NN method always has a superior performance in T2, which shows 5% less bias with a much smaller variance, and comparable performance in T1 compared to DM. This demonstrates that NN has a better performance in T2 while preserving the same performance in T1 measurements on the NIST/ISMRM MRI system phantom. For both methods, T2 has larger variations than T1, this is due to the fact that T2 is shorter than T1, so T2 is intrinsically more challenging to estimate.
Figure 4 displays the noise robustness analysis results on the simulated test dataset. We observed a slightly smaller bias (deviation of the measured diagonal red line from the ideal black line) and variance (vertical red dispersion bars) in T2, a considerably smaller bias and variance in T1ρ especially when T1ρ >50ms, and a slightly smaller bias in T1 for the range covering the knee joint with four different noise levels. We also observed that the bias of T1 increases as the value of T1 increases in DM, while this trend is not obvious in the NN method. Those findings show that the fine-tunned network is more robust to the noise in estimating knee joint parameters, especially for T1ρ and the large value range of T1.
Figure 4:

DM and NN measurements mean±STD for T1, T2, and T1ρ on the simulated test dataset with 4 different noise levels. As shown from the simulated dataset, NN has better performance for all three parameters shown as smaller bias and standard deviation and higher slope in regression, especially for T1ρ, for which the DM shows a large standard deviation when T1ρ >50ms.
Table 3 shows the MRAE of T1, T2, and T1ρ estimation from the fine-tuned NN and the optimized DM on the simulated dataset. With four different noise levels added to the test dataset, NN shows smaller bias and variance than DM for all three parameters, especially for T1ρ and T2 with an overall 11.18% and 4.72% reduction in mean MRAE, and a 7.19% and 2.47% reduction in variance.
Table 3.
Mean relative absolute error (MRAE) of T1, T2, and T1ρ estimation from the fine-tuned NN and the optimized DM on the simulated test dataset with 4 different noise levels added.
| DM | NN | |
|---|---|---|
| T1 (%) | 4.40±3.77 | 2.89±3.29 |
| T2 (%) | 7.35±5.80 | 2.63±3.33 |
| T1ρ (%) | 21.18±18.34 | 10.00±11.15 |
Figure 5 shows the measurements and errors on the NIST/ISMRM MRI system phantom using the DM and NN methods. From the error and absolute error, we observe that NN has a slightly higher mean error and standard variance for T1, especially high error for large values. For T2, NN has the smallest error and shows better performance in estimating small values of T2 while DM shows degraded performance in estimating small T2 values.
Figure 5:

Representative slice of T1 and T2 maps on the NIST/ISMRM MRI system phantom. DM: dictionary matching; GT: ground truth; NN: neural network. As shown in the figure, both methods have a comparable estimation for T1 and slightly better performance of NN for T2.
Figure 6 shows a representative cartilage PD, T1, T2, and T1ρ for different ROI using the fine-tuned NN and DM. As shown in the figure, T1 and T2 have very good correspondence with a slight difference in the ROI for both methods, while NN shows higher T1ρ compared to DM. This aligns with the results from the simulated dataset as shown in Figure 4 that DM and NN have good correspondence for T1 and T2, while discrepancy in T1ρ.
Figure 6:

Representative cartilage T1, T2, and T1ρ maps for a subject using DM, and NN methods. For most regions, DM and NN have good correspondence.
Figure 7 shows the mean and standard deviation of the relaxation values for different ROI of the knee cartilage. In this example, NN shows consistently slightly smaller values in T1 and T2 measurements, while slightly higher values in T1ρ. Overall, NN shows a smaller variance in parameter estimations, which is consistent with the result from the noise robustness analysis. Supporting Information Figure S1 shows the same measurements, however using SF=0.15 for both, DM and NN. As expected, increasing the dictionary size to SF=0.15 does not show much difference when compared to SF=0.5, which aligns with the results in Figure 3.
Figure 7:

Mean and standard deviation of measurements of T1, T2, and T1ρ, for all subjects, using the DM and NN methods. Compared to DM, the NN shows comparable estimation in T1, reduced estimation in T2, and slightly higher estimation in T1ρ.
4. DISCUSSION
This study has investigated the effects of dictionary size, SVD compression components for the DM method, and explored different aspects of training NN in parameter estimation with data acquired with a 3D-MRF sequence. This study shows that T1 is less sensitive to the dictionary size while T1ρ is the most sensitive in the DM method. In the NN approach, the hyperparameters affected the convergence of the network, especially the compression and the noise level, which should be carefully chosen. In the SVD compression, the number of components should be chosen to provide enough signal-rich components while excluding noise components. We also demonstrated that NN is more robust to noise than DM, especially for T1ρ estimation. In the DM method, the bias increased the T1 values. This trend is not obvious in the NNs. Overall, NN has a superior performance than DM in T2 and T1ρ while preserving a comparable performance in T1. We conducted a paired-t test, and no significance was found between the two methods.
In the NN fine-tuning, we ended up using a sequential strategy after a rough tunning in a large range instead of a global search in the parameter space because of the large number of combinations, making global optimization not practical, this may result in a local good solution in the parameter space, hence the denomination fine-tuning. We tested tunning the network with different orders, and the convergence of the parameters is similar, though not equal, to the one we reported. However, each local good solution we tested has superior performance compared to the DM, without the expensive search of local or global minima.
In the NN fitting, we chose to use the largest dictionary (SF=0.15) to reduce the chance of overfitting, though the training time may be longer, it is an offline procedure. Once the network has been trained, the estimation for any input fingerprints will be very fast, which is less than 1 minute for a knee joint volume while it takes more than 18 hours using DM on the same hardware.
In the in vivo data, the discrepancy between the T2 and T1ρ does not align with the results in the synthetic experiment between the two methods. One possibility is that this could be due to the magnetization transfer (MT) effects35–39, which we did not consider in the sequence since we inspected and excluded motion errors or outliers. In a previously reported study, Hilbert et al showed that the MT has effects in quantification of T1 and T2 using MRF35. For in vivo experiments, longer T1 (~1060 ms vs. ~860 ms) and T2 values (~47 ms vs. ~35 ms) have been observed in white matter if MT is accounted for. They concluded that a better match between simulations and acquired MR signals can be obtained using an MT model. The MT effects, in particular, are strong determinants of observed signals in human tissue, Gloor et al. showed that on-resonance MT effects are expected to change the signal from balanced steady-state free-precision (SSFP) sequences in the brain by approximately 30% and muscle by 50%38. Considering the MT effects in signal modeling15,35, such as the classic two-pool model40, or implementing off-resonance preparation pulses in the sequence35, can help to mitigate the MT effects in parameter quantifications. Another possibility could be the mismatch between using a Gaussian distribution to represent the noise ( as in the synthetic data) and the actual noise distribution of in-vivo data.
We acknowledge that this study has few limitations. The NN has to be retrained for different MRF pulse sequences. Our study only investigated the fine-tuning of the fully connected network, while other networks are also used in literature, such as a network using spatial information besides time evolution22. Moreover, the conclusion on the test dataset was made with 5ms for T2 and T1ρ while 50ms for T1 as T1 has a much larger value range. Furthermore, we only investigated the proposed methodology in healthy subjects and further studies are needed to assess its robustness in OA patients. This sequence takes about 10 minutes, which reduces the acquisition time tremendously compared to the traditional methods for T1, T2, and T1ρ measurement separately25,44, but a 10-minute scan may still be long for patients. In this work, we only included in-vivo data on healthy subjects and will test this method on knee OA patients in further work.
The variance for T1ρ measurements was higher than for T1 and T2. We suspect this is related to a lower encoding capacity for T1ρ in the sequence used and not an intrinsic problem of T1ρ, as other sequences show similar variances for T2 and T1ρ43. The T1ρ prepared segments25 are shorter than the other segments, in total representing about one-third of the sequence, and use a maximum flip angle of 20°. Additionally, the variance for T1ρ measurements increases dramatically for values over 50ms, which could mean that the sequence needs longer T1ρ preparations to retain the lower variance. Future work should investigate this hypothesis.
5. CONCLUSION
In this study, we demonstrated that the fine-tuned NN has superior performance in T2 and T1ρ measurements when compared to DM. NN is also more robust to noise in parameter estimation of the knee cartilage using a 3D-MRF sequence. This study shows that fine-tuning the NN training and properly selecting dictionary size for the DM is an essential task in parameter mapping with knee joint MRF data.
Supplementary Material
Acknowledgments:
This study was supported by NIH grants R01-AR076328-01A1, R01-AR076985-01A1, and R01-AR078308-01A1, and was performed under the rubric of the Center of Advanced Imaging Innovation and Research (CAI2R) at NYU Grossman School of Medicine, an NIBIB Biomedical Technology Resource Center (NIH P41 EB017183).
List of Abbreviations and Acronyms:
- MRF
Magnetic resonance fingerprinting
- DM
Dictionary matching
- DL
Deep learning
- OA
Osteoarthritis
- SF
Scaling factor
- SVD
Singular value decomposition
- NN
Neural network
- FA
Flip angle
- SE
Signal evolution
- TR
Repetition time
- EPG
Extended phase graphs
- MFCN
Fully connected network
- CPV
Cumulative percentage of variance
- MRAE
Mean relative absolute error
- LR
Learning rate
- ROI
Regions of interest
- MFC
Medial femoral condyle
- LFC
Lateral femoral condyle
- MTC
Medial tibial condyle
- LTC
Lateral tibial condyle
- PC
Patellar cartilage
- MT
Magnetization transfer
- SSFP
Steady-state free-precisi
Data Availability Statement:
The data that support the findings of this study are not openly available due to privacy or ethical restrictions, but are available from the corresponding author with permission from the Center for Biomedical Imaging at New York University.
References:
- 1.Li X, Benjamin Ma C, Link TM, et al. IN VIVO T1RHO AND T2 MAPPING OF ARTICULAR CARTILAGE IN OSTEOARTHRITIS OF THE KNEE USING 3 TESLA MRI. Osteoarthritis and cartilage / OARS, Osteoarthritis Research Society. 2007;15(7):789. doi: 10.1016/J.JOCA.2007.01.011 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 2.Guermazi A, Alizai H, Crema MD, Trattnig S, Regatte RR, Roemer FW. Compositional MRI techniques for evaluation of cartilage degeneration in osteoarthritis. Osteoarthritis Cartilage. 2015;23(10):1639–1653. doi: 10.1016/J.JOCA.2015.05.026 [DOI] [PubMed] [Google Scholar]
- 3.MacKay JW, Low SBL, Smith TO, Toms AP, McCaskie AW, Gilbert FJ. Systematic review and meta-analysis of the reliability and discriminative validity of cartilage compositional MRI in knee osteoarthritis. Osteoarthritis Cartilage. 2018;26(9):1140–1152. doi: 10.1016/J.JOCA.2017.11.018 [DOI] [PubMed] [Google Scholar]
- 4.Atkinson HF, Birmingham TB, Moyer RF, et al. MRI T2 and T1ρ relaxation in patients at risk for knee osteoarthritis: a systematic review and meta-analysis. BMC Musculoskelet Disord. 2019;20(1). doi: 10.1186/S12891-019-2547-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 5.Li X, Kuo D, Theologis A, et al. Cartilage in Anterior Cruciate Ligament–Reconstructed Knees: MR Imaging T1ρ and T2—Initial Experience with 1-year Follow-up. Radiology. 2011;258(2):505. doi: 10.1148/RADIOL.10101006 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 6.Ma D, Gulani V, Seiberlich N, et al. Magnetic resonance fingerprinting. 2013. doi: 10.1038/nature11971 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 7.Barbieri M, Lee PK, Brizi L, et al. Circumventing the curse of dimensionality in magnetic resonance fingerprinting through a deep learning approach. NMR Biomed. 2022;35(4). doi: 10.1002/nbm.4670 [DOI] [PubMed] [Google Scholar]
- 8.Hamilton JI, Seiberlich N. Machine Learning for Rapid Magnetic Resonance Fingerprinting Tissue Property Quantification. Proc IEEE Inst Electr Electron Eng. 2020;108(1):69–85. doi: 10.1109/JPROC.2019.2936998 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 9.Song P, Eldar YC, Mazor G, Rodrigues MRD. HYDRA: Hybrid deep magnetic resonance fingerprinting. Med Phys. 2019;46(11):4951–4969. doi: 10.1002/MP.13727 [DOI] [PubMed] [Google Scholar]
- 10.Wang Z, Li H, Zhang Q, Yuan J, Wang X. Magnetic Resonance Fingerprinting with compressed sensing and distance metric learning. Neurocomputing. 2016;174:560–570. doi: 10.1016/J.NEUCOM.2015.09.077 [DOI] [Google Scholar]
- 11.Mazor G, Weizman L, Tal A, Eldar YC. Low-rank magnetic resonance fingerprinting. Med Phys. 2018;45(9):4066–4084. doi: 10.1002/MP.13078 [DOI] [PubMed] [Google Scholar]
- 12.Davies M, Puy G, Vandergheynst P, Wiaux Y. A Compressed Sensing Framework for Magnetic Resonance Fingerprinting. https://doi.org/101137/130947246. 2014;7(4):2623–2656. doi: 10.1137/130947246 [DOI] [Google Scholar]
- 13.Yang M, Ma D, Jiang Y, et al. Low rank approximation methods for MR fingerprinting with large scale dictionaries. Magn Reson Med. 2018;79(4):2392–2400. doi: 10.1002/MRM.26867 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 14.Cauley SF, Setsompop K, Ma D, et al. Fast group matching for MR fingerprinting reconstruction. Magn Reson Med. 2015;74(2):523–528. doi: 10.1002/MRM.25439 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 15.Zhang X, Duchemin Q, Liu* K, et al. Cramér–Rao bound-informed training of neural networks for quantitative MRI. Magn Reson Med. 2022;88(1):436–448. doi: 10.1002/MRM.29206 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 16.Nataraj G, Nielsen JF, Scott C, Fessler JA. Dictionary-Free MRI PERK: Parameter Estimation via Regression with Kernels. IEEE Trans Med Imaging. 2018;37(9):2103. doi: 10.1109/TMI.2018.2817547 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 17.Boux F, Forbes F, Arbel J, Barbier EL. Dictionary-Free MR Fingerprinting Parameter Estimation Via Inverse Regression. June 2018:1–2. https://hal.science/hal-01941630. Accessed December 13, 2023. [Google Scholar]
- 18.Golbabaee M, Chen D, Gomez PA, Menzel MI, Davies ME. Geometry of Deep Learning for Magnetic Resonance Fingerprinting. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2019;2019-May:7825–7829. doi: 10.1109/ICASSP.2019.8683549 [DOI] [Google Scholar]
- 19.Cohen O, Zhu B, Rosen MS. MR fingerprinting Deep RecOnstruction NEtwork (DRONE). Magn Reson Med. 2018;80(3):885–894. doi: 10.1002/MRM.27198 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 20.Barbieri M, Brizi L, Giampieri E, et al. A deep learning approach for magnetic resonance fingerprinting: Scaling capabilities and good training practices investigated by simulations. Physica Medica. 2021;89:80–92. doi: 10.1016/J.EJMP.2021.07.013 [DOI] [PubMed] [Google Scholar]
- 21.Hoppe E, Körzdörfer G, Würfl T, et al. Deep learning for magnetic resonance fingerprinting: A new approach for predicting quantitative parameter values from time series. Stud Health Technol Inform. 2017;243:202–206. doi: 10.3233/978-1-61499-808-2-202 [DOI] [PubMed] [Google Scholar]
- 22.Fang Z, Chen Y, Hung SC, Zhang X, Lin W, Shen D. Submillimeter MR fingerprinting using deep learning–based tissue quantification. Magn Reson Med. 2020;84(2):579–591. doi: 10.1002/MRM.28136 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 23.Virtue P, Yu SX, Lustig M. BETTER THAN REAL: COMPLEX-VALUED NEURAL NETS FOR MRI FINGERPRINTING.
- 24.Zhang X, de Moura HL, Monga A, Zibetti MVW, Kijowski R, Regatte RR. Repeatability of Quantitative Knee Cartilage T1, T2, and T1ρ Mapping With 3D-MRI Fingerprinting. Journal of Magnetic Resonance Imaging. 2023. doi: 10.1002/JMRI.29068 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 25.Sharafi A, Zibetti MVW, Chang G, Cloos M, Regatte RR. 3D magnetic resonance fingerprinting for rapid simultaneous T1, T2, and T1ρ volumetric mapping of human articular cartilage at 3 T. NMR Biomed. 2022;35(12):1–13. doi: 10.1002/nbm.4800 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 26.Weigel M Extended phase graphs: dephasing, RF pulses, and echoes - pure and simple. J Magn Reson Imaging. 2015;41(2):266–295. doi: 10.1002/JMRI.24619 [DOI] [PubMed] [Google Scholar]
- 27.McGivney DF, Pierre E, Ma D, et al. SVD compression for magnetic resonance fingerprinting in the time domain. IEEE Trans Med Imaging. 2014;33(12):2311–2322. doi: 10.1109/TMI.2014.2337321 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 28.Li JM, Wei HJ, Wei LD, Zhou DP, Qiu Y. Extraction of frictional vibration features with multifractal detrended fluctuation analysis and friction state recognition. Symmetry (Basel). 2020;12(2). doi: 10.3390/SYM12020272 [DOI] [Google Scholar]
- 29.Fred Agarap AM. Deep Learning using Rectified Linear Units (ReLU). March 2018. https://arxiv.org/abs/1803.08375v2. Accessed January 21, 2024.
- 30.Wu Y, He K. Group Normalization. 2018:3–19.
- 31.He K, Zhang X, Ren S, Sun J. Deep residual learning for image recognition. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 2016;2016-December:770–778. doi: 10.1109/CVPR.2016.90 [DOI] [Google Scholar]
- 32.Quantitative MRI | NIST. https://www.nist.gov/programs-projects/quantitative-mri. Accessed January 25, 2024. [Google Scholar]
- 33.Keenan KE, Gimbutas Z, Dienstfrey A, et al. Multi-site, multi-platform comparison of MRI T1 measurement using the system phantom. PLoS One. 2021;16(6):e0252966. doi: 10.1371/JOURNAL.PONE.0252966 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 34.Stupic KF, Ainslie M, Boss MA, et al. A standard system phantom for magnetic resonance imaging. Magn Reson Med. 2021;86(3):1194–1211. doi: 10.1002/MRM.28779. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 35.Hilbert T, Xia D, Block KT, Yu Z, Lattanzi R, & Sodickson DK, et al. (2019). Magnetization Transfer in Magnetic Resonance Fingerprinting. [DOI] [PMC free article] [PubMed]
- 36.Malik SJ, Teixeira RPAG, & Hajnal JV. (2018). Extended phase graph formalism for systems with magnetization transfer and exchange. Magnetic resonance in medicine, 80(2), 767–779. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 37.Bieri O, & Scheffler K. (2010). On the origin of apparent low tissue signals in balanced ssfp. Magnetic Resonance in Medicine, 56(5), 1067–1074. [DOI] [PubMed] [Google Scholar]
- 38.Gloor M, Scheffler K, & Bieri O. (2010). Quantitative magnetization transfer imaging using balanced ssfp. Magnetic Resonance in Medicine, 60(3), 691–700. [DOI] [PubMed] [Google Scholar]
- 39.Kaplan Sydney, et al. “Impact of magnetization transfer effects on T1 and T2 measurements using cardiac magnetic resonance fingerprinting.” Journal of Cardiovascular Magnetic Resonance 27 (2025). [Google Scholar]
- 40.Henkelman RM, Huang X, Xiang QS, Stanisz G, Swanson SD, Bronskill MJ. Quantitative interpretation of magnetization transfer. Magn Reson Med. 1993;29:759–766. [DOI] [PubMed] [Google Scholar]
- 41.Papoulis Athanasios. Random variables and stochastic processes. McGraw Hill, 1965.Papoulis, Athanasios. Random variables and stochastic processes. McGraw Hill, 1965. [Google Scholar]
- 42.George Daniel and Huerta Eliu Antonio.Deep learning for real-time gravitational wave detection and parameter estimation: Resultswith advanced ligo data. Physics LettersB, 778:64–70, 2018. [Google Scholar]
- 43.Lyu Zhenfeng, et al. “Free-breathing simultaneous native myocardial T1, T2 and T1ρ mapping with Cartesian acquisition and dictionary matching.” Journal of Cardiovascular Magnetic Resonance 25.1 (2023): 63. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 44.Li Xiaojuan, et al. “Simultaneous acquisition of T1ρ and T2 quantification in cartilage—reproducibility and diurnal variation.” Proc Intl Soc Magn Resonance Med 19 (2011) [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
Data Availability Statement
The data that support the findings of this study are not openly available due to privacy or ethical restrictions, but are available from the corresponding author with permission from the Center for Biomedical Imaging at New York University.
