Deep Learning Initialized Compressed Sensing (Deli-CS) in Volumetric Spatio-Temporal Subspace Reconstruction
Bibliographic record
Abstract
Introduction: Spatio-temporal MRI methods enable whole-brain multi-parametric mapping at ultra-fast acquisition times through efficient k-space encoding, but can have very long reconstruction times, which limit their integration into clinical practice. Deep learning (DL) is a promising approach to accelerate reconstruction, but can be computationally intensive to train and deploy due to the large dimensionality of spatio-temporal MRI. DL methods also need large training data sets and can produce results that don't match the acquired data if data consistency is not enforced. The aim of this project is to reduce reconstruction time using DL whilst simultaneously limiting the risk of deep learning induced hallucinations, all with modest hardware requirements. Methods: Deep Learning Initialized Compressed Sensing (Deli-CS) is proposed to reduce the reconstruction time of iterative reconstructions by "kick-starting" the iterative reconstruction with a DL generated starting point. The proposed framework is applied to volumetric multi-axis spiral projection MRF that achieves whole-brain T1 and T2 mapping at 1-mm isotropic resolution for a 2-minute acquisition. First, the traditional reconstruction is optimized from over two hours to less than 40 minutes while using more than 90% less RAM and only 4.7 GB GPU memory, by using a memory-efficient GPU implementation. The Deli-CS framework is then implemented and evaluated against the above reconstruction. Results: Deli-CS achieves comparable reconstruction quality with 50% fewer iterations bringing the full reconstruction time to 20 minutes. Conclusion: Deli-CS reduces the reconstruction time of subspace reconstruction of volumetric spatio-temporal acquisitions by providing a warm start to the iterative reconstruction algorithm.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".