Free-Breathing and Ungated Dynamic MRI Using Navigator-Less Spiral SToRM

Feasibility of fetal cardiac function and anatomy assessment by real-time spiral balanced steady-state free precession magnetic resonance imaging at 0.55T

BACKGROUND

Contemporary 0.55T magnetic resonance imaging (MRI) is promising for fetal MRI, due to the larger bore, reduced safety concerns, lower acoustic noise, and improved fast imaging capability. In this work, we explore improved fetal cardiovascular magnetic resonance (CMR) without relying on any synchronizing devices, prospective, or retrospective gating, to determine the feasibility of real-time MRI evaluation of fetal cardiac function as well as cardiac and great vessel anatomies by using spiral balanced steady-state free precession (bSSFP) at 0.55T.

METHODS

A real-time spiral bSSFP pulse sequence for fetal CMR was implemented and optimized on a 0.55T whole-body MRI. Fetal CMR was prospectively performed between May 2022 and August 2023. The protocol included (1) real-time images at standard cardiac views, for 10-20 s/view and 40-43.6 ms/frame and (2) 4-9 stacks of slices at standard cardiac views that each cover the whole heart, with 15-30 slices/stack, and 2-5 s/slice, at 320-349 ms/frame. Images were evaluated by a fetal cardiologist. Quantitative measurements of cardiothoracic area ratio and cardiac axis were compared with previous reports. Diagnostic accuracy was compared against postnatal echocardiographic findings.

RESULTS

Twenty-nine participants were enrolled for 32 CMR exams, with mean maternal age 33.6 ± 5.8 years (range 22-44 years) and mean gestational age 32.8 ± 3.9 weeks (range 23-38 weeks). The proposed sequence enabled evaluation of the fetal heart in <30 min in all cases (average 22 min). Real-time MRI allowed easy adjustment of scan plan, automatic whole-heart volumetric sweeping, and flexible choice of reconstruction temporal resolution. For key cardiac anatomic features, 60% (315/527) were delineated well. Mean cardiothoracic area ratio and cardiac axis were 0.27 ± 0.04 and 45.8 ± 7.8 degrees. Diagnostic agreement with postnatal echocardiographic findings was 84% (26/31).

CONCLUSION

A spiral real-time bSSFP pulse sequence at 0.55T can provide both low-framerate and high-framerate fetal heart images without relying on maternal breath-hold, specialized gating devices, or cardiac gating. The low-framerate images offer high diagnostic quality structural evaluations of the fetal heart, while the high-framerate images capture fetal heart motion and may enable functional assessments.

Prospectively accelerated dynamic speech magnetic resonance imaging at 3 T using a self-navigated spiral-based manifold regularized scheme

This work develops and evaluates a self-navigated variable density spiral (VDS)-based manifold regularization scheme to prospectively improve dynamic speech magnetic resonance imaging (MRI) at 3 T. Short readout duration spirals (1.3-ms long) were used to minimize sensitivity to off-resonance. A custom 16-channel speech coil was used for improved parallel imaging of vocal tract structures. The manifold model leveraged similarities between frames sharing similar vocal tract postures without explicit motion binning. The self-navigating capability of VDS was leveraged to learn the Laplacian structure of the manifold. Reconstruction was posed as a sensitivity-encoding-based nonlocal soft-weighted temporal regularization scheme. Our approach was compared with view-sharing, low-rank, temporal finite difference, extra dimension-based sparsity reconstruction constraints. Undersampling experiments were conducted on five volunteers performing repetitive and arbitrary speaking tasks at different speaking rates. Quantitative evaluation in terms of mean square error over moving edges was performed in a retrospective undersampling experiment on one volunteer. For prospective undersampling, blinded image quality evaluation in the categories of alias artifacts, spatial blurring, and temporal blurring was performed by three experts in voice research. Region of interest analysis at articulator boundaries was performed in both experiments to assess articulatory motion. Improved performance with manifold reconstruction constraints was observed over existing constraints. With prospective undersampling, a spatial resolution of 2.4 × 2.4 mm2/pixel and a temporal resolution of 17.4 ms/frame for single-slice imaging, and 52.2 ms/frame for concurrent three-slice imaging, were achieved. We demonstrated implicit motion binning by analyzing the mechanics of the Laplacian matrix. Manifold regularization demonstrated superior image quality scores in reducing spatial and temporal blurring compared with all other reconstruction constraints. While it exhibited faint (nonsignificant) alias artifacts that were similar to temporal finite difference, it provided statistically significant improvements compared with the other constraints. In conclusion, the self-navigated manifold regularized scheme enabled robust high spatiotemporal resolution dynamic speech MRI at 3 T.

Deep learning for accelerated and robust MRI reconstruction

