|
3 | 3 |
|
4 | 4 | @string{aps = {American Physical Society,}} |
5 | 5 |
|
| 6 | +@inproceedings{Lyu:2025b, |
| 7 | + abbr = {}, |
| 8 | + bibtex_show = {true}, |
| 9 | + author = {Lyu, Donghang and Staring, Marius and Lamb, Hildo and Doneva, Mariya}, |
| 10 | + title = {CRUNet-MR-Univ: A Foundation Model for Diverse Cardiac MRI Reconstruction}, |
| 11 | + booktitle = {CMRxRecon2025 challenge at STACOM, MICCAI}, |
| 12 | + address = {Daejeon, South Korea}, |
| 13 | + series = {Lecture Notes in Computer Science}, |
| 14 | + volume = {}, |
| 15 | + pages = {}, |
| 16 | + month = {September}, |
| 17 | + year = {2025}, |
| 18 | + pdf = {2025_c_STACOMb.pdf}, |
| 19 | + html = {}, |
| 20 | + arxiv = {}, |
| 21 | + code = {}, |
| 22 | + abstract = {In recent years, deep learning has attracted increasing attention in the field of Cardiac MRI (CMR) reconstruction due to its superior performance over traditional methods, particularly in handling higher acceleration factors, highlighting its potential for real-world clinical applications. However, current deep learning methods remain limited in generalizability. CMR scans exhibit wide variability in image contrast, sampling patterns, scanner vendors, anatomical structures, and disease types. Most existing models are designed to handle only a single or narrow subset of these variations, leading to performance degradation when faced with distribution shifts. Therefore, it is beneficial to develop a unified model capable of generalizing across diverse CMR scenarios. To this end, we propose CRUNet-MR-Univ, a foundation model that leverages spatio-temporal correlations and prompt-based priors to effectively handle the full diversity of CMR scans. Our approach consistently outperforms baseline methods across a wide range of settings, highlighting its effectiveness and promise.}, |
| 23 | +} |
| 24 | + |
| 25 | +@inproceedings{Lyu:2025a, |
| 26 | + abbr = {}, |
| 27 | + bibtex_show = {true}, |
| 28 | + author = {Lyu, Donghang and Staring, Marius and Doneva, Mariya and Lamb, Hildo and Pezzotti, Nicola}, |
| 29 | + title = {KP-INR: A Dual-Branch Implicit Neural Representation Model for Cardiac Cine MRI Reconstruction}, |
| 30 | + booktitle = {Statistical Atlases and Computational Modeling of the Heart (STACOM) at MICCAI}, |
| 31 | + address = {Daejeon, South Korea}, |
| 32 | + series = {Lecture Notes in Computer Science}, |
| 33 | + volume = {}, |
| 34 | + pages = {}, |
| 35 | + month = {September}, |
| 36 | + year = {2025}, |
| 37 | + pdf = {2025_c_STACOMa.pdf}, |
| 38 | + html = {}, |
| 39 | + arxiv = {2508.12147}, |
| 40 | + code = {}, |
| 41 | + abstract = {Cardiac Magnetic Resonance (CMR) imaging is a non-invasive method for assessing cardiac structure, function, and blood flow. Cine MRI extends this by capturing heart motion, providing detailed insights into cardiac mechanics. To reduce scan time and breath-hold discomfort, fast acquisition techniques have been utilized at the cost of lowering image quality. Recently, Implicit Neural Representation (INR) methods have shown promise in unsupervised reconstruction by learning coordinate-to-value mappings from undersampled data, enabling high quality image recovery. However, current existing INR methods primarily focus on using coordinate-based positional embeddings to learn the mapping, while overlooking the feature representations of the target point and its neighboring context. In this work, we propose KP-INR, a dual-branch INR method operating in k-space for cardiac cine MRI reconstruction: one branch processes the positional embedding of k-space coordinates, while the other learns from local multi-scale k-space feature representations at those coordinates. By enabling cross-branch interaction and approximating the target k-space values from both branches, KP-INR can achieve strong performance on challenging Cartesian k-space data. Experiments on the CMRxRecon2024 dataset confirms its improved performance over baseline models and highlights its potential in this field.}, |
| 42 | +} |
| 43 | + |
6 | 44 | @inproceedings{Gao:2025, |
7 | 45 | abbr = {}, |
8 | 46 | bibtex_show = {true}, |
|
0 commit comments