Large-scale 3D non-Cartesian coronary MRI reconstruction using distributed memory-efficient physics-guided deep learning with limited training data

OBJECT

To enable high-quality physics-guided deep learning (PG-DL) reconstruction of large-scale 3D non-Cartesian coronary MRI by overcoming challenges of hardware limitations and limited training data availability.

MATERIALS AND METHODS

While PG-DL has emerged as a powerful image reconstruction method, its application to large-scale 3D non-Cartesian MRI is hindered by hardware limitations and limited availability of training data. We combine several recent advances in deep learning and MRI reconstruction to tackle the former challenge, and we further propose a 2.5D reconstruction using 2D convolutional neural networks, which treat 3D volumes as batches of 2D images to train the network with a limited amount of training data. Both 3D and 2.5D variants of the PG-DL networks were compared to conventional methods for high-resolution 3D kooshball coronary MRI.

RESULTS

Proposed PG-DL reconstructions of 3D non-Cartesian coronary MRI with 3D and 2.5D processing outperformed all conventional methods both quantitatively and qualitatively in terms of image assessment by an experienced cardiologist. The 2.5D variant further improved vessel sharpness compared to 3D processing, and scored higher in terms of qualitative image quality.

DISCUSSION

PG-DL reconstruction of large-scale 3D non-Cartesian MRI without compromising image size or network complexity is achieved, and the proposed 2.5D processing enables high-quality reconstruction with limited training data.

Efficient Compressed Sensing SENSE pMRI Reconstruction With Joint Sparsity Promotion

The theory and techniques of compressed sensing (CS) have shown their potential as a breakthrough in accelerating k-space data acquisition for parallel magnetic resonance imaging (pMRI). However, the performance of CS reconstruction models in pMRI has not been fully maximized, and CS recovery guarantees for pMRI are largely absent. To improve reconstruction accuracy from parsimonious amounts of k-space data while maintaining flexibility, a new CS SENSitivity Encoding (SENSE) pMRI reconstruction framework promoting joint sparsity (JS) across channels (JS CS SENSE) is proposed in this paper. The recovery guarantee derived for the proposed JS CS SENSE model is demonstrated to be better than that of the conventional CS SENSE model and similar to that of the coil-by-coil CS model. The flexibility of the new model is better than the coil-by-coil CS model and the same as that of CS SENSE. For fast image reconstruction and fair comparisons, all the introduced CS-based constrained optimization problems are solved with split Bregman, variable splitting, and combined-variable splitting techniques. For the JS CS SENSE model in particular, these techniques lead to an efficient algorithm. Numerical experiments show that the reconstruction accuracy is significantly improved by JS CS SENSE compared with the conventional CS SENSE. In addition, an accurate residual-JS regularized sensitivity estimation model is also proposed and extended to calibration-less (CaL) JS CS SENSE. Numerical results show that CaL JS CS SENSE outperforms other state-of-the-art CS-based calibration-less methods in particular for reconstructing non-piecewise constant images.

Combining ordered subsets and momentum for accelerated X-ray CT image reconstruction

Statistical X-ray computed tomography (CT) reconstruction can improve image quality from reduced dose scans, but requires very long computation time. Ordered subsets (OS) methods have been widely used for research in X-ray CT statistical image reconstruction (and are used in clinical PET and SPECT reconstruction). In particular, OS methods based on separable quadratic surrogates (OS-SQS) are massively parallelizable and are well suited to modern computing architectures, but the number of iterations required for convergence should be reduced for better practical use. This paper introduces OS-SQS-momentum algorithms that combine Nesterov's momentum techniques with OS-SQS methods, greatly improving convergence speed in early iterations. If the number of subsets is too large, the OS-SQS-momentum methods can be unstable, so we propose diminishing step sizes that stabilize the method while preserving the very fast convergence behavior. Experiments with simulated and real 3D CT scan data illustrate the performance of the proposed algorithms.