MétaCan
Menu
← Back to cohort
Record W3110316522 · doi:10.1101/2020.11.28.400846

Streamlined Magnetic Resonance Fingerprinting: Fast Whole-brain Coverage with Deep-learning Based Parameter Estimation

2020· preprint· en· W3110316522 on OpenAlexaff
Mahdi Khajehim, Thomas Christen, Fred Tam, Simon J. Graham

Bibliographic record

VenuebioRxiv (Cold Spring Harbor Laboratory) · 2020
Typepreprint
Languageen
FieldMedicine
TopicAdvanced MRI Techniques and Applications
Canadian institutionsSunnybrook Health Science CentreUniversity of Toronto
Fundersnot available
KeywordsComputer scienceArtificial intelligenceDeep learningImaging phantomPattern recognition (psychology)Matching (statistics)Process (computing)Magnetic resonance imagingArtificial neural networkConvolutional neural networkEcho-planar imagingGround truthComputer visionPhysicsMathematics

Abstract

fetched live from OpenAlex

Abstract Magnetic resonance fingerprinting (MRF) is a novel quantitative MRI (qMRI) framework that provides simultaneous estimates of multiple relaxation parameters as well as metrics of field inhomogeneity in a single acquisition. However, current bottlenecks exist in the forms of (1) scan time; (2) need for custom image reconstruction; (3) large dictionary sizes; (4) long dictionary-matching time. The aim of this study is to introduce a novel streamlined magnetic-resonance fingerprinting (sMRF) framework that is based on a single-shot echo-planar imaging (EPI) sequence to simultaneously estimate tissue T1, T2, and T2* with integrated B1 + correction. Encouraged by recent work on EPI-based MRF, we developed a method that combines spin-echo EPI with gradient-echo EPI to achieve T2 in addition to T1 and T2* quantification. To this design, we add simultaneous multi-slice (SMS) acceleration to enable full-brain coverage in a few minutes. Moreover, in the parameter-estimation step, we use deep learning to train a deep neural network (DNN) to accelerate the estimation process by orders of magnitude. Notably, due to the high image quality of the EPI scans, the training process can rely simply on Bloch-simulated data. The DNN also removes the need for storing large dictionaries. Phantom scans along with in-vivo multi-slice scans from seven healthy volunteers were acquired with resolutions of 1.1×1.1×3 mm 3 and 1.7×1.7×3 mm 3 , and the results were validated against ground truth measurements. Excellent correspondence was found between our T1, T2, and T2* estimates and results obtained from standard approaches. In the phantom scan, a strong linear relationship (R=1-1.04, R 2 >0.96) was found for all parameter estimates, with a particularly high agreement for T2 estimation (R 2 >0.99). Similar findings are reported for the in-vivo human data for all of our parameter estimates. Incorporation of DNN results in a reduction of parameter estimation time on the order of 1000 x and a reduction in storage requirements on the order of 2500 x while achieving highly similar results as conventional dictionary matching (%differences of 7.4±0.4%, 3.6±0.3% and 6.0±0.4% error in T1, T2, and T2* estimation). Thus, sMRF has the potential to be the method of choice for future MRF studies by providing ease of implementation, fast whole-brain coverage, and ultra-fast T1/T2/T2* estimation.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.012
GPT teacher head0.243
Teacher spread0.231 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations5
Published2020
Admission routes1
Has abstractyes

Explore more

Same venuebioRxiv (Cold Spring Harbor Laboratory)→Same topicAdvanced MRI Techniques and Applications→French-language works237,207→