A Patch-Wise Deep Learning Approach for Myocardial Blood Flow Quantification with Robustness to Noise and Nonrigid Motion
Bibliographic record
Abstract
Quantitative analysis of dynamic contrast-enhanced cardiovascular MRI (cMRI) datasets enables the assessment of myocardial blood flow (MBF) for objective evaluation of ischemic heart disease in patients with suspected coronary artery disease. State-of-the-art MBF quantification techniques use constrained deconvolution and are highly sensitive to noise and motion-induced errors, which can lead to unreliable outcomes in the setting of high-resolution MBF mapping. To overcome these limitations, recent iterative approaches incorporate spatial-smoothness constraints to tackle pixel-wise MBF mapping. However, such iterative methods require a computational time of up to 30 minutes per acquired myocardial slice, which is a major practical limitation. Furthermore, they cannot enforce robustness to residual nonrigid motion which can occur in clinical stress/rest studies of patients with arrhythmia. We present a non-iterative patch-wise deep learning approach for pixel-wise MBF quantification wherein local spatio-temporal features are learned from a large dataset of myocardial patches acquired in clinical stress/rest cMRI studies. Our approach is scanner-independent, computationally efficient, robust to noise, and has the unique feature of robustness to motion-induced errors. Numerical and experimental results obtained using real patient data demonstrate the effectiveness of our approach.Clinical Relevance- The proposed patch-wise deep learning approach significantly improves the reliability of high-resolution myocardial blood flow quantification in cMRI by improving its robustness to noise and nonrigid myocardial motion and is up to 300-fold faster than state-of-the-art iterative approaches.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".