4489

Self-Supervised Low-rank plus Sparse Network for Radial MRI Reconstruction
Andrei Mancu1, Wenqi Huang2, Gastao Lima da Cruz3, Daniel Rückert2,4, and Kerstin Hammernik1
1School of Computation, Information and Technology, Technical University of Munich, München, Germany, 2Klinikum Rechts der Isar, Technical University of Munich, München, Germany, 3Department of Radiology, University of Michigan, Ann Arbor, MI, United States, 4Department of Computing, Imperial College London, London, United Kingdom

Synopsis

Keywords: AI/ML Image Reconstruction, Image Reconstruction, Inverse Problems, Deep learning, Low-rank, Cardiac MRI, Radial sampling

Motivation: Physics-guided self-supervised approaches have proven to be useful in MR image reconstruction from limited Cartesian measurements. However, the potential of radially-sampled k-space data remains largely unexplored.

Goal(s): In this context, we introduce a self-supervised learning approach to reconstruct dynamic images from sparsely-sampled radial cardiac data.

Approach: The proposed model integrates a novel low-rank and sparse regularizer in its iterative framework to better exploit the characteristics of dynamic images.

Results: Our method is compared to iterative reconstruction techniques and other deep neural network approaches in supervised and self-supervised tasks, where the proposed model achieves the best performance for a single and four heartbeat reconstruction.

Impact: Self-supervised models for radially sampled cardiac measurements can now be efficiently trained on limited amounts of data to reliably reconstruct high-contrast and low artifact dynamic MR images, even at high acceleration rates for faster acquisition speed.

Introduction

Deep neural networks1,2,3 (DNNs) have demonstrated remarkable efficiency in reconstructing undersampled k-space data. Furthermore, models incorporating physics-guided self-supervised DNNs4,5 have reliably reconstructed images utilizing limited data. However, the integration of radial k-space data6 into these methodologies has not been explored enough. Being more robust to motion artifacts and allowing for a more uniform k-space sampling along time7, radial k-space data offers a considerable advantage over Cartesian data for MR scans of moving organs, such as the heart.

In this work, we propose a physics-guided self-supervised DNN model designed to reconstruct radially sampled cardiac MR images using a novel regularizer. The contributions of this work are twofold: Firstly, the proposed model pioneers self-supervision for radial MR acquisitions, harnessing the advantages of radial data and allowing for efficient learning on very limited amounts of acquisitions. Secondly, our approach enhances the DNN architecture for improved cardiac motion capture by integrating a low-rank and sparse denoiser, significantly improving MR reconstruction for moving organs.

Methods

Cardiac MRI measurements are obtained alongside the patient’s electrocardiogram signal, which may span multiple cardiac cycles. 8 slices were acquired from 16 volunteer subjects, totaling 128 samples, on a 1.5T Philips machine using a 28-channel cardiac coil, consisting of short axis heart scans. The acquisition was conducted on 8 mm slice thickness, 2x2 mm$$$^2$$$ resolution, TE/TR = 1.16/2.3 ms, b-SSFP, radial tiny golden angle, 20s nominal scan time and breath-hold acquisition. The measurements are aligned into a unified cardiac cycle in order to mitigate the sparsity of the radial acquisitions in the spatial-frequency dimensions. They are then organized into temporal windows, each of which corresponds to a distinct cardiac phase of the heartbeat. Two datasets were considered in this work, using one and four cardiac cycles.

Our proposed model builds upon the self-supervised physics-guided MR reconstruction framework5, to solve the non-linear inverse problem by variable-splitting via quadratic penalty through iterative data consistency (DC) and regularizer (denoiser) steps:

$$l^{(i)}, s^{(i)} = f(y_\Omega, E_\Omega; \phi),\\
x^{(i)} = x^{(i-1)} - \mu E^{H}_{\Omega}(E_{\Omega}(l^{(i)}+s^{(i)})-y_\Omega).$$

Function $$$f$$$ represents the regularizer parameterized by $$$\phi$$$. To further leverage the intrinsic low-rank property of dynamic images, the regularizer incorporates a learnable low-rank and sparse component, $$$l^{(i)}$$$ and $$$s^{(i)}$$$, for an iteration $$$(i)$$$. $$$y_\Omega$$$ is the input k-space, masked by the undersampling mask $$$\Omega$$$, and the corresponding forward operator $$$E_\Omega$$$. Thus, the denoiser captures moving (heart motion) and non-moving parts (e.g. ribs, liver) of the image more efficiently than through a regular convolutional neural network5 (CNN). Figure 2 shows an in-depth illustration of the regularizer. The second equation represents the DC step, which uses a conjugate gradient approach. $$$\mu$$$ is a regularizing parameter, $$$H$$$ represents the Hermitian and $$$x$$$ is the reconstructed image. The regularizer-DC pairs are depicted in Figure 1d inside the unit block.

The proposed architecture supports supervised and self-supervised tasks. The model receives its self-supervision signal by subsampling the initial undersampling mask $$$\Omega$$$ (Figure 1a). During validation, $$$\Omega$$$ is split into two distinct subsets: $$$\Gamma$$$ for the loss calculation and $$$\Omega\setminus\Gamma$$$ for the model input. Subsampled from $$$\Omega\setminus\Gamma$$$, masks $$$\Theta$$$ and $$$\Lambda$$$ follow the same pattern during training time, resulting in the following loss:

$$ \operatorname*{min}_\phi \frac{1}{N} \sum_{n=1}^N L(y_{\Lambda}^n, E_{\Lambda}^n (f(y_\Theta^n, E_\Theta^n; \phi)))$$

