ABSR: Progressive Alternate Refinement for Blind Cardiac MRI Super-Resolution
Bibliographic record
Abstract
Deep learning-based methods for super-resolution (SR) reconstruction of cardiac magnetic resonance imaging (CMRI) have achieved commendable reconstruction performance owing to the potent learning capability of neural networks. Nonetheless, these methods suffer from performance degradation when handling real-world CMRI images, failing to reconstruct high-fidelity CMRI high-resolution images. This degradation stems from the fact that real-world CMRI images are afflicted with blur and noise, whereas mainstream deep learning-based CMRI SR algorithms are typically trained on images degraded using bicubic methods. To address this problem, we propose a progressive alternate refinement for blind CMRI SR, which implements blind SR reconstruction through progressive alternate refinement optimization of the CMRI image feature extraction process and blur kernel feature extraction process. Moreover, we propose a novel progressive blind SR reconstruction subnetwork, which utilizes the alternate residual attention block (ARAB) to perform deep feature extraction. Meanwhile, we propose an ARAB, which uses channel and pixel attention mechanisms to extract high-frequency features from the extracted CMRI and blur kernel features. Extensive experimental results demonstrate that our proposed alternate refinement for blind CMRI super-resolution outperforms the state-of-the-art SR methods, exhibiting superior reconstruction performance and the ability to reconstruct high-fidelity CMRI images.
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.001 | 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.002 | 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".