Deep learning (DL) has recently emerged as a pivotal technology for enhancing magnetic resonance imaging (MRI), a critical tool in diagnostic radiology. This review paper provides a comprehensive overview of recent advances in DL for MRI reconstruction, and focuses on various DL approaches and architectures designed to improve image quality, accelerate scans, and address data-related challenges. It explores end-to-end neural networks, pre-trained and generative models, and self-supervised methods, and highlights their contributions to overcoming traditional MRI limitations. It also discusses the role of DL in optimizing acquisition protocols, enhancing robustness against distribution shifts, and tackling biases. Drawing on the extensive literature and practical insights, it outlines current successes, limitations, and future directions for leveraging DL in MRI reconstruction, while emphasizing the potential of DL to significantly impact clinical imaging practices.

Fourier Domain Robust Denoising Decomposition and Adaptive Patch MRI Reconstruction

The sparsity of the Fourier transform domain has been applied to magnetic resonance imaging (MRI) reconstruction in k -space. Although unsupervised adaptive patch optimization methods have shown promise compared to data-driven-based supervised methods, the following challenges exist in MRI reconstruction: 1) in previous k -space MRI reconstruction tasks, MRI with noise interference in the acquisition process is rarely considered. 2) Differences in transform domains should be resolved to achieve the high-quality reconstruction of low undersampled MRI data. 3) Robust patch dictionary learning problems are usually nonconvex and NP-hard, and alternate minimization methods are often computationally expensive. In this article, we propose a method for Fourier domain robust denoising decomposition and adaptive patch MRI reconstruction (DDAPR). DDAPR is a two-step optimization method for MRI reconstruction in the presence of noise and low undersampled data. It includes the low-rank and sparse denoising reconstruction model (LSDRM) and the robust dictionary learning reconstruction model (RDLRM). In the first step, we propose LSDRM for different domains. For the optimization solution, the proximal gradient method is used to optimize LSDRM by singular value decomposition and soft threshold algorithms. In the second step, we propose RDLRM, which is an effective adaptive patch method by introducing a low-rank and sparse penalty adaptive patch dictionary and using a sparse rank-one matrix to approximate the undersampled data. Then, the block coordinate descent (BCD) method is used to optimize the variables. The BCD optimization process involves valid closed-form solutions. Extensive numerical experiments show that the proposed method has a better performance than previous methods in image reconstruction based on compressed sensing or deep learning.

HyperSLICE: HyperBand optimized spiral for low-latency interactive cardiac examination

PURPOSE

Interactive cardiac MRI is used for fast scan planning and MR-guided interventions. However, the requirement for real-time acquisition and near-real-time visualization constrains the achievable spatio-temporal resolution. This study aims to improve interactive imaging resolution through optimization of undersampled spiral sampling and leveraging of deep learning for low-latency reconstruction (deep artifact suppression).

METHODS

A variable density spiral trajectory was parametrized and optimized via HyperBand to provide the best candidate trajectory for rapid deep artifact suppression. Training data consisted of 692 breath-held CINEs. The developed interactive sequence was tested in simulations and prospectively in 13 subjects (10 for image evaluation, 2 during catheterization, 1 during exercise). In the prospective study, the optimized framework-HyperSLICE- was compared with conventional Cartesian real-time and breath-hold CINE imaging in terms quantitative and qualitative image metrics. Statistical differences were tested using Friedman chi-squared tests with post hoc Nemenyi test (p < 0.05).

RESULTS

In simulations the normalized RMS error, peak SNR, structural similarity, and Laplacian energy were all statistically significantly higher using optimized spiral compared to radial and uniform spiral sampling, particularly after scan plan changes (structural similarity: 0.71 vs. 0.45 and 0.43). Prospectively, HyperSLICE enabled a higher spatial and temporal resolution than conventional Cartesian real-time imaging. The pipeline was demonstrated in patients during catheter pull back, showing sufficiently fast reconstruction for interactive imaging.

CONCLUSION

HyperSLICE enables high spatial and temporal resolution interactive imaging. Optimizing the spiral sampling enabled better overall image quality and superior handling of image transitions compared with radial and uniform spiral trajectories.

Parallel non-Cartesian spatial-temporal dictionary learning neural networks (stDLNN) for accelerating 4D-MRI

Dynamic magnetic resonance imaging (MRI) acquisitions are relatively slow due to physical and physiological limitations. The spatial-temporal dictionary learning (DL) approach accelerates dynamic MRI by learning spatial-temporal correlations, but the regularization parameters need to be manually adjusted, the performance at high acceleration rate is limited, and the reconstruction can be time-consuming. Deep learning techniques have shown good performance in accelerating MRI due to the powerful representational capabilities of neural networks. In this work, we propose a parallel non-Cartesian spatial-temporal dictionary learning neural networks (stDLNN) framework that combines dictionary learning with deep learning algorithms and utilizes the spatial-temporal prior information of dynamic MRI data to achieve better reconstruction quality and efficiency. The coefficient estimation modules (CEM) are designed in the framework to adaptively adjust the regularization coefficients. Experimental results show that combining dictionary learning with deep neural networks and using spatial-temporal dictionaries can obviously improve the image quality and computational efficiency compared with the state-of-the-art non-Cartesian imaging methods for accelerating the 4D-MRI especially at high acceleration rate.

