Skip to main content

Fill the K-Space and Refine the Image: Prompting for Dynamic and Multi-Contrast MRI Reconstruction

  • Conference paper
  • First Online:
Statistical Atlases and Computational Models of the Heart. Regular and CMRxRecon Challenge Papers (STACOM 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14507))

  • 436 Accesses

Abstract

The key to dynamic or multi-contrast magnetic resonance imaging (MRI) reconstruction lies in exploring inter-frame or inter-contrast information. Currently, the unrolled model, an approach combining iterative MRI reconstruction steps with learnable neural network layers, stands as the best-performing method for MRI reconstruction. However, there are two main limitations to overcome: firstly, the unrolled model structure and GPU memory constraints restrict the capacity of each denoising block in the network, impeding the effective extraction of detailed features for reconstruction; secondly, the existing model lacks the flexibility to adapt to variations in the input, such as different contrasts, resolutions or views, necessitating the training of separate models for each input type, which is inefficient and may lead to insufficient reconstruction. In this paper, we propose a two-stage MRI reconstruction pipeline to address these limitations. The first stage involves filling the missing k-space data, which we approach as a physics-based reconstruction problem. We first propose a simple yet efficient baseline model, which utilizes adjacent frames/contrasts and channel attention to capture the inherent inter-frame/-contrast correlation. Then, we extend the baseline model to a prompt-based learning approach, PromptMR, for all-in-one MRI reconstruction from different views, contrasts, adjacent types, and acceleration factors. The second stage is to refine the reconstruction from the first stage, which we treat as a general video restoration problem to further fuse features from neighboring frames/contrasts in the image domain. Extensive experiments show that our proposed method significantly outperforms previous state-of-the-art accelerated MRI reconstruction methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://github.com/facebookresearch/fastMRI/discussions/293.

References

  1. Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006)

    Article  MathSciNet  Google Scholar 

  2. Fabian, Z., Tinaz, B., Soltanolkotabi, M.: Humus-net: hybrid unrolled multi-scale network architecture for accelerated MRI reconstruction. Adv. Neural. Inf. Process. Syst. 35, 25306–25319 (2022)

    Google Scholar 

  3. Hu, J., Shen, L., Sun, G.: Squeeze-and-excitation networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 7132–7141 (2018)

    Google Scholar 

  4. Huang, Q., Yang, D., Wu, P., Qu, H., Yi, J., Metaxas, D.: MRI reconstruction via cascaded channel-wise attention network. In: 2019 IEEE 16th International Symposium on Biomedical Imaging (ISBI 2019), pp. 1622–1626. IEEE (2019)

    Google Scholar 

  5. Jia, M., et al.: Visual prompt tuning. In: European Conference on Computer Vision. pp. 709–727. Springer (2022). https://doi.org/10.1007/978-3-031-19827-4_41

  6. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 19113–19122 (2023)

    Google Scholar 

  7. Li, B., Liu, X., Hu, P., Wu, Z., Lv, J., Peng, X.: All-in-one image restoration for unknown corruption. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 17452–17462 (2022)

    Google Scholar 

  8. Li, D., et al.: A simple baseline for video restoration with grouped spatial-temporal shift. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 9822–9832 (2023)

    Google Scholar 

  9. Liang, J., Cao, J., Sun, G., Zhang, K., Van Gool, L., Timofte, R.: Swinir: image restoration using swin transformer. In: Proceedings of the IEEE/CVF International Conference on Computer Vision, pp. 1833–1844 (2021)

    Google Scholar 

  10. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017)

  11. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. J. Mach. Learn. Res. 9(11) (2008)

    Google Scholar 

  12. Potlapalli, V., Zamir, S.W., Khan, S., Khan, F.S.: Promptir: prompting for all-in-one blind image restoration. arXiv preprint arXiv:2306.13090 (2023)

  13. Rajiah, P.S., François, C.J., Leiner, T.: Cardiac MRI: state of the art. Radiology 307(3), 223008 (2023)

    Google Scholar 

  14. Roemer, P.B., Edelstein, W.A., Hayes, C.E., Souza, S.P., Mueller, O.M.: The NMR phased array. Magn. Reson. Med. 16(2), 192–225 (1990)

    Article  Google Scholar 

  15. Ronneberger, O., Fischer, P., Brox, T.: U-Net: convolutional networks for biomedical image segmentation. In: Navab, N., Hornegger, J., Wells, W.M., Frangi, A.F. (eds.) MICCAI 2015. LNCS, vol. 9351, pp. 234–241. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24574-4_28

    Chapter  Google Scholar 

  16. Sriram, A., et al.: End-to-end variational networks for accelerated MRI reconstruction. In: Martel, A.L., et al. (eds.) MICCAI 2020. LNCS, vol. 12262, pp. 64–73. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59713-9_7

    Chapter  Google Scholar 

  17. Wang, C., et al.: Cmrxrecon: an open cardiac MRI dataset for the competition of accelerated image reconstruction. arXiv preprint arXiv:2309.10836 (2023)

  18. Zamir, S.W., Arora, A., Khan, S., Hayat, M., Khan, F.S., Yang, M.H.: Restormer: eDfficient transformer for high-resolution image restoration. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 5728–5739 (2022)

    Google Scholar 

  19. Zbontar, J., et al.: fastmri: An open dataset and benchmarks for accelerated MRI. arXiv preprint arXiv:1811.08839 (2018)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bingyu Xin .

