A Review on Accelerated Magnetic Resonance Imaging Techniques: Parallel Imaging, Compressed Sensing, and Machine Learning
Bibliographic record
Abstract
A concise overview of three major advancements in fast magnetic resonance imagine (MRI) reconstruction techniques is presented, focusing on their roles in enhancing image quality and reducing acquisition times. The first set of methods, parallel imaging techniques, includes sensitivity encoding (SENSE) and generalized autocalibrating partially parallel acquisitions (GRAPPA). SENSE utilizes spatial sensitivity information from multiple receiver coils to accelerate image acquisition by undersampling k-space data and reconstructing images using coil sensitivity profiles, allowing for faster scans. GRAPPA, another parallel imaging method, uses estimated weights from a calibration scan to fill in missing data in undersampled k-space and then reconstructs unaliased images. Additionally, this review explores sparse reconstruction techniques such as compressed sensing, which leverages the sparsity of images in a transformed domain to reconstruct high quality images from significantly fewer measurements, thus reducing scan times. The latest developments in machine learning applications for MRI acquisition are also discussed, highlighting how advanced algorithms are being used to improve image reconstruction, enhance diagnostic accuracy, and simplify workflow processes.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.004 |
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".