End-to-End Pyramid Based Method for MRI Reconstruction
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32870
End-to-End Pyramid Based Method for MRI Reconstruction

Authors: Omer Cahana, Maya Herman, Ofer Levi

Abstract:

Magnetic Resonance Imaging (MRI) is a lengthy medical scan that stems from a long acquisition time. Its length is mainly due to the traditional sampling theorem, which defines a lower boundary for sampling. However, it is still possible to accelerate the scan by using a different approach such as Compress Sensing (CS) or Parallel Imaging (PI). These two complementary methods can be combined to achieve a faster scan with high-fidelity imaging. To achieve that, two conditions must be satisfied: i) the signal must be sparse under a known transform domain, and ii) the sampling method must be incoherent. In addition, a nonlinear reconstruction algorithm must be applied to recover the signal. While the rapid advances in Deep Learning (DL) have had tremendous successes in various computer vision tasks, the field of MRI reconstruction is still in its early stages. In this paper, we present an end-to-end method for MRI reconstruction from k-space to image. Our method contains two parts. The first is sensitivity map estimation (SME), which is a small yet effective network that can easily be extended to a variable number of coils. The second is reconstruction, which is a top-down architecture with lateral connections developed for building high-level refinement at all scales. Our method holds the state-of-art fastMRI benchmark, which is the largest, most diverse benchmark for MRI reconstruction.

Keywords: Accelerate MRI scans, image reconstruction, pyramid network, deep learning.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 285

References:


[1] A. C.-Y. Yang, M. Kretzler, S. Sudarski, V. Gulani, and N. Seiberlich, “Sparse reconstruction techniques in MRI: methods, applications, and challenges to clinical adoption,” Investigative radiology, vol. 51, no. 6, pp. 349, 2016, NIH Public Access.
[2] E. J. Cand`es and M. B. Wakin, “An introduction to compressive sampling,” IEEE signal processing magazine, vol. 25, no. 2, pp. 21–30, 2008, IEEE.
[3] Y. C. Eldar and G. Kutyniok, Compressed sensing: theory and applications, Cambridge university press, 2012.
[4] K. P. Pruessmann, M. Weiger, M. B. Scheidegger, and P. Boesiger, “SENSE: sensitivity encoding for fast MRI,” Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine, vol. 42, no. 5, pp. 952–962, 1999, Wiley Online Library.
[5] M. A. Griswold, P. M. Jakob, R. M. Heidemann, M. Nittka, V. Jellus, J. Wang, B. Kiefer, and A. Haase, “Generalized autocalibrating partially parallel acquisitions (GRAPPA),” Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine, vol. 47, no. 6, pp. 1202–1210, 2002, Wiley Online Library.
[6] U. Gamper, P. Boesiger, and S. Kozerke, “Compressed sensing in dynamic MRI,” Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine, vol. 59, no. 2, pp. 365–373, 2008, Wiley Online Library.
[7] J. P. Haldar, D. Hernando, and Z.-P. Liang, “Compressed-sensing MRI with random encoding,” IEEE transactions on Medical Imaging, vol. 30, no. 4, pp. 893–903, 2010, IEEE.
[8] N. Chauffert, P. Ciuciu, J. Kahn, and P. Weiss, “Variable density sampling with continuous trajectories. Application to MRI,” arXiv preprint arXiv:1311.6039, 2013.
[9] D. M. Spielman, J. M. Pauly, and C. H. Meyer, “Magnetic resonance fluoroscopy using spirals with variable sampling densities,” Magnetic resonance in medicine, vol. 34, no. 3, pp. 388–394, 1995, Wiley Online Library.
[10] J. P. Haldar and D. Kim, “OEDIPUS: An experiment design framework for sparsity-constrained MRI,” IEEE transactions on medical imaging, vol. 38, no. 7, pp. 1545–1558, 2019, IEEE.
[11] C. D. Bahadir, A. Q. Wang, A. V. Dalca, and M. R. Sabuncu, “Deep-learning-based optimization of the under-sampling pattern in MRI,” IEEE Transactions on Computational Imaging, vol. 6, pp. 1139–1152, 2020, IEEE.
[12] P. Putzky, D. Karkalousos, J. Teuwen, N. Miriakov, B. Bakker, M. Caan, and M. Welling, “i-RIM applied to the fastMRI challenge,” arXiv preprint arXiv:1910.08952, 2019.
[13] M. Uecker, P. Lai, M. J. Murphy, P. Virtue, M. Elad, J. M. Pauly, S. S. Vasanawala, and M. Lustig, “ESPIRiT—an eigenvalue approach to autocalibrating parallel MRI: where SENSE meets GRAPPA,” Magnetic resonance in medicine, vol. 71, no. 3, pp. 990–1001, 2014, Wiley Online Library.
[14] Z. Ramzi, P. Ciuciu, and J.-L. Starck, “XPDNet for MRI Reconstruction: an application to the 2020 fastMRI challenge,” arXiv preprint arXiv:2010.07290, 2020.
[15] K. Hammernik, T. Klatzer, E. Kobler, M. P. Recht, D. K. Sodickson, T. Pock, and F. Knoll, “Learning a variational network for reconstruction of accelerated MRI data,” Magnetic resonance in medicine, vol. 79, no. 6, pp. 3055–3071, 2018, Wiley Online Library.
[16] A. Sriram, J. Zbontar, T. Murrell, A. Defazio, C. L. Zitnick, N. Yakubova, F. Knoll, and P. Johnson, “End-to-end variational networks for accelerated MRI reconstruction,” in International Conference on Medical Image Computing and Computer-Assisted Intervention, pp. 64–73, 2020, Springer.
[17] J. Zbontar et al., “fastMRI: An open dataset and benchmarks for accelerated MRI,” arXiv preprint arXiv:1811.08839, 2018.