Editor information

Editors and Affiliations

Appendices

Appendix

A Details of the Baseline Model

1.1 A.1 CAUnet

(See Fig. 6).

Fig. 6.
figure 6

Overview of the CAUnet architecture in the proposed baseline model.

1.2 A.2 Unrolled Model Architecture

(See Fig. 7).

Fig. 7.
figure 7

Overview of the unrolled model architecture for both our baseline model and PromptMR. The primary distinction is in the denoiser D and sensitivity map estimation (SME) networks: the baseline employs CAUnet, whereas PromptMR utilizes PromptUnet. Each cascade represents an updating step in Eq. 5 in the main text. The red module indicates the learnable part in the unrolled model.

B Experiments on FastMRI Multi-Coil Knee Dataset

Benchmark on FastMRI Multi-Coil Knee Dataset. To assess the performance of our proposed method across different anatomies, we benchmarked it on another large-scale MRI reconstruction dataset, the fastMRI multi-coil knee dataset [19]. Since the online evaluation platform for the fastMRI test set is unavailableFootnote 1, we divided the original 199 validation cases into 99 for validation and 100 for testing. The results of other methods are reported using their officially pretrained models. As presented in Table 4, our models outperform all previous state-of-the-art methods, without significantly increasing the number of network parameters compared to E2E-Varnet.

Table 4. Performance of state-of-the-art accelerated MRI reconstruction techniques on the fastMRI knee multi-coil \(\times 8\) test dataset. The best and second best results are highlighted in and colors, respectively.

Effectiveness of Two-Stage Pipeline. We employed ShiftNet to refine the images reconstructed by the pretrained E2E-Varnet on the fastMRI multi-coil knee test dataset with \(\times 8\) undersampling. Table 5 shows that the second-stage refinement substantially improves the reconstruction quality, which implies that the multi-slice information in the fastMRI dataset might not be comprehensively utilized by the single-stage unrolled model.

Table 5. Effectiveness of the second-stage image refinement on the fastMRI knee multi-coil \(\times 8\) test dataset.

C Additional Qualitative Results on CMRxRecon Dataset

(See Fig. 8).

Fig. 8.
figure 8

Visual comparison of reconstructions from the CMRxRecon dataset with \(\times 10\) acceleration. PromptMR can recover fine details (highlighted in red box) on reconstructed images that other state-of-the-art methods may miss. (Color figure online)

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xin, B., Ye, M., Axel, L., Metaxas, D.N. (2024). Fill the K-Space and Refine the Image: Prompting for Dynamic and Multi-Contrast MRI Reconstruction. In: Camara, O., et al. Statistical Atlases and Computational Models of the Heart. Regular and CMRxRecon Challenge Papers. STACOM 2023. Lecture Notes in Computer Science, vol 14507. Springer, Cham. https://doi.org/10.1007/978-3-031-52448-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-52448-6_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-52447-9

  • Online ISBN: 978-3-031-52448-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics