Accelerating Non-Cartesian MRI Reconstruction Convergence Using k-Space Preconditioning.
Ontology highlight
ABSTRACT:
SUBMITTER: Ong F
PROVIDER: S-EPMC7285911 | biostudies-literature | 2020 May
REPOSITORIES: biostudies-literature
Publications
Accelerating Non-Cartesian MRI Reconstruction Convergence Using k-Space Preconditioning.
Ong Frank F Uecker Martin M Lustig Michael M
IEEE transactions on medical imaging 20191119 5
We propose a k-space preconditioning formulation for accelerating the convergence of iterative Magnetic Resonance Imaging (MRI) reconstructions from non-uniformly sampled k-space data. Existing methods either use sampling density compensations which sacrifice reconstruction accuracy, or circulant preconditioners which increase per-iteration computation. Our approach overcomes both shortcomings. Concretely, we show that viewing the reconstruction problem in the dual formulation allows us to preco ...[more]
Similar Datasets
Project description:PURPOSE:Conventional non-Cartesian compressed sensing requires multiple nonuniform Fourier transforms every iteration, which is computationally expensive. Accordingly, time-consuming reconstructions have slowed the adoption of undersampled 3D non-Cartesian acquisitions into clinical protocols. In this work we investigate several approaches to minimize reconstruction times without sacrificing accuracy. METHODS:The reconstruction problem can be reformatted to exploit the Toeplitz structure of matrices that are evaluated every iteration, but it requires larger oversampling than what is strictly required by nonuniform Fourier transforms. Accordingly, we investigate relative speeds of the two approaches for various nonuniform Fourier transform kernel sizes and oversampling for both GPU and CPU implementations. Second, we introduce a method to minimize matrix sizes by estimating the image support. Finally, density compensation weights have been used as a preconditioning matrix to improve convergence, but this increases noise. We propose a more general approach to preconditioning that allows a trade-off between accuracy and convergence speed. RESULTS:When using a GPU, the Toeplitz approach was faster for all practical parameters. Second, it was found that properly accounting for image support can prevent aliasing errors with minimal impact on reconstruction time. Third, the proposed preconditioning scheme improved convergence rates by an order of magnitude with negligible impact on noise. CONCLUSION:With the proposed methods, 3D non-Cartesian compressed sensing with clinically relevant reconstruction times (<2 min) is feasible using practical computer resources. Magn Reson Med 79:2685-2692, 2018. © 2017 International Society for Magnetic Resonance in Medicine.
| S-EPMC6755916 | biostudies-literature
Project description:PurposeRecently, k-t FASTER (fMRI Accelerated in Space-time by means of Truncation of Effective Rank) was introduced for rank-constrained acceleration of fMRI data acquisition. Here we demonstrate improvements achieved through a hybrid three-dimensional radial-Cartesian sampling approach that allows posthoc selection of acceleration factors, as well as incorporation of coil sensitivity encoding in the reconstruction.MethodsThe multicoil rank-constrained reconstruction used hard thresholding and shrinkage on matrix singular values of the space-time data matrix, using sensitivity encoding and the nonuniform Fast Fourier Transform to enforce data consistency in the multicoil non-Cartesian k-t domain. Variable acceleration factors were made possible using a radial increment based on the golden ratio. Both retrospective and prospectively under-sampled data were used to assess the fidelity of the enhancements to the k-t FASTER technique in resting and task-fMRI data.ResultsThe improved k-t FASTER is capable of tailoring acceleration factors for recovery of different signal components, achieving up to R = 12.5 acceleration in visual-motor task data. The enhancements reduce data matrix reconstruction errors even at much higher acceleration factors when compared directly with the original k-t FASTER approach.ConclusionWe have shown that k-t FASTER can be used to significantly accelerate fMRI data acquisition with little penalty to data quality. Magn Reson Med 76:1825-1836, 2016. © 2016 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.
| S-EPMC4847647 | biostudies-literature
Project description:Magnetic resonance image (MRI) reconstruction from undersampled k-space data requires regularization to reduce noise and aliasing artifacts. Proper application of regularization however requires appropriate selection of associated regularization parameters. In this work, we develop a data-driven regularization parameter adjustment scheme that minimizes an estimate [based on the principle of Stein's unbiased risk estimate (SURE)] of a suitable weighted squared-error measure in k-space. To compute this SURE-type estimate, we propose a Monte-Carlo scheme that extends our previous approach to inverse problems (e.g., MRI reconstruction) involving complex-valued images. Our approach depends only on the output of a given reconstruction algorithm and does not require knowledge of its internal workings, so it is capable of tackling a wide variety of reconstruction algorithms and nonquadratic regularizers including total variation and those based on the l1-norm. Experiments with simulated and real MR data indicate that the proposed approach is capable of providing near mean squared-error optimal regularization parameters for single-coil undersampled non-Cartesian MRI reconstruction.
| S-EPMC3735835 | biostudies-literature
Project description:To propose and validate a respiratory motion resolved, self-gated (SG) 4D-MRI technique to assess patient-specific breathing motion of abdominal organs for radiation treatment planning.The proposed 4D-MRI technique was based on the balanced steady-state free-precession (bSSFP) technique and 3D k-space encoding. A novel rotating cartesian k-space (ROCK) reordering method was designed which incorporates repeatedly sampled k-space centerline as the SG motion surrogate and allows for retrospective k-space data binning into different respiratory positions based on the amplitude of the surrogate. The multiple respiratory-resolved 3D k-space data were subsequently reconstructed using a joint parallel imaging and compressed sensing method with spatial and temporal regularization. The proposed 4D-MRI technique was validated using a custom-made dynamic motion phantom and was tested in six healthy volunteers, in whom quantitative diaphragm and kidney motion measurements based on 4D-MRI images were compared with those based on 2D-CINE images.The 5-minute 4D-MRI scan offers high-quality volumetric images in 1.2 × 1.2 × 1.6 mm3 and eight respiratory positions, with good soft-tissue contrast. In phantom experiments with triangular motion waveform, the motion amplitude measurements based on 4D-MRI were 11.89% smaller than the ground truth, whereas a -12.5% difference was expected due to data binning effects. In healthy volunteers, the difference between the measurements based on 4D-MRI and the ones based on 2D-CINE were 6.2 ± 4.5% for the diaphragm, 8.2 ± 4.9% and 8.9 ± 5.1% for the right and left kidney.The proposed 4D-MRI technique could provide high-resolution, high-quality, respiratory motion-resolved 4D images with good soft-tissue contrast and are free of the "stitching" artifacts usually seen on 4D-CT and 4D-MRI based on resorting 2D-CINE. It could be used to visualize and quantify abdominal organ motion for MRI-based radiation treatment planning.
| S-EPMC5462449 | biostudies-literature
Project description:PurposeSpiral MRI has advantages for cardiac imaging, and multiband (MB) spiral MRI of the heart shows promise. However, current reconstruction methods for MB spiral imaging have limitations. We sought to develop improved reconstruction methods for MB spiral cardiac MRI.MethodsTwo reconstruction methods were developed. The first is non-Cartesian slice-GRAPPA (NCSG), which uses phase demodulation and gridding operations before application of a Cartesian slice-separating kernel. The second method, slice-SPIRiT, formulates the reconstruction as a minimization problem that enforces in-plane coil consistency and consistency with the acquired MB data, and uses through-plane coil sensitivity information in the iterative solution. These methods were compared with conjugate-gradient SENSE in phantoms and volunteers. Temporal alternation of CAIPIRINHA (controlled aliasing in parallel imaging results in higher acceleration) phase and the use of a temporal filter were also investigated.ResultsPhantom experiments with 3 simultaneous slices (MB = 3) showed that mean artifact power was highest for conjugate-gradient SENSE, lower for NCSG, and lowest for slice-SPIRiT. For volunteer cine imaging (MB = 3, N = 5), the artifact power was 0.182 ± 0.037, 0.148 ± 0.036, and 0.139 ± 0.034 for conjugate-gradient SENSE, NCSG, and slice-SPIRiT, respectively (P < .05, analysis of variance). Temporal alternation of CAIPIRINHA reduced artifacts for both NCSG and slice-SPIRiT.ConclusionThe NCSG and slice-SPIRiT methods provide more accurate reconstructions for MB spiral cine imaging compared with conjugate-gradient SENSE. These methods hold promise for non-Cartesian MB imaging.
| S-EPMC7797187 | biostudies-literature
Project description:Highly accelerated real-time cine MRI using compressed sensing (CS) is a promising approach to achieve high spatio-temporal resolution and clinically acceptable image quality in patients with arrhythmia and/or dyspnea. However, its lengthy image reconstruction time may hinder its clinical translation. The purpose of this study was to develop a neural network for reconstruction of non-Cartesian real-time cine MRI k-space data faster (<1 min per slice with 80 frames) than graphics processing unit (GPU)-accelerated CS reconstruction, without significant loss in image quality or accuracy in left ventricular (LV) functional parameters. We introduce a perceptual complex neural network (PCNN) that trains on complex-valued MRI signal and incorporates a perceptual loss term to suppress incoherent image details. This PCNN was trained and tested with multi-slice, multi-phase, cine images from 40 patients (20 for training, 20 for testing), where the zero-filled images were used as input and the corresponding CS reconstructed images were used as practical ground truth. The resulting images were compared using quantitative metrics (structural similarity index (SSIM) and normalized root mean square error (NRMSE)) and visual scores (conspicuity, temporal fidelity, artifacts, and noise scores), individually graded on a five-point scale (1, worst; 3, acceptable; 5, best), and LV ejection fraction (LVEF). The mean processing time per slice with 80 frames for PCNN was 23.7 ± 1.9 s for pre-processing (Step 1, same as CS) and 0.822 ± 0.004 s for dealiasing (Step 2, 166 times faster than CS). Our PCNN produced higher data fidelity metrics (SSIM = 0.88 ± 0.02, NRMSE = 0.014 ± 0.004) compared with CS. While all the visual scores were significantly different (P < 0.05), the median scores were all 4.0 or higher for both CS and PCNN. LVEFs measured from CS and PCNN were strongly correlated (R2 = 0.92) and in good agreement (mean difference = -1.4% [2.3% of mean]; limit of agreement = 10.6% [17.6% of mean]). The proposed PCNN is capable of rapid reconstruction (25 s per slice with 80 frames) of non-Cartesian real-time cine MRI k-space data, without significant loss in image quality or accuracy in LV functional parameters.
| S-EPMC8793037 | biostudies-literature
Project description:PurposeTo propose a novel combined parallel imaging and deep learning-based reconstruction framework for robust reconstruction of highly accelerated 2D cardiac cine MRI data.MethodsWe propose DL-ESPIRiT, an unrolled neural network architecture that utilizes an extended coil sensitivity model to address SENSE-related field-of-view (FOV) limitations in previously proposed deep learning-based reconstruction frameworks. Additionally, we propose a novel neural network design based on (2+1)D spatiotemporal convolutions to produce more accurate dynamic MRI reconstructions than conventional 3D convolutions. The network is trained on fully sampled 2D cardiac cine datasets collected from 11 healthy volunteers with IRB approval. DL-ESPIRiT is compared against a state-of-the-art parallel imaging and compressed sensing method known as l1 -ESPIRiT. The reconstruction accuracy of both methods is evaluated on retrospectively undersampled datasets (R = 12) with respect to standard image quality metrics as well as automatic deep learning-based segmentations of left ventricular volumes. Feasibility of DL-ESPIRiT is demonstrated on two prospectively undersampled datasets acquired in a single heartbeat per slice.ResultsThe (2+1)D DL-ESPIRiT method produces higher fidelity image reconstructions when compared to l1 -ESPIRiT reconstructions with respect to standard image quality metrics (P < .001). As a result of improved image quality, segmentations made from (2+1)D DL-ESPIRiT images are also more accurate than segmentations from l1 -ESPIRiT images.ConclusionsDL-ESPIRiT synergistically combines a robust parallel imaging model and deep learning-based priors to produce high-fidelity reconstructions of retrospectively undersampled 2D cardiac cine data acquired with reduced FOV. Although a proof-of-concept is shown, further experiments are necessary to determine the efficacy of DL-ESPIRiT in prospectively undersampled data.
| S-EPMC7722220 | biostudies-literature
Project description:PURPOSE:To correct gradient timing delays in non-Cartesian MRI while simultaneously recovering corruption-free auto-calibration data for parallel imaging, without additional calibration scans. METHODS:The calibration matrix constructed from multi-channel k-space data should be inherently low-rank. This property is used to construct reconstruction kernels or sensitivity maps. Delays between the gradient hardware across different axes and RF receive chain, which are relatively benign in Cartesian MRI (excluding EPI), lead to trajectory deviations and hence data inconsistencies for non-Cartesian trajectories. These in turn lead to higher rank and corrupted calibration information which hampers the reconstruction. Here, a method named Simultaneous Auto-calibration and Gradient delays Estimation (SAGE) is proposed that estimates the actual k-space trajectory while simultaneously recovering the uncorrupted auto-calibration data. This is done by estimating the gradient delays that result in the lowest rank of the calibration matrix. The Gauss-Newton method is used to solve the non-linear problem. The method is validated in simulations using center-out radial, projection reconstruction and spiral trajectories. Feasibility is demonstrated on phantom and in vivo scans with center-out radial and projection reconstruction trajectories. RESULTS:SAGE is able to estimate gradient timing delays with high accuracy at a signal to noise ratio level as low as 5. The method is able to effectively remove artifacts resulting from gradient timing delays and restore image quality in center-out radial, projection reconstruction, and spiral trajectories. CONCLUSION:The low-rank based method introduced simultaneously estimates gradient timing delays and provides accurate auto-calibration data for improved image quality, without any additional calibration scans.
| S-EPMC6107389 | biostudies-literature
Project description:PurposeTo rapidly reconstruct undersampled 3D non-Cartesian image-based navigators (iNAVs) using an unrolled deep learning (DL) model, enabling nonrigid motion correction in coronary magnetic resonance angiography (CMRA).MethodsAn end-to-end unrolled network is trained to reconstruct beat-to-beat 3D iNAVs acquired during a CMRA sequence. The unrolled model incorporates a nonuniform FFT operator in TensorFlow to perform the data-consistency operation, and the regularization term is learned by a convolutional neural network (CNN) based on the proximal gradient descent algorithm. The training set includes 6,000 3D iNAVs acquired from 7 different subjects and 11 scans using a variable-density (VD) cones trajectory. For testing, 3D iNAVs from 4 additional subjects are reconstructed using the unrolled model. To validate reconstruction accuracy, global and localized motion estimates from DL model-based 3D iNAVs are compared with those extracted from 3D iNAVs reconstructed with l1 -ESPIRiT. Then, the high-resolution coronary MRA images motion corrected with autofocusing using the l1 -ESPIRiT and DL model-based 3D iNAVs are assessed for differences.Results3D iNAVs reconstructed using the DL model-based approach and conventional l1 -ESPIRiT generate similar global and localized motion estimates and provide equivalent coronary image quality. Reconstruction with the unrolled network completes in a fraction of the time compared to CPU and GPU implementations of l1 -ESPIRiT (20× and 3× speed increases, respectively).ConclusionsWe have developed a deep neural network architecture to reconstruct undersampled 3D non-Cartesian VD cones iNAVs. Our approach decreases reconstruction time for 3D iNAVs, while preserving the accuracy of nonrigid motion information offered by them for correction.
| S-EPMC8331070 | biostudies-literature
Project description:PurposeDesign of a preconditioner for fast and efficient parallel imaging (PI) and compressed sensing (CS) reconstructions for Cartesian trajectories.TheoryPI and CS reconstructions become time consuming when the problem size or the number of coils is large, due to the large linear system of equations that has to be solved in ℓ1 and ℓ2 -norm based reconstruction algorithms. Such linear systems can be solved efficiently using effective preconditioning techniques.MethodsIn this article we construct such a preconditioner by approximating the system matrix of the linear system, which comprises the data fidelity and includes total variation and wavelet regularization, by a matrix that is block circulant with circulant blocks. Due to this structure, the preconditioner can be constructed quickly and its inverse can be evaluated fast using only two fast Fourier transformations. We test the performance of the preconditioner for the conjugate gradient method as the linear solver, integrated into the well-established Split Bregman algorithm.ResultsThe designed circulant preconditioner reduces the number of iterations required in the conjugate gradient method by almost a factor of 5. The speed up results in a total acceleration factor of approximately 2.5 for the entire reconstruction algorithm when implemented in MATLAB, while the initialization time of the preconditioner is negligible.ConclusionThe proposed preconditioner reduces the reconstruction time for PI and CS in a Split Bregman implementation without compromising reconstruction stability and can easily handle large systems since it is Fourier-based, allowing for efficient computations.
| S-EPMC6283050 | biostudies-literature