3291

Holistic Acceleration from Acquisition to Reconstruction for Submilimeter 3D MR Fingerprinting via Deep Learning
Yilin Liu1, Feng Cheng1, Yong Chen2, and Pew-Thian Yap3
1Computer Science, UNC-Chapel Hill, Chapel Hill, NC, United States, 2Radiology, Case Western Reserve University, Cleveland, OH, United States, 3Radiology, UNC-Chapel Hill, Chapel Hill, NC, United States

Synopsis

We developed a novel deep-learning empowered pipeline for both rapid acquisition and reconstruction of high-resolution 3D MRF with 16X acceleration, thereby significantly improving the clinical feasibility of MRF for quantitative imaging.

Introduction

MR Fingerprinting [1] measures multiple tissue properties in a single acquisition. Compared with 2D MRF, 3D MRF provides whole-brain coverage with higher spatial resolution and SNR. However, 3D MRF, especially with an isotropic submillimeter resolution, suffers from lengthy acquisition and processing times, limiting its clinical applicability. In this work, we developed a fully deep-learning empowered pipeline consisting of (i) a graph convolutional network that replaces GRAPPA [2] for k-space interpolation and (ii) an end-to-end tissue quantification network reconstructing directly from the filled k-space data, avoiding time-consuming Non-uniform Fast Fourier Transform (NUFFT) and dictionary matching (DM). Our preliminary results show that accurate whole-brain 3D MRF acquisition with simultaneous T1 and T2 mapping with 0.8-mm isotropic resolution can be achieved in a total scan time of ~5 mins (16X acceleration: 4X along the partition and 4X along the time direction). Particularly, the reconstruction time is less than 0.5s per slice, which is ~1100 times faster than the standard NUFFT+DM reconstruction.

Methods

All MRI experiments were performed on a Siemens 3T scanner with a 32-channel receive coil. Details on the 3D MRF pulse sequence are described in [3]. The 3D MRF dataset was acquired using a stack-of-spirals trajectory. Sub-millimeter isotropic resolution was achieved via a spiral trajectory designed with a maximum gradient magnitude of 32 mT/m and a maximum slew rate of 180 mT/m/msec. Imaging parameters include: FOV, 25x25 cm; matrix size, 320x320; TR, 12.6 ms; TE, 1.3 ms; flip angles, 5-12 degrees; number of slices, 176. The acquisition time for 768 MRF time frames with 2X interleaved undersampling in k-space was ~20 min. The gold standard was obtained using GRAPPA+dictionary matching with the acquired data [3]. MRF data were acquired for 5 subjects, and 4 datasets were used for training and 1 for testing. Retrospective undersampled data were used for numerical evaluation. The total acquisition time with whole brain coverage (14 cm) was less than 5 minutes.

For training, the data underwent 4X undersampling along both the partition-encoding direction in k-space and the time dimension. Our pipeline (Fig. 1) consists of 1) a Graph Convolutional Network (GCN) for interpolating the missing k-space data, and 2) an end-to-end quantification network based on U-Net for direct tissue mapping from the interpolated spiral k-space data. Multiple time-consuming steps in the standard MRF reconstruction framework including non-uniform FFT and dictionary-based template matching are circumvented in the proposed pipeline.

The GCN (Fig. 1(a)) [4] consists of nb blocks where each block contains a graph convolutional layer for spatial aggregation and two 1x1 convolutional layers for feature transformation. Essentially, each block gathers local information from its 5 1-hop spiral neighbors (i.e., kernel size=5) and maps it to a new feature space for learning the correlations among the neighboring spiral points. Residual connections [5] are added to ease training. Similar to traditional parallel imaging methods [2], GCN was trained on the central k-space data containing 16 partitions.