Manifold Learning via Linear Tangent Space Alignment (LTSA) for Accelerated Dynamic MRI With Sparse Sampling

The spatial resolution and temporal frame-rate of dynamic magnetic resonance imaging (MRI) can be improved by reconstructing images from sparsely sampled k -space data with mathematical modeling of the underlying spatiotemporal signals. These models include sparsity models, linear subspace models, and non-linear manifold models. This work presents a novel linear tangent space alignment (LTSA) model-based framework that exploits the intrinsic low-dimensional manifold structure of dynamic images for accelerated dynamic MRI. The performance of the proposed method was evaluated and compared to state-of-the-art methods using numerical simulation studies as well as 2D and 3D in vivo cardiac imaging experiments. The proposed method achieved the best performance in image reconstruction among all the compared methods. The proposed method could prove useful for accelerating many MRI applications, including dynamic MRI, multi-parametric MRI, and MR spectroscopic imaging.

Variational Manifold Learning From Incomplete Data: Application to Multislice Dynamic MRI

Current deep learning-based manifold learning algorithms such as the variational autoencoder (VAE) require fully sampled data to learn the probability density of real-world datasets. However, fully sampled data is often unavailable in a variety of problems, including the recovery of dynamic and high-resolution magnetic resonance imaging (MRI). We introduce a novel variational approach to learn a manifold from undersampled data. The VAE uses a decoder fed by latent vectors, drawn from a conditional density estimated from the fully sampled images using an encoder. Since fully sampled images are not available in our setting, we approximate the conditional density of the latent vectors by a parametric model whose parameters are estimated from the undersampled measurements using back-propagation. We use the framework for the joint alignment and recovery of multi-slice free breathing and ungated cardiac MRI data from highly undersampled measurements. Experimental results demonstrate the utility of the proposed scheme in dynamic imaging alignment and reconstructions.

Dynamic Imaging Using Deep Bi-Linear Unsupervised Representation (DEBLUR)

Bilinear models such as low-rank and dictionary methods, which decompose dynamic data to spatial and temporal factor matrices are powerful and memory-efficient tools for the recovery of dynamic MRI data. Current bilinear methods rely on sparsity and energy compaction priors on the factor matrices to regularize the recovery. Motivated by deep image prior, we introduce a novel bilinear model, whose factor matrices are generated using convolutional neural networks (CNNs). The CNN parameters, and equivalently the factors, are learned from the undersampled data of the specific subject. Unlike current unrolled deep learning methods that require the storage of all the time frames in the dataset, the proposed approach only requires the storage of the factors or compressed representation; this approach allows the direct use of this scheme to large-scale dynamic applications, including free breathing cardiac MRI considered in this work. To reduce the run time and to improve performance, we initialize the CNN parameters using existing factor methods. We use sparsity regularization of the network parameters to minimize the overfitting of the network to measurement noise. Our experiments on free-breathing and ungated cardiac cine data acquired using a navigated golden-angle gradient-echo radial sequence show the ability of our method to provide reduced spatial blurring as compared to classical bilinear methods as well as a recent unsupervised deep-learning approach.

Optimization of through-time radial GRAPPA with coil compression and weight sharing

PURPOSE

This work proposes principal component analysis (PCA) coil compression and weight sharing to reduce acquisition and reconstruction time of through-time radial GRAPPA.

METHODS

Through-time radial GRAPPA enables ungated free-breathing motion-resolved cardiac imaging but requires a long calibration acquisition and GRAPPA weight calculation time. PCA coil compression reduces calibration data requirements and associated acquisition time, and weight sharing reduces the number of unique GRAPPA weight sets and associated weight computation time. In vivo cardiac data reconstructed with coil compression and weight sharing are compared to a gold standard to demonstrate improvement in calibration acquisition and reconstruction performance with minimal loss of image quality.

RESULTS

Coil compression from 30 physical to 12 virtual coils (90% of signal variance) decreases requisite calibration data by 60%, reducing calibration acquisition time to 6.7 s/slice from 31.5 s/slice reported in original through-time radial GRAPPA work. Resulting images have small increase in RMS error (RMSE). Reconstruction with a weight sharing factor of 8 results in eight-fold reduction in GRAPPA weight calculation time with a comparable RMSE to reconstructions with no weight sharing. Optimized parameters for coil compression and weight sharing applied to reconstructions enables images to be collected with a temporal resolution of 66 ms/frame and spatial resolution of 2.34 × 2.34 mm while reducing calibration acquisition time from 34 to 6.7 s, weight calculation time from 200 to 3 s, and weight application time 18 to 5 s.

CONCLUSION

Coil compression and weight sharing applied to through-time radial GRAPPA enables fast free-breathing ungated cardiac cine without compromising image quality.

Dynamic imaging using motion-compensated smoothness regularization on manifolds (MoCo-SToRM)

Objective. We introduce an unsupervised motion-compensated reconstruction scheme for high-resolution free-breathing pulmonary magnetic resonance imaging.Approach. We model the image frames in the time series as the deformed version of the 3D template image volume. We assume the deformation maps to be points on a smooth manifold in high-dimensional space. Specifically, we model the deformation map at each time instant as the output of a CNN-based generator that has the same weight for all time-frames, driven by a low-dimensional latent vector. The time series of latent vectors account for the dynamics in the dataset, including respiratory motion and bulk motion. The template image volume, the parameters of the generator, and the latent vectors are learned directly from the k-t space data in an unsupervised fashion.Main results. Our experimental results show improved reconstructions compared to state-of-the-art methods, especially in the context of bulk motion during the scans.Significance. The proposed unsupervised motion-compensated scheme jointly estimates the latent vectors that capture the motion dynamics, the corresponding deformation maps, and the reconstructed motion-compensated images from the raw k-t space data of each subject. Unlike current motion-resolved strategies, the proposed scheme is more robust to bulk motion events during the scan.

NC-PDNet: A Density-Compensated Unrolled Network for 2D and 3D Non-Cartesian MRI Reconstruction

Deep Learning has become a very promising avenue for magnetic resonance image (MRI) reconstruction. In this work, we explore the potential of unrolled networks for non-Cartesian acquisition settings. We design the NC-PDNet (Non-Cartesian Primal Dual Netwok), the first density-compensated (DCp) unrolled neural network, and validate the need for its key components via an ablation study. Moreover, we conduct some generalizability experiments to test this network in out-of-distribution settings, for example training on knee data and validating on brain data. The results show that NC-PDNet outperforms baseline (U-Net, Deep image prior) models both visually and quantitatively in all settings. In particular, in the 2D multi-coil acquisition scenario, the NC-PDNet provides up to a 1.2 dB improvement in peak signal-to-noise ratio (PSNR) over baseline networks, while also allowing a gain of at least 1dB in PSNR in generalization settings. We provide the open-source implementation of NC-PDNet, and in particular the Non-uniform Fourier Transform in TensorFlow, tested on 2D multi-coil and 3D single-coil k-space data.

Dynamic Imaging Using a Deep Generative SToRM (Gen-SToRM) Model

We introduce a generative smoothness regularization on manifolds (SToRM) model for the recovery of dynamic image data from highly undersampled measurements. The model assumes that the images in the dataset are non-linear mappings of low-dimensional latent vectors. We use the deep convolutional neural network (CNN) to represent the non-linear transformation. The parameters of the generator as well as the low-dimensional latent vectors are jointly estimated only from the undersampled measurements. This approach is different from traditional CNN approaches that require extensive fully sampled training data. We penalize the norm of the gradients of the non-linear mapping to constrain the manifold to be smooth, while temporal gradients of the latent vectors are penalized to obtain a smoothly varying time-series. The proposed scheme brings in the spatial regularization provided by the convolutional network. The main benefit of the proposed scheme is the improvement in image quality and the orders-of-magnitude reduction in memory demand compared to traditional manifold models. To minimize the computational complexity of the algorithm, we introduce an efficient progressive training-in-time approach and an approximate cost function. These approaches speed up the image reconstructions and offers better reconstruction performance.

DEEP GENERATIVE STORM MODEL FOR DYNAMIC IMAGING

We introduce a novel generative smoothness regularization on manifolds (SToRM) model for the recovery of dynamic image data from highly undersampled measurements. The proposed generative framework represents the image time series as a smooth non-linear function of low-dimensional latent vectors that capture the cardiac and respiratory phases. The non-linear function is represented using a deep convolutional neural network (CNN). Unlike the popular CNN approaches that require extensive fully-sampled training data that is not available in this setting, the parameters of the CNN generator as well as the latent vectors are jointly estimated from the undersampled measurements using stochastic gradient descent. We penalize the norm of the gradient of the generator to encourage the learning of a smooth surface/manifold, while temporal gradients of the latent vectors are penalized to encourage the time series to be smooth. The main benefits of the proposed scheme are (a) the quite significant reduction in memory demand compared to the analysis based SToRM model, and (b) the spatial regularization brought in by the CNN model. We also introduce efficient progressive approaches to minimize the computational complexity of the algorithm.