Sci‐Fri PM Imaging‐01: Comparison of POCS and cTERA Image Reconstruction Algorithms Applied to 3D Sparsely Sampled k‐Space Data
Bibliographic record
Abstract
Real‐time 3D magnetic resonance (MR) imaging sometimes focus on rapid data acquisition by full sampling the central zone of phase‐encoding plane while sparse sampling its periphery, which results in the formation of sparsely sampled MR raw data. This research compares the performance of image reconstruction from sparsely sampled MR data by the often‐used zero filling (ZF) algorithm, and by two new methods, i.e., projection‐onto‐convex sets (POCS) and constrained transient error reconstruction approach (cTERA) algorithms. It is found that both the POCS and cTERA algorithms reconstruct high‐quality images that greatly improve the depiction of high‐frequency‐containing structures compared to ZF. However, POCS and cTERA take significantly increased computational times. Due to their intrinsic complexities compared to conventional Fourier transform and ZF reconstruction, POCS and cTERA algorithms are currently not implemented on commercial clinical MR scanners. It is also demonstrated that for a given scan time, it is possible to find an optimal specific sparse sampling strategies by both POCS and cTERA. Under pseudo optimal conditions, the corresponding POCS and cTERA images demonstrated better high‐resolution image quality compared to other, less optimal, sampling strategies. Therefore, it is desirable to acquire some high‐frequency data, as opposed to spending time only collecting an enlarged central region.
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.003 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 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.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".