After k-space interpolation with GCN, the data were then fed into the quantification network. Unlike the original two-stage MRF framework that first reconstructs the time frames from spiral k-space MRF data using NUFFT and then uses DM for tissue mapping, our quantification network learns end-to-end a direct mapping from the interpolated spiral k-space data to the tissue maps (Fig 1. (b)). Specifically, every T (T=32, determined by the spiral trajectory) temporally consecutive spirals were first stacked using a sliding-window for full k-space coverage. The features for each target grid point were then agglomerated from its K nearest neighbors from a stack of spirals via concatenation. Density compensation is modeled as a function of data locations on the spiral sampling trajectory, parameterized by polar coordinates of the sampled data. A U-Net [6] is employed to map the algomerated features to tissue maps so that gridding and tissue mapping are simultaneously performed from k-space. Details of the two network architectures are further described in Fig 2.

Results

Fig. 3 and Fig. 4 show representative T1 and T2 maps of two slices obtained from the 3D MRF data with 0.8 mm isotropic resolution and 16X acceleration. Compared with no interpolation along the partitions, the proposed pipeline yields improved performance, exhibiting more details, in addition to the fast overall processing speed. Table 1 shows the quantitative results over all slices and processing times of different methods.

Discussion and Conclusion

We proposed a fully learning-based pipeline for rapid and accurate acquisition and reconstruction of high-resolution 3D MRF. We expect further boost in tissue quantification accuracy when more training data are collected in the future.

Acknowledgements

This work was supported in part by United States National Institutes of Health (NIH) grant EB006733.

References

[1] D. Ma, V. Gulani, N. Seiberlich, K. Liu, J. L. Sunshine, J. L. Duerk,and M. A. Griswold, “Magnetic resonance fingerprinting,”Nature, vol.495, no. 7440, pp. 187–192, 2013.

[2] Griswold, M. A., Jakob, P. M., Heidemann, R. M., Nittka, M., Jellus, V., Wang, J., ... & Haase, A. (2002). Generalized autocalibrating partially parallel acquisitions (GRAPPA). Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine, 47(6), 1202-1210.

[3] Chen, Y., Fang, Z., Hung, S. C., Chang, W. T., Shen, D., & Lin, W. (2020). High-resolution 3D MR Fingerprinting using parallel imaging and deep learning. NeuroImage, 206, 116329.

[4] T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR, 2016.

[5] He, K., Zhang, X., Ren, S., & Sun, J. (2016). Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 770-778).

[6] Ronneberger, O., Fischer, P., & Brox, T. (2015, October). U-net: Convolutional networks for biomedical image segmentation. In International Conference on Medical image computing and computer-assisted intervention (pp. 234-241). Springer, Cham.

Figures

Fig 1. Overview of our pipeline. The graph convolutional network performs k-space interpolation (in place of traditional parallel imaging methods). The U-Net maps the spiral k-space MRF data directly to the k-space of the T1 or T2 map, which is then mapped to the image space of T1 or T2 map simply via inverse FFT.

Fig 2. Architecture of the graph convolutional network and the end-to-end tissue mapping network. (1) Each spiral is represented as a graph with the adjacency matrix computed based on the exponential of the negative normalized squared L2 distance between each pair of k-space data points. All layers are ReLU activated except for the last layer. (2) The end-to-end quantification method consists of three steps: (a) sliding-window stacking of spirals, (b) learned density compensation, and (c) tissue mapping via agglomerated neighboring features.

Fig. 3 Representative T1 and T2 maps from one slice obtained using retrospectively 4X undersampled in partition dimension and 4X in time dimension (16X total). The proposed pipeline (GCN + UNet) achieves better performance quantitatively and qualitatively than without k-space interpolation (UNet only).

Fig. 4 Representative T1 and T2 maps from another slice obtained using retrospectively 4X undersampled in partition dimension and 4X in time dimension (16X total). The proposed pipeline (GCN + UNet) achieves better performance quantitatively and qualitatively than without k-space interpolation (UNet only).

Table 1. (a) Quantitative comparison between the proposed pipeline and the one without k-space interpolation. (b) Processing times of dictionary matching (DM), SVD-compressed dictionary matching (SDM), and a low-rank approximation method (Low-Rank).

Proc. Intl. Soc. Mag. Reson. Med. 30 (2022)
3291
DOI: https://doi.org/10.58530/2022/3291