Parallel Greedy Learning for Accelerating Cardiac Cine MRI
Lists
Only you see this
Abstract
Deep unrolled models have recently shown state-of-the-art performance for reconstruction of dynamic MR images. However, training these networks via backpropagation is limited by intensive memory and compute requirements to calculate gradients and store intermediate activations per layer. Motivated by these challenges, we propose an alternative training method by greedily relaxing the training objective. Our approach splits the end-to-end network into decoupled network modules, and optimizes each module separately, avoiding the need to compute end-to-end gradients. We demonstrate that our method outperforms end-to-end backpropagation by 3.3 dB in PSNR and 0.025 in SSIM with the same memory footprint.
BibTeX
@inproceedings{ozturkler2023parallel,
author = {Batu Ozturkler and Arda Sahiner and Tolga Ergen and Arjun Desai and Christopher M. Sandino and Shreyas Vasanawala and John M. Pauly and Morteza Mardani and Mert Pilancı},
title = {{Parallel Greedy Learning for Accelerating Cardiac Cine MRI}},
booktitle = {Proceedings on CD-ROM - International Society for Magnetic Resonance in Medicine. Scientific Meeting and Exhibition/Proceedings of the International Society for Magnetic Resonance in Medicine, Scientific Meeting and Exhibition},
year = {2023},
doi = {10.58530/2022/0845},
}Loading related content...