Papers › Circumventing the Curse of Dimensionality in Magnetic Resonance Fingerprinting through...
Circumventing the Curse of Dimensionality in Magnetic Resonance Fingerprinting through a Deep Learning Approach
Marco Barbieri, Leonardo Brizi, Enrico Giampieri, Francesco Solera, Gastone Castellani, Claudia Testa, Daniel Remondini
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
MR fingerprinting (MRF) is a rapid growing approach for fast quantitave MRI. A typical drawback of dictionary-based MRF is its explosion in size as a function of the number of reconstructed parameters, according to the curse of dimensionality. Deep Neural Networks (NNs) have been proposed as a feasible alternative, but these approaches are still in their infancy. We tested different NN pipelines on simulated data: we studied optimal training procedures by including different strategies of noise addition and parameter space sampling, to achieve better accuracy and robustness to noise. Four MRF sequences were considered, two of them designed to be more specific for B₁^+ parameter encoding: IR-FISP, IR-FISP-B₁, bSSFP and IR-bSSFP-B₁. A comparison between NN and the dictionary approaches was performed using a numerical brain phantom. Results demonstrated that training with random sampling and different levels of noise variance yielded the best performance. NN performance was greater or equal than dictionary-based approach in reconstructing MR parameter maps: the difference in performance increased with the number of estimated parameters, because the dictionary method suffers from the coarse resolution of the MR parameter space sampling. The NN approach resulted more efficient in terms of memory and computational burden, and thus has great potential in large-scale MRF problems.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections