Automated generation of cerebral blood flow and arterial transit time maps from multiple delay arterial spin‐labeled <scp>MRI</scp>
Bibliographic record
Abstract
PURPOSE: Develop and evaluate a deep learning approach to estimate cerebral blood flow (CBF) and arterial transit time (ATT) from multiple post-labeling delay (PLD) ASL MRI. METHODS: ASL MRI were acquired with 6 PLDs on a 1.5T or 3T GE system in adults with and without cognitive impairment (N = 99). Voxel-level CBF and ATT maps were quantified by training models with distinct convolutional neural network architectures: (1) convolutional neural network (CNN) and (2) U-Net. Models were trained and compared via 5-fold cross validation. Performance was evaluated using mean absolute error (MAE). Model outputs were trained on and compared against a reference ASL model fitting after data cleaning. Minimally processed ASL data served as another benchmark. Model output uncertainty was estimated using Monte Carlo dropout. The better-performing neural network was subsequently re-trained on inputs with missing PLDs to investigate generalizability to different PLD schedules. RESULTS: Relative to the CNN, the U-Net yielded lower MAE on training data. On test data, the U-Net MAE was 8.4 ± 1.4 mL/100 g/min for CBF and 0.22 ± 0.09 s for ATT. A significant association was observed between MAE and Monte Carlo dropout-based uncertainty estimates. Neural network performance remained stable despite systematically reducing the number of input images (i.e., up to 3 missing PLD images). Mean processing time was 10.77 s for the U-Net neural network compared to 10 min 41 s for the reference pipeline. CONCLUSION: It is feasible to generate CBF and ATT maps from 1.5T and 3T multi-PLD ASL MRI with a fast deep learning image-generation approach.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".