Figure 1b,c shows a full overview of the self-supervised masking and training strategy. The proposed model is evaluated in both supervised and self-supervised tasks and compared to an iterative regularized reconstruction method (CG Sense8), a compressed sensing method (L+S9), and to the supervised and self-supervised models described in Yaman et al.5, adapted to radial k-space. The predictions are compared on normalized mean squared error, structural similarity index and peak signal-to-noise-ratio to the 20 heartbeat iterative L+S reconstruction.

Results

The proposed method outperforms the other reconstruction techniques in all metrics for one and four cardiac cycle datasets (Table 1). Figure 3 shows that our method surpasses the others in keeping the noise and streaking artifacts low. Moreover, higher contrast is achieved by the methods exploiting the low-rank prior of dynamic images across both datasets (red arrow). The temporal profiles and their errors are shown in Figure 4, where the proposed method achieves the lowest error and a smoother reconstruction on the temporal dimension.

Discussion and Conclusion

This work introduces a physics-guided self-supervised model architecture to efficiently train on small amounts of dynamic radially sampled data. Adding learnable low-rank and sparse components to the architecture dramatically improves the performance of the models for cardiac reconstruction, while CNNs as regularizers deliver sub-par performance. We anticipate that further development in the area of data preparation for patients with arrhythmia will expand its potential applications.

Acknowledgements

No acknowledgement found.

References

  1. K. Hammernik, T. Klatzer, E. Kobler, M. Recht, D. Sodickson, T. Pock, and F. Knoll, “Learning a Variational Network for Reconstruction of Accelerated MRI Data,” Magnetic Resonance in Medicine, pp. 3055–3071, 2017.
  2. F. Knoll, K. Hammernik, C. Zhang, S. Moeller, T. Pock, D. Sodickson, and M. Akçakaya, “Deep-Learning Methods for Parallel Magnetic Resonance Imaging Reconstruction: A survey of the current approaches, trends, and issues,” IEEE Signal Processing Magazine, vol. 37, pp. 128–140, 01 2020.
  3. M. Akçakaya, B. Yaman, H. Chung, and J. C. Ye, “Unsupervised Deep Learning Methods for Biological Image Reconstruction and Enhancement: An overview from a signal processing perspective,” IEEE Signal Processing Magazine, vol. 39, no. 2, pp. 28–44, 2022.
  4. B. Yaman, S. A. H. Hosseini, S. Moeller, J. Ellermann, K. Uğurbil, and M. Akçakaya, “Self-supervised learning of physics-guided reconstruction neural networks without fully sampled reference data,” Magnetic Resonance in Medicine, vol. 84, no. 6, pp. 3172–3191, 2020.
  5. B. Yaman, S. A. H. Hosseini, and M. Akcakaya, “Zero-Shot Self-Supervised Learning for MRI Reconstruction,” in International Conference on Learning Representations, 2022.
  6. M. Blumenthal, G. Luo, M. Schilling, M. Haltmeier, and M. Uecker, "NLINV-Net: Self-Supervised End-2-End Learning for Reconstructing Undersampled Radial Cardiac Real-Time Data," in Proceedings of International Society for Magnetic Resonance in Medicine (ISMRM), 2022.
  7. L. Feng, “Golden-Angle Radial MRI: Basics, Advances, and Applications,” Journal of Magnetic Resonance Imaging, vol. 56, 04 2022.
  8. K. P. Pruessmann, M. Weiger, M. B. Scheidegger, and P. Boesiger, “Sense: Sensitivity encoding for fast MRI,” Magnetic Resonance in Medicine, vol. 42, no. 5, pp. 952–962, 1999.
  9. W. Huang, Z. Ke, Z.-X. Cui, J. Cheng, Z. Qiu, S. Jia, L. Ying, Y. Zhu,and D. Liang, “Deep Low-rank plus Sparse Network for Dynamic MR Imaging,” Medical Image Analysis, vol. 73, p. 102190, 2021.

Figures

Figure 1: a) Data Processing. Sparse measurements from three heartbeats are compressed into one heartbeat and binned into temporal windows to create three cardiac phases. b) Radial Mask Splitting for Self-Supervision. c) Model training, validation and inference. Each stage's workflow is defined by the input mask and the respective loss mask. d) Components of an Unrolled Network Unit Block. The regularizer includes low-rank and sparse components, while data consistency uses a classic conjugate gradient approach.

Figure 2: An in-depth representation of the regularizer workflow on a sample from the dataset. The low-rank component reconstructs the input images with thresholded singular values. The low-rank images are then concatenated with the input images and run through 3 convolutional layers with leakyReLu activations. The output of the sparse component is added to the low-rank images to generate the output of the regularizer.

Table 1: Inference results of all experiments. The mean and the standard deviations of NMSE, SSIM and PSNR are displayed for each model prediction on one or four cardiac cycle dataset. "s" describes the supervised models, while "ssl" describes the self-supervised models.

Figure 3: Prediction images on a sample from the test set. First row presents the one cardiac cycle dataset, while the second row presents the four cycle dataset. "s" stands for supervised, "ssl" stands for self-supervised. The arrows are pointing at the contrast of the myocardium of the heart.

Figure 4: Time profile (yt plane) of the predictions on a sample from the two datasets (one and four heartbeat reconstructions). The value scale of the error maps represents the percentage of intensity error with regard to the maximum pixel intensity in the reference image.

Proc. Intl. Soc. Mag. Reson. Med. 32 (2024)
4489
DOI: https://doi.org/10.58530/2024/4489