Fast machine learning image reconstruction of radially undersampled k-space data for low-latency real-time MRI
Bibliographic record
Abstract
Fast data acquisition and fast image reconstruction are essential to enable low-latency real-time magnetic resonance (MR) imaging applications with high temporal resolution such as interstitial percutaneous needle interventions or MR-guided radiotherapy. To accelerate the image reconstruction of radially undersampled 2D k-space data, we propose a machine learning (ML) model that consists of a single fully connected linear layer to interpolate radial k-space data to a Cartesian grid, followed by a conventional 2D inverse fast Fourier transform. This k-space-to-image ML model was trained on synthetic data from natural images. It was evaluated with respect to image quality (mean squared error (MSE) compared to ground truth where available) and reconstruction time both on synthetic data with undersampling factors R between 2 and 10 as well as on radial k-space data from MR measurements on two different MRI systems. For comparison, conventional non-iterative zero-filling non-uniform fast Fourier transform (NUFFT) reconstruction and compressed sensing (CS) reconstruction were used. On synthetic data, the ML model achieved better median MSE values than the non-iterative NUFFT reconstruction. The interquartile ranges of the MSE distributions overlapped for the ML and CS reconstructions for all R. Reconstruction times of the ML approach were shorter than for NUFFT and substantially shorter than for CS reconstructions. The generalizability (for real MRI data) of the ML model was demonstrated by reconstructing 0.35-tesla MR-Linac dynamic measurements of three volunteers and phantom data from a diagnostic 1.5-tesla MRI system; the median reconstruction time for the coil-combined images was much shorter than for the conventional approach (ML: [Formula: see text]; NUFFT: [Formula: see text]). The proposed ML model reconstructs MR data with reduced streaking artifacts compared to non-iterative NUFFT techniques and with extremely short reconstruction times; thus, it is ideally suited for rapid low-latency real-time MR applications.
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.004 |
| 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.000 |
| 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.001 | 0.001 |
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".