Papers
Topics
Authors
Recent
2000 character limit reached

Deep Image prior with StruCtUred Sparsity (DISCUS) for dynamic MRI reconstruction (2312.00953v2)

Published 1 Dec 2023 in eess.IV

Abstract: High-quality training data are not always available in dynamic MRI. To address this, we propose a self-supervised deep learning method called deep image prior with structured sparsity (DISCUS) for reconstructing dynamic images. DISCUS is inspired by deep image prior (DIP) and recovers a series of images through joint optimization of network parameters and input code vectors. However, DISCUS additionally encourages group sparsity on frame-specific code vectors to discover the low-dimensional manifold that describes temporal variations across frames. Compared to prior work on manifold learning, DISCUS does not require specifying the manifold dimensionality. We validate DISCUS using three numerical studies. In the first study, we simulate a dynamic Shepp-Logan phantom with frames undergoing random rotations, translations, or both, and demonstrate that DISCUS can discover the dimensionality of the underlying manifold. In the second study, we use data from a realistic late gadolinium enhancement (LGE) phantom to compare DISCUS with compressed sensing (CS) and DIP, and to demonstrate the positive impact of group sparsity. In the third study, we use retrospectively undersampled single-shot LGE data from five patients to compare DISCUS with CS reconstructions. The results from these studies demonstrate that DISCUS outperforms CS and DIP, and that enforcing group sparsity on the code vectors helps discover true manifold dimensionality and provides additional performance gain.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. “Image reconstruction: From sparsity to data-adaptive methods and machine learning,” Proceedings of the IEEE, vol. 108, no. 1, pp. 86–109, 2020.
  2. “fastMRI: An open dataset and benchmarks for accelerated MRI,” arXiv:1811.08839, 2018.
  3. “Deep image prior,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 9446–9454.
  4. “Time-dependent deep image prior for dynamic MRI,” IEEE Transactions on Medical Imaging, vol. 40, no. 12, pp. 3337–3348, 2021.
  5. “A low-rank deep image prior reconstruction for free-breathing ungated spiral functional CMR at 0.55 T and 1.5 T,” Magnetic Resonance Materials in Physics, Biology and Medicine, pp. 1–14, 2023.
  6. “Robust self-guided deep image prior,” in 2023 IEEE International Conference on Acoustics, Speech and Signal Processing, 2023, pp. 1–5.
  7. “Dynamic imaging using a deep generative storm (Gen-SToRM) model,” IEEE Transactions on Medical Imaging, vol. 40, no. 11, pp. 3102–3112, 2021.
  8. “Dynamic MRI using smoothness regularization on manifolds (SToRM),” IEEE Transactions on Medical Imaging, vol. 35, no. 4, pp. 1106–1115, 2015.
  9. Ming Yuan and Yi Lin, “Model selection and estimation in regression with grouped variables,” Journal of the Royal Statistical Society Series B: Statistical Methodology, vol. 68, no. 1, pp. 49–67, 2006.
  10. “Low-rank plus sparse matrix decomposition for accelerated dynamic MRI with separation of background and dynamic components,” Magnetic resonance in medicine, vol. 73, no. 3, pp. 1125–1136, 2015.
  11. “MRXCAT: Realistic numerical phantoms for cardiovascular magnetic resonance,” Journal of Cardiovascular Magnetic Resonance, vol. 16, no. 1, pp. 1–11, 2014.
  12. “Technical report (v1.0)–pseudo-random cartesian sampling for dynamic MRI,” arXiv preprint arXiv:2206.03630, 2022.
  13. “Phase-sensitive inversion recovery for detecting myocardial infarction using gadolinium-delayed hyperenhancement,” Magnetic Resonance in Medicine, vol. 47, no. 2, pp. 372–383, 2002.
  14. “Calibrationless parallel imaging reconstruction based on structured low-rank matrix completion,” Magnetic Resonance in Medicine, vol. 72, no. 4, pp. 959–970, 2014.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.