Predictive signal modeling and multi‐rate filtering in accelerated cardiac <scp>MRI</scp>
Bibliographic record
Abstract
PURPOSE: True real-time cardiac MRI (CMR), necessary for capturing live cardiac dynamics and imaging irregular cardiac rhythms, remains challenging. In this article, we move toward real-time CMR in multiple reconstruction frameworks via strategies to predict cardiac motion, improve computational efficiency, reduce artifacts, and preserve spatial resolution. THEORY AND METHODS: A published predictive signal model (PMOT) for imaging irregular cardiac dynamics was modified (mPMOT) to enable efficient computation of state-transition matrices for predicting cardiac motion, as training PMOT is computationally expensive. A multi-rate Kalman filter framework was developed to enable computationally efficient reconstructions of high-resolution, large-matrix CMR datasets. Reconstructions were evaluated on multi-coil CMR data in human and swine using multi-rate Kalman filtering and compressed sensing (CS). RESULTS: Training mPMOT is two orders of magnitude faster than PMOT. Across all datasets and frameworks, mPMOT facilitated high-quality reconstructions of CMR images for different undersampling patterns at acceleration factors of 9 and 13.5. Furthermore, mPMOT substantially reduced temporal blurring artifacts naturally present in CS reconstructions. In swine, mPMOT reduced the mean-squared error of the multi-rate Kalman filter by two orders of magnitude. The multi-rate Kalman filter implementation maintained spatial resolution while reducing computation time from 5439 s to 56 s in select applications. CONCLUSION: Our mPMOT is computationally efficient and can be integrated within multiple established reconstruction frameworks to ensure robust tracking and reconstruction for dynamic and real-time CMR 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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".