Using High-Pass Filter to Enhance Scan Specific Learning for MRI Reconstruction without Any Extra Training Data
Bibliographic record
Abstract
• Accelerated MRI reconstruction was improved by using an HP-RAKI algorithm. • A high-pass (HP) filter reduced image support to facilitate linear prediction. • Normal contrast was restored by using an inverse HP filtering. • HP-RAKI method was extended to corresponding residual structure. • High quality reconstruction was achieved without any extra training data. In accelerated MRI, the robust artificial-neural-network for k-space interpolation (RAKI) method is an attractive learning-based reconstruction that does not require additional training data. This study was focused on obtaining high quality MR images from regular under-sampled multi-coil k-space data using a high-pass filtered RAKI (HP-RAKI) reconstruction without any extra training data. MRI scan from human subjects was under-sampled with a regular pattern using skipped phase encoding and a fully sampled k-space center. A high-pass (HP) filter was applied in k-space to reduce image support to facilitate linear prediction. The HP filtered k-space center was used to train the RAKI network without any extra training data. The unacquired k-space data can be predicted from a trained RAKI network with optimized parameters. Final reconstruction was obtained after performing an inverse HP filtering for the predicted k-space data. This HP-RAKI method can be extended to corresponding residual structure (HP-rRAKI). HP-RAKI was compared with GRAPPA, HP-GRAPPA, RAKI and MW-RAKI algorithms, and HP-rRAKI was compared with corresponding residual extensions, including rRAKI and MW-rRAKI, all qualitatively and quantitatively using visual inspection and such metrics as SSIM and PSNR. HP-RAKI and HP-rRAKI were found to be effective in reconstructing MR images even at high acceleration factors. HP-RAKI and HP-rRAKI compared favorably with other algorithms. Using high-pass filtered central k-space data for training, HP-RAKI offers higher reconstruction quality for regularly under-sampled multi-coil k-space data without any extra training data. It has shown promising capabilities for fast MRI applications, especially those lacking fully sampled training data.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".