ArticleQuantitative imaging in medicine and surgery2025
SuperMRF: deep robust reconstruction for highly accelerated magnetic resonance fingerprinting.
Article in Quantitative imaging in medicine and surgery, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
9 authors.
Funding
Abstract
Background: Magnetic resonance fingerprinting (MRF) is a rapid imaging technique for simultaneous mapping of multiple tissue properties such as T1 and T2 relaxation times. However, conventional pattern matching reconstruction and iterative low rank reconstruction methods may not take full advantage of the spatiotemporal content of MRF data and can require significant computational resources with long reconstruction times. Deep learning reconstruction using a three-dimensional (3D) convolutional neural network (CNN)-based method may enable high-quality, rapid MRF reconstruction. Evaluation of such proposed deep learning reconstruction methods for MRF is needed to clarify whether deep learning techniques adapted from other MR image reconstruction problems will yield benefits when employed in MRF applications. The objective of this study is to design and evaluate a novel deep learning framework (SuperMRF) that directly transforms undersampled parameter-weighted 3D Cartesian MRF data into quantitative T1 and T2 maps, bypassing traditional pattern-matching in MRF. Methods: In contrast to conventional MRF where only the temporal evolution of each voxel is used for quantification, SuperMRF exploits both two-dimensional spatial and one-dimensional temporal information with a 3D CNN for reconstruction. Controlled simulation experiments were performed using reference parameter maps from Results: SuperMRF estimated accurate T1 and T2 mapping in a highly accelerated scan (15× undersampling in k-space with a 20-fold reduction in the number of acquired MRF frames) with low error (NMSE of 5%) and high resemblance (SSIM of 94%) to reference quantitative maps. SuperMRF was observed to be superior to the conventional and low rank MRF reconstruction methods in terms of NMSE, SSIM, and robustness to noise. In prospective real-world data, SuperMRF provided comparable T1 and T2 maps as compared to low rank MRF. The only significantly different cartilage and muscle values in prospective data across the three reconstruction methods were those from conventional MRF T2. Conclusions: Our results demonstrate that the proposed SuperMRF can achieve rapid, robust reconstruction with reduced frames in addition to k-space undersampling, outperforming the conventional and state-of-the-art reconstruction methods in simulation and providing comparable results to low rank reconstruction in prospective real-world subjects.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.