Time‐domain principal component reconstruction (tPCR): A more efficient and stable iterative reconstruction framework for non‐Cartesian functional MRI
Bibliographic record
Abstract
PURPOSE: To improve the reconstruction efficiency (i.e., computational load) and stability of iterative reconstruction for non-Cartesian fMRI when using high undersampling rates and/or in the presence of strong off-resonance effects. THEORY AND METHODS: The magnetic resonance encephalography (MREG) sequence with 3D non-Cartesian trajectory and 0.1s repetition time (TR) was applied to acquire fMRI datasets. Different from a conventional time-point-by-time-point sequential reconstruction (SR), the proposed time-domain principal component reconstruction (tPCR) performs three steps: (1) decomposing the k-t-space fMRI datasets into time-domain principal component space using singular value decomposition, (2) reconstructing each principal component with redistributed computation power according to their weights, and (3) combining the reconstructed principal components back to image-t-space. The comparison of reconstruction accuracy was performed by simulation experiments and then verified in real fMRI data. RESULTS: The simulation experiments showed that the proposed tPCR was able to significantly reduce reconstruction errors, and subsequent functional activation errors, relative to SR at identical computational cost. Alternatively, at fixed reconstruction accuracy, computation time was greatly reduced. The improved performance was particularly obvious for L1-norm nonlinear reconstructions relative to L2-norm linear reconstructions and robust to different regularization strength, undersampling rates, and off-resonance effects intensity. By examining activation maps, tPCR was also found to give similar improvements in real fMRI experiments. CONCLUSION: The proposed proof-of-concept tPCR framework could improve (1) the reconstruction efficiency of iterative reconstruction, and (2) the reconstruction stability especially for nonlinear reconstructions. As a practical consideration, the improved reconstruction speed promotes the application of highly undersampled non-Cartesian fast fMRI.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 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.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".