PRACTICAL PARALLEL IMAGING COMPRESSED SENSING MRI: SUMMARY OF TWO YEARS OF EXPERIENCE IN ACCELERATING BODY MRI OF PEDIATRIC PATIENTS

A convergence analysis for projected fast iterative soft-thresholding algorithm under radial sampling MRI

Radial sampling is a fast magnetic resonance imaging technique. Further imaging acceleration can be achieved with undersampling but how to reconstruct a clear image with fast algorithm is still challenging. Previous work has shown the advantage of removing undersampling image artifacts using the tight-frame sparse reconstruction model. This model was further solved with a projected fast iterative soft-thresholding algorithm (pFISTA). However, the convergence of this algorithm under radial sampling has not been clearly set up. In this work, the authors derived a theoretical convergence condition for this algorithm. This condition was approximated by estimating the maximal eigenvalue of reconstruction operators through the power iteration. Based on the condition, an optimal step size was further suggested to allow the fastest convergence. Verifications were made on the prospective in vivo data of static brain imaging and dynamic contrast-enhanced liver imaging, demonstrating that the recommended parameter allowed fast convergence in radial MRI.

AI in MRI: Computational Frameworks for a Faster, Optimized, and Automated Imaging Workflow

Over the last decade, artificial intelligence (AI) has made an enormous impact on a wide range of fields, including science, engineering, informatics, finance, and transportation [...].

Calibrationless multi-slice Cartesian MRI via orthogonally alternating phase encoding direction and joint low-rank tensor completion

We propose a multi-slice acquisition with orthogonally alternating phase encoding (PE) direction and subsequent joint calibrationless reconstruction for accelerated multiple individual 2D slices or multi-slice 2D Cartesian MRI. Specifically, multi-slice multi-channel data are first acquired with random or uniform PE undersampling while orthogonally alternating PE direction between adjacent slices. They are then jointly reconstructed through a recently developed low-rank multi-slice Hankel tensor completion (MS-HTC) approach. The proposed acquisition and reconstruction strategy was evaluated with human brain MR data. It effectively suppressed aliasing artifacts even at high acceleration factor, outperforming the existing MS-HTC approach, where PE direction is the same between adjacent slices. More importantly, the new strategy worked robustly with uniform undersampling or random undersampling without any consecutive central k-space lines. In summary, our proposed multi-slice MRI strategy exploits both coil sensitivity and image content similarities across adjacent slices. Orthogonally alternating PE direction among slices substantially facilitates the low-rank completion process and improves image reconstruction quality. This new strategy is applicable to uniform and random PE undersampling. It can be easily implemented in practice for Cartesian parallel imaging of multiple individual 2D slices without any coil sensitivity calibration.

Highly Accelerated Real-Time Free-Breathing Cine CMR for Patients With a Cardiac Implantable Electronic Device

RATIONALE AND OBJECTIVES

To develop a 16-fold accelerated real-time, free-breathing cine cardiovascular magnetic resonance (CMR) pulse sequence with compressed sensing reconstruction and test whether it is capable of producing clinically acceptable summed visual scores (SVS) and accurate left ventricular ejection fraction (LVEF) in patients with a cardiac implantable electronic device (CIED).

MATERIALS AND METHODS

A 16-fold accelerated real-time cine CMR pulse sequence was developed using gradient echo readout, Cartesian k-space sampling, and compressed sensing. We scanned 13 CIED patients (mean age = 59 years; 9/4 males/females) using clinical standard, breath-hold cine and real-time, free-breathing cine. Two clinical readers performed a visual assessment of image quality in four categories (conspicuity of endocardial wall at end diastole, temporal fidelity of wall motion, any artifact level on the heart, noise) using a five-point Likert scale (1: worst; 3: clinically acceptable; 5: best). SVS was calculated as the sum of 4 individual scores, where 12 was defined as clinical acceptable. The Wilcoxon signed-rank test was performed to compare SVS, and the Bland-Altman analysis was conducted to evaluate the agreement of LVEF.

RESULTS

Median scan time was 3.7 times shorter for real-time (3.5 heartbeats per slice) than clinical standard (13 heartbeats per slice, excluding nonscanning time between successive breath-hold acquisitions). Median SVS was not significantly different between clinical standard (15.0) and real-time (14.5). The mean difference in LVEF was -2% (4.7% of mean), and the limits of agreement was 5.8% (13.5% of mean).

CONCLUSION

This study demonstrates that the proposed real-time cine method produces clinically acceptable SVS and relatively accurate LVEF in CIED patients.

Learning a preconditioner to accelerate compressed sensing reconstructions in MRI

Purpose

To learn a preconditioner that accelerates parallel imaging (PI) and compressed sensing (CS) reconstructions.

Methods

A convolutional neural network (CNN) with residual connections was used to train a preconditioning operator. Training and validation data were simulated using 50% brain images and 50% white Gaussian noise images. Each multichannel training example contains a simulated sampling mask, complex coil sensitivity maps, and two regularization parameter maps. The trained model was integrated in the preconditioned conjugate gradient (PCG) method as part of the split Bregman CS method. The acceleration performance was compared with that of a circulant PI‐CS preconditioner for varying undersampling factors, number of coil elements and anatomies.

Results

The learned preconditioner reduces the number of PCG iterations by a factor of 4, yielding a similar acceleration as an efficient circulant preconditioner. The method generalizes well to different sampling schemes, coil configurations and anatomies.

Conclusion

It is possible to learn adaptable preconditioners for PI and CS reconstructions that meet the performance of state‐of‐the‐art preconditioners. Further acceleration could be achieved by optimizing the network architecture and the training set. Such a preconditioner could also be integrated in fully learned reconstruction methods to accelerate the training process of unrolled networks.

Utilizing the Wavelet Transform's Structure in Compressed Sensing

Compressed sensing has empowered quality image reconstruction with fewer data samples than previously thought possible. These techniques rely on a sparsifying linear transformation. The Daubechies wavelet transform is commonly used for this purpose. In this work, we take advantage of the structure of this wavelet transform and identify an affine transformation that increases the sparsity of the result. After inclusion of this affine transformation, we modify the resulting optimization problem to comply with the form of the Basis Pursuit Denoising problem. Finally, we show theoretically that this yields a lower bound on the error of the reconstruction and present results where solving this modified problem yields images of higher quality for the same sampling patterns using both magnetic resonance and optical images.

Accelerating whole-heart 3D T2 mapping: Impact of undersampling strategies and reconstruction techniques

PURPOSE

We aim to determine an advantageous approach for the acceleration of high spatial resolution 3D cardiac T2 relaxometry data by comparing the performance of different undersampling patterns and reconstruction methods over a range of acceleration rates.

METHODS

Multi-volume 3D high-resolution cardiac images were acquired fully and undersampled retrospectively using 1) optimal CAIPIRINHA and 2) a variable density random (VDR) sampling. Data were reconstructed using 1) multi-volume sensitivity encoding (SENSE), 2) joint-sparsity SENSE and 3) model-based SENSE. Four metrics were calculated on 3 naïve swine and 8 normal human subjects over a whole left-ventricular region of interest: root-mean-square error (RMSE) of image signal intensity, RMSE of T2, the bias of mean T2, and standard deviation (SD) of T2. Fully sampled data and volume-by-volume SENSE with standard equally spaced undersampling were used as references. The Jaccard index calculated from one swine with acute myocardial infarction (MI) was used to demonstrate preservation of segmentation of edematous tissues with elevated T2.

RESULTS

In naïve swine and normal human subjects, all methods had similar performance when the net reduction factor (Rnet) <2.5. VDR sampling with model-based SENSE showed the lowest RMSEs (10.5%-14.2%) and SDs (+1.7-2.4 ms) of T2 when Rnet>2.5, while VDR sampling with the joint-sparsity SENSE had the lowest bias of mean T2 (0.0-1.1ms) when Rnet>3. The RMSEs of parametric T2 values (9.2%-24.6%) were larger than for image signal intensities (5.2%-18.4%). In the swine with MI, VDR sampling with either joint-sparsity or model-based SENSE showed consistently higher Jaccard index for all Rnet (0.71-0.50) than volume-by-volume SENSE (0.68-0.30).

CONCLUSIONS

Retrospective exploration of undersampling and reconstruction in 3D whole-heart T2 parametric mapping revealed that maps were more sensitive to undersampling than images, presenting a more stringent limiting factor on Rnet. The combination of VDR sampling patterns with model-based or joint-sparsity SENSE reconstructions were more robust for Rnet>3.

Use of compressed sensing to reduce scan time and breath-holding for cardiac cine balanced steady-state free precession magnetic resonance imaging in children and young adults

BACKGROUND

Conventional pediatric volumetric MRI acquisitions of a short-axis stack typically require multiple breath-holds under anesthesia.

OBJECTIVE

Here, we aimed to validate a vendor-optimized compressed-sensing approach to reduce scan time during short-axis balanced steady-state free precession (bSSFP) cine imaging.

MATERIALS AND METHODS

Imaging was performed in 28 patients (16±9 years) in this study on a commercial 3-tesla (T) scanner using retrospective electrocardiogram-gated cine bSSFP. Cine short-axis images covering both ventricles were acquired with conventional parallel imaging and a vendor-optimized parallel imaging/compressed-sensing approach. Qualitative Likert scoring for blood-myocardial contrast, edge definition, and presence of artifact was performed by two experienced radiologists. Quantitative comparisons were performed including biventricular size and function. A paired t-test was used to detect significant differences (P<0.05).

RESULTS

Scan duration was 7±2 s/slice for conventional imaging (147±33 s total) vs. 4±2 s/slice for compressed sensing (83±28 s total). No significant differences were found with qualitative image scores for blood-myocardial contrast, edge definition, and presence of artifact. No significant differences were found in volumetric analysis between the two sequences. The number of breath-holds was 10±4 for conventional imaging and 5±3 for compressed sensing.

CONCLUSION

Compressed sensing allowed for a 50% reduction in the number of breath-holds and a 43% reduction in the total scan time without differences in the qualitative or quantitative measurements as compared to the conventional technique.

Radial Undersampling-Based Interpolation Scheme for Multislice CSMRI Reconstruction Techniques

Magnetic Resonance Imaging (MRI) is an important yet slow medical imaging modality. Compressed sensing (CS) theory has enabled to accelerate the MRI acquisition process using some nonlinear reconstruction techniques from even 10% of the Nyquist samples. In recent years, interpolated compressed sensing (iCS) has further reduced the scan time, as compared to CS, by exploiting the strong interslice correlation of multislice MRI. In this paper, an improved efficient interpolated compressed sensing (EiCS) technique is proposed using radial undersampling schemes. The proposed efficient interpolation technique uses three consecutive slices to estimate the missing samples of the central target slice from its two neighboring slices. Seven different evaluation metrics are used to analyze the performance of the proposed technique such as structural similarity index measurement (SSIM), feature similarity index measurement (FSIM), mean square error (MSE), peak signal to noise ratio (PSNR), correlation (CORR), sharpness index (SI), and perceptual image quality evaluator (PIQE) and compared with the latest interpolation techniques. The simulation results show that the proposed EiCS technique has improved image quality and performance using both golden angle and uniform angle radial sampling patterns, with an even lower sampling ratio and maximum information content and using a more practical sampling scheme.

Fast variable density Poisson-disc sample generation with directional variation for compressed sensing in MRI

We present a fast method for generating random samples according to a variable density poisson-disc distribution. A minimum parameter value is used to create a background grid array for keeping track of those points that might affect any new candidate point; this reduces the number of conflicts that must be checked before acceptance of a new point, thus reducing the number of computations required. We demonstrate the algorithm's ability to generate variable density poisson-disc sampling patterns according to a parameterized function, including patterns where the variations in density are a function of direction. We further show that these sampling patterns are appropriate for compressed sensing applications. Finally, we present a method to generate patterns with a specific acceleration rate.

Advancing machine learning for MR image reconstruction with an open competition: Overview of the 2019 fastMRI challenge

PURPOSE

To advance research in the field of machine learning for MR image reconstruction with an open challenge.

METHODS

We provided participants with a dataset of raw k-space data from 1,594 consecutive clinical exams of the knee. The goal of the challenge was to reconstruct images from these data. In order to strike a balance between realistic data and a shallow learning curve for those not already familiar with MR image reconstruction, we ran multiple tracks for multi-coil and single-coil data. We performed a two-stage evaluation based on quantitative image metrics followed by evaluation by a panel of radiologists. The challenge ran from June to December of 2019.

RESULTS

We received a total of 33 challenge submissions. All participants chose to submit results from supervised machine learning approaches.

CONCLUSIONS

The challenge led to new developments in machine learning for image reconstruction, provided insight into the current state of the art in the field, and highlighted remaining hurdles for clinical adoption.

A dictionary-based graph-cut algorithm for MRI reconstruction

PURPOSE

Compressive sensing (CS)-based image reconstruction methods have proposed random undersampling schemes that produce incoherent, noise-like aliasing artifacts, which are easier to remove. The denoising process is critically assisted by imposing sparsity-enforcing priors. Sparsity is known to be induced if the prior is in the form of the L_p (0 ≤ p ≤ 1) norm. CS methods generally use a convex relaxation of these priors such as the L₁ norm, which may not exploit the full power of CS. An efficient, discrete optimization formulation is proposed, which works not only on arbitrary L_p -norm priors as some non-convex CS methods do, but also on highly non-convex truncated penalty functions, resulting in a specific type of edge-preserving prior. These advanced features make the minimization problem highly non-convex, and thus call for more sophisticated minimization routines.

THEORY AND METHODS

The work combines edge-preserving priors with random undersampling, and solves the resulting optimization using a set of discrete optimization methods called graph cuts. The resulting optimization problem is solved by applying graph cuts iteratively within a dictionary, defined here as an appropriately constructed set of vectors relevant to brain MRI data used here.

RESULTS

Experimental results with in vivo data are presented.

CONCLUSION

The proposed algorithm produces better results than regularized SENSE or standard CS for reconstruction of in vivo data.

Rapid Imaging: Recent Advances in Abdominal MRI for Reducing Acquisition Time and Its Clinical Applications

Magnetic resonance imaging (MRI) plays an important role in abdominal imaging. The high contrast resolution offered by MRI provides better lesion detection and its capacity to provide multiparametric images facilitates lesion characterization more effectively than computed tomography. However, the relatively long acquisition time of MRI often detrimentally affects the image quality and limits its accessibility. Recent developments have addressed these drawbacks. Specifically, multiphasic acquisition of contrast-enhanced MRI, free-breathing dynamic MRI using compressed sensing technique, simultaneous multi-slice acquisition for diffusion-weighted imaging, and breath-hold three-dimensional magnetic resonance cholangiopancreatography are recent notable advances in this field. This review explores the aforementioned state-of-the-art techniques by focusing on their clinical applications and potential benefits, as well as their likely future direction.

Reconstruction of undersampled 3D non-Cartesian image-based navigators for coronary MRA using an unrolled deep learning model

PURPOSE

To 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).

METHODS

An 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 l 1 -ESPIRiT. Then, the high-resolution coronary MRA images motion corrected with autofocusing using the l 1 -ESPIRiT and DL model-based 3D iNAVs are assessed for differences.

RESULTS

3D iNAVs reconstructed using the DL model-based approach and conventional l 1 -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 l 1 -ESPIRiT (20× and 3× speed increases, respectively).

CONCLUSIONS

We 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.

Comparison of different methods for the estimation of aortic pulse wave velocity from 4D flow cardiovascular magnetic resonance

BACKGROUND

Arterial pulse wave velocity (PWV) is associated with increased mortality in aging and disease. Several studies have shown the accuracy of applanation tonometry carotid-femoral PWV (Cf-PWV) and the relevance of evaluating central aorta stiffness using 2D cardiovascular magnetic resonance (CMR) to estimate PWV, and aortic distensibility-derived PWV through the theoretical Bramwell-Hill model (BH-PWV). Our aim was to compare various methods of aortic PWV (aoPWV) estimation from 4D flow CMR, in terms of associations with age, Cf-PWV, BH-PWV and left ventricular (LV) mass-to-volume ratio while evaluating inter-observer reproducibility and robustness to temporal resolution.

METHODS

We studied 47 healthy subjects (49.5 ± 18 years) who underwent Cf-PWV and CMR including aortic 4D flow CMR as well as 2D cine SSFP for BH-PWV and LV mass-to-volume ratio estimation. The aorta was semi-automatically segmented from 4D flow data, and mean velocity waveforms were estimated in 25 planes perpendicular to the aortic centerline. 4D flow CMR aoPWV was calculated: using velocity curves at two locations, namely ascending aorta (AAo) and distal descending aorta (DAo) aorta (S1, 2D-like strategy), or using all velocity curves along the entire aortic centreline (3D-like strategies) with iterative transit time (TT) estimates (S2) or a plane fitting of velocity curves systolic upslope (S3). For S1 and S2, TT was calculated using three approaches: cross-correlation (TTc), wavelets (TTw) and Fourier transforms (TTf). Intra-class correlation coefficients (ICC) and Bland-Altman biases (BA) were used to evaluate inter-observer reproducibility and effect of lower temporal resolution.

RESULTS

4D flow CMR aoPWV estimates were significantly (p < 0.05) correlated to the CMR-independent Cf-PWV, BH-PWV, age and LV mass-to-volume ratio, with the strongest correlations for the 3D-like strategy using wavelets TT (S2-TTw) (R = 0.62, 0.65, 0.77 and 0.52, respectively, all p < 0.001). S2-TTw was also highly reproducible (ICC = 0.99, BA = 0.09 m/s) and robust to lower temporal resolution (ICC = 0.97, BA = 0.15 m/s).

CONCLUSIONS

Reproducible 4D flow CMR aoPWV estimates can be obtained using full 3D aortic coverage. Such 4D flow CMR stiffness measures were significantly associated with Cf-PWV, BH-PWV, age and LV mass-to-volume ratio, with a slight superiority of the 3D strategy using wavelets transit time (S2-TTw).

ENLIVE: An Efficient Nonlinear Method for Calibrationless and Robust Parallel Imaging

Robustness against data inconsistencies, imaging artifacts and acquisition speed are crucial factors limiting the possible range of applications for magnetic resonance imaging (MRI). Therefore, we report a novel calibrationless parallel imaging technique which simultaneously estimates coil profiles and image content in a relaxed forward model. Our method is robust against a wide class of data inconsistencies, minimizes imaging artifacts and is comparably fast, combining important advantages of many conceptually different state-of-the-art parallel imaging approaches. Depending on the experimental setting, data can be undersampled well below the Nyquist limit. Here, even high acceleration factors yield excellent imaging results while being robust to noise and the occurrence of phase singularities in the image domain, as we show on different data. Moreover, our method successfully reconstructs acquisitions with insufficient field-of-view. We further compare our approach to ESPIRiT and SAKE using spin-echo and gradient echo MRI data from the human head and knee. In addition, we show its applicability to non-Cartesian imaging on radial FLASH cardiac MRI data. Using theoretical considerations, we show that ENLIVE can be related to a low-rank formulation of blind multi-channel deconvolution, explaining why it inherently promotes low-rank solutions.

Sparsity adaptive reconstruction for highly accelerated cardiac MRI

PURPOSE

To enable parameter-free, accelerated cardiovascular magnetic resonance (CMR).

METHODS

Regularized reconstruction methods, such as compressed sensing (CS), can significantly accelerate MRI data acquisition but require tuning of regularization weights. In this work, a technique, called Sparsity adaptive Composite Recovery (SCoRe) that exploits sparsity in multiple, disparate sparsifying transforms is presented. A data-driven adjustment of the relative contributions of different transforms yields a parameter-free CS recovery process. SCoRe is validated in a dynamic digital phantom as well as in retrospectively and prospectively undersampled cine CMR data.

RESULTS

The results from simulation and 6 retrospectively undersampled datasets indicate that SCoRe with auto-tuned regularization weights yields lower root-mean-square error (RMSE) and higher structural similarity index (SSIM) compared to state-of-the-art CS methods. In 45 prospectively undersampled datasets acquired from 15 volunteers, the image quality was scored by 2 expert reviewers, with SCoRe receiving a higher average score (p  <  0.01) compared to other CS methods.

CONCLUSIONS

SCoRe enables accelerated cine CMR from highly undersampled data. In contrast to other acceleration techniques, SCoRe adapts regularization weights based on noise power and level of sparsity in each transform, yielding superior performance without admitting any free parameters.

Accelerating compressed sensing in parallel imaging reconstructions using an efficient circulant preconditioner for cartesian trajectories

PURPOSE

Design of a preconditioner for fast and efficient parallel imaging (PI) and compressed sensing (CS) reconstructions for Cartesian trajectories.

THEORY

PI 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.

METHODS

In 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.

RESULTS

The 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.

CONCLUSION

The 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.

Learning-Based Compressive MRI

In the area of magnetic resonance imaging (MRI), an extensive range of non-linear reconstruction algorithms has been proposed which can be used with general Fourier subsampling patterns. However, the design of these subsampling patterns has typically been considered in isolation from the reconstruction rule and the anatomy under consideration. In this paper, we propose a learning-based framework for optimizing MRI subsampling patterns for a specific reconstruction rule and anatomy, considering both the noiseless and noisy settings. Our learning algorithm has access to a representative set of training signals, and searches for a sampling pattern that performs well on average for the signals in this set. We present a novel parameter-free greedy mask selection method and show it to be effective for a variety of reconstruction rules and performance metrics. Moreover, we also support our numerical findings by providing a rigorous justification of our framework via statistical learning theory.

Highly accelerated intracranial 4D flow MRI: evaluation of healthy volunteers and patients with intracranial aneurysms

OBJECTIVES

To evaluate an accelerated 4D flow MRI method that provides high temporal resolution in a clinically feasible acquisition time for intracranial velocity imaging.

MATERIALS AND METHODS

Accelerated 4D flow MRI was developed by using a pseudo-random variable-density Cartesian undersampling strategy (CIRCUS) with the combination of k-t, parallel imaging and compressed sensing image reconstruction techniques (k-t SPARSE-SENSE). Four-dimensional flow data were acquired on five healthy volunteers and eight patients with intracranial aneurysms using CIRCUS (acceleration factor of R = 4, termed CIRCUS4) and GRAPPA (R = 2, termed GRAPPA2) as the reference method. Images with three times higher temporal resolution (R = 12, CIRCUS12) were also reconstructed from the same acquisition as CIRCUS4. Qualitative and quantitative image assessment was performed on the images acquired with different methods, and complex flow patterns in the aneurysms were identified and compared.

RESULTS

Four-dimensional flow MRI with CIRCUS was achieved in 5 min and allowed further improved temporal resolution of <30 ms. Volunteer studies showed similar qualitative and quantitative evaluation obtained with the proposed approach compared to the reference (overall image scores: GRAPPA2 3.2 ± 0.6; CIRCUS4 3.1 ± 0.7; CIRCUS12 3.3 ± 0.4; difference of the peak velocities: -3.83 ± 7.72 cm/s between CIRCUS4 and GRAPPA2, -1.72 ± 8.41 cm/s between CIRCUS12 and GRAPPA2). In patients with intracranial aneurysms, the higher temporal resolution improved capturing of the flow features in intracranial aneurysms (pathline visualization scores: GRAPPA2 2.2 ± 0.2; CIRCUS4 2.5 ± 0.5; CIRCUS12 2.7 ± 0.6).

CONCLUSION

The proposed rapid 4D flow MRI with a high temporal resolution is a promising tool for evaluating intracranial aneurysms in a clinically feasible acquisition time.

3D hyperpolarized C-13 EPI with calibrationless parallel imaging

With the translation of metabolic MRI with hyperpolarized 13C agents into the clinic, imaging approaches will require large volumetric FOVs to support clinical applications. Parallel imaging techniques will be crucial to increasing volumetric scan coverage while minimizing RF requirements and temporal resolution. Calibrationless parallel imaging approaches are well-suited for this application because they eliminate the need to acquire coil profile maps or auto-calibration data. In this work, we explored the utility of a calibrationless parallel imaging method (SAKE) and corresponding sampling strategies to accelerate and undersample hyperpolarized 13C data using 3D blipped EPI acquisitions and multichannel receive coils, and demonstrated its application in a human study of [1-13C]pyruvate metabolism.

On-the-Fly Adaptive ${k}$ -Space Sampling for Linear MRI Reconstruction Using Moment-Based Spectral Analysis

In high-dimensional magnetic resonance imaging applications, time-consuming, sequential acquisition of data samples in the spatial frequency domain ( -space) can often be accelerated by accounting for dependencies in linear reconstruction, at the cost of noise amplification that depends on the sampling pattern. Common examples are support-constrained, parallel, and dynamic MRI, and -space sampling strategies are primarily driven by image-domain metrics that are expensive to compute for arbitrary sampling patterns. It remains challenging to provide systematic and computationally efficient automatic designs of arbitrary multidimensional Cartesian sampling patterns that mitigate noise amplification, given the subspace to which the object is confined. To address this problem, this paper introduces a theoretical framework that describes local geometric properties of the sampling pattern and relates them to the spread in the eigenvalues of the information matrix described by its first two spectral moments. This new criterion is then used for very efficient optimization of complex multidimensional sampling patterns that does not require reconstructing images or explicitly mapping noise amplification. Experiments with in vivo data show strong agreement between this criterion and traditional, comprehensive image-domain- and -space-based metrics, indicating the potential of the approach for computationally efficient (on-the-fly), automatic, and adaptive design of sampling patterns.

Recent advances in parallel imaging for MRI

Magnetic Resonance Imaging (MRI) is an essential technology in modern medicine. However, one of its main drawbacks is the long scan time needed to localize the MR signal in space to generate an image. This review article summarizes some basic principles and recent developments in parallel imaging, a class of image reconstruction techniques for shortening scan time. First, the fundamentals of MRI data acquisition are covered, including the concepts of k-space, undersampling, and aliasing. It is demonstrated that scan time can be reduced by sampling a smaller number of phase encoding lines in k-space; however, without further processing, the resulting images will be degraded by aliasing artifacts. Nearly all modern clinical scanners acquire data from multiple independent receiver coil arrays. Parallel imaging methods exploit properties of these coil arrays to separate aliased pixels in the image domain or to estimate missing k-space data using knowledge of nearby acquired k-space points. Three parallel imaging methods-SENSE, GRAPPA, and SPIRiT-are described in detail, since they are employed clinically and form the foundation for more advanced methods. These techniques can be extended to non-Cartesian sampling patterns, where the collected k-space points do not fall on a rectangular grid. Non-Cartesian acquisitions have several beneficial properties, the most important being the appearance of incoherent aliasing artifacts. Recent advances in simultaneous multi-slice imaging are presented next, which use parallel imaging to disentangle images of several slices that have been acquired at once. Parallel imaging can also be employed to accelerate 3D MRI, in which a contiguous volume is scanned rather than sequential slices. Another class of phase-constrained parallel imaging methods takes advantage of both image magnitude and phase to achieve better reconstruction performance. Finally, some applications are presented of parallel imaging being used to accelerate MR Spectroscopic Imaging.

Improved Computational Efficiency of Locally Low Rank MRI Reconstruction Using Iterative Random Patch Adjustments

This paper presents and analyzes an alternative formulation of the locally low-rank (LLR) regularization framework for magnetic resonance image (MRI) reconstruction. Generally, LLR-based MRI reconstruction techniques operate by dividing the underlying image into a collection of matrices formed from image patches. Each of these matrices is assumed to have low rank due to the inherent correlations among the data, whether along the coil, temporal, or multi-contrast dimensions. The LLR regularization has been successful for various MRI applications, such as parallel imaging and accelerated quantitative parameter mapping. However, a major limitation of most conventional implementations of the LLR regularization is the use of multiple sets of overlapping patches. Although the use of overlapping patches leads to effective shift-invariance, it also results in high-computational load, which limits the practical utility of the LLR regularization for MRI. To circumvent this problem, alternative LLR-based algorithms instead shift a single set of non-overlapping patches at each iteration, thereby achieving shift-invariance and avoiding block artifacts. A novel contribution of this paper is to provide a mathematical framework and justification of LLR regularization with iterative random patch adjustments (LLR-IRPA). This method is compared with a state-of-the-art LLR regularization algorithm based on overlapping patches, and it is shown experimentally that results are similar but with the advantage of much reduced computational load. We also present theoretical results demonstrating the effective shift invariance of the LLR-IRPA approach, and we show reconstruction examples and comparisons in both retrospectively and prospectively undersampled MRI acquisitions, and in T1 parameter mapping.

Compressed sensing MRI reconstruction from 3D multichannel data using GPUs

PURPOSE

To accelerate iterative reconstructions of compressed sensing (CS) MRI from 3D multichannel data using graphics processing units (GPUs).

METHODS

The sparsity of MRI signals and parallel array receivers can reduce the data acquisition requirements. However, iterative CS reconstructions from data acquired using an array system may take a significantly long time, especially for a large number of parallel channels. This paper presents an efficient method for CS-MRI reconstruction from 3D multichannel data using GPUs. In this method, CS reconstructions were simultaneously processed in a channel-by-channel fashion on the GPU, in which the computations of multiple-channel 3D-CS reconstructions are highly parallelized. The final image was then produced by a sum-of-squares method on the central processing unit. Implementation details including algorithm, data/memory management, and parallelization schemes are reported in the paper.

RESULTS

Both simulated data and in vivo MRI array data were tested. The results showed that the proposed method can significantly improve the image reconstruction efficiency, typically shortening the runtime by a factor of 30.

CONCLUSIONS

Using low-cost GPUs and an efficient algorithm allowed the 3D multislice compressive-sensing reconstruction to be performed in less than 1 s. The rapid reconstructions are expected to help bring high-dimensional, multichannel parallel CS MRI closer to clinical applications. Magn Reson Med 78:2265-2274, 2017. © 2017 International Society for Magnetic Resonance in Medicine.

Accelerated magnetic resonance thermometry in the presence of uncertainties

A model-based information theoretic approach is presented to perform the task of magnetic resonance (MR) thermal image reconstruction from a limited number of observed samples on k-space. The key idea of the proposed approach is to optimally detect samples of k-space that are information-rich with respect to a model of the thermal data acquisition. These highly informative k-space samples can then be used to refine the mathematical model and efficiently reconstruct the image. The information theoretic reconstruction was demonstrated retrospectively in data acquired during MR-guided laser induced thermal therapy (MRgLITT) procedures. The approach demonstrates that locations with high-information content with respect to a model-based reconstruction of MR thermometry may be quantitatively identified. These information-rich k-space locations are demonstrated to be useful as a guide for k-space undersampling techniques. The effect of interactively increasing the predicted number of data points used in the subsampled model-based reconstruction was quantified using the L2-norm of the distance between the subsampled and fully sampled reconstruction. Performance of the proposed approach was also compared with uniform rectilinear subsampling and variable-density Poisson disk subsampling techniques. The proposed subsampling scheme resulted in accurate reconstructions using a small fraction of k-space points, suggesting that the reconstruction technique may be useful in improving the efficiency of thermometry data temporal resolution.

Compressed sensing for body MRI

The introduction of compressed sensing for increasing imaging speed in magnetic resonance imaging (MRI) has raised significant interest among researchers and clinicians, and has initiated a large body of research across multiple clinical applications over the last decade. Compressed sensing aims to reconstruct unaliased images from fewer measurements than are traditionally required in MRI by exploiting image compressibility or sparsity. Moreover, appropriate combinations of compressed sensing with previously introduced fast imaging approaches, such as parallel imaging, have demonstrated further improved performance. The advent of compressed sensing marks the prelude to a new era of rapid MRI, where the focus of data acquisition has changed from sampling based on the nominal number of voxels and/or frames to sampling based on the desired information content. This article presents a brief overview of the application of compressed sensing techniques in body MRI, where imaging speed is crucial due to the presence of respiratory motion along with stringent constraints on spatial and temporal resolution. The first section provides an overview of the basic compressed sensing methodology, including the notion of sparsity, incoherence, and nonlinear reconstruction. The second section reviews state-of-the-art compressed sensing techniques that have been demonstrated for various clinical body MRI applications. In the final section, the article discusses current challenges and future opportunities.

LEVEL OF EVIDENCE

5 J. Magn. Reson. Imaging 2017;45:966-987.

Seven-Tesla MRI and neuroimaging biomarkers for Alzheimer's disease

The goal of this paper was to review the effectiveness of using 7-T MRI to study neuroimaging biomarkers for Alzheimer's disease (AD). The authors reviewed the literature for articles published to date on the use of 7-T MRI to study AD. Thus far, there are 3 neuroimaging biomarkers for AD that have been studied using 7-T MRI in AD tissue: 1) neuroanatomical atrophy; 2) molecular characterization of hypointensities; and 3) microinfarcts. Seven-Tesla MRI has had mixed results when used to study the 3 aforementioned neuroimaging biomarkers for AD. First, in the detection of neuroanatomical atrophy, 7-T MRI has exciting potential. Historically, noninvasive imaging of neuroanatomical atrophy during AD has been limited by suboptimal resolution. However, now there is compelling evidence that the high resolution of 7-T MRI may help overcome this hurdle. Second, in detecting the characterization of hypointensities, 7-T MRI has had varied success. PET scans will most likely continue to lead in the noninvasive imaging of amyloid plaques; however, there is emerging evidence that 7-T MRI can accurately detect iron deposits within activated microglia, which may help shed light on the role of the immune system in AD pathogenesis. Finally, in the detection of microinfarcts, 7-T MRI may also play a promising role, which may help further elucidate the relationship between cerebrovascular health and AD progression.

Projected Iterative Soft-Thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging

Compressed sensing (CS) has exhibited great potential for accelerating magnetic resonance imaging (MRI). In CS-MRI, we want to reconstruct a high-quality image from very few samples in a short time. In this paper, we propose a fast algorithm, called projected iterative soft-thresholding algorithm (pISTA), and its acceleration pFISTA for CS-MRI image reconstruction. The proposed algorithms exploit sparsity of the magnetic resonance (MR) images under the redundant representation of tight frames. We prove that pISTA and pFISTA converge to a minimizer of a convex function with a balanced tight frame sparsity formulation. The pFISTA introduces only one adjustable parameter, the step size, and we provide an explicit rule to set this parameter. Numerical experiment results demonstrate that pFISTA leads to faster convergence speeds than the state-of-art counterpart does, while achieving comparable reconstruction errors. Moreover, reconstruction errors incurred by pFISTA appear insensitive to the step size.

Accelerated MRI of the fetal heart using compressed sensing and metric optimized gating

PURPOSE

To develop and validate a method for accelerated time-resolved imaging of the fetal heart using a combination of compressed sensing (CS) and metric optimized gating (MOG).

THEORY AND METHODS

Joint optimization of CS and MOG reconstructions was used to suppress competing artifact from random undersampling and ungated cardiac motion. Retrospectively and prospectively undersampled adult and fetal data were used to validate the proposed reconstruction algorithm qualitatively based on visual assessment, and quantitatively based on reconstruction error, blur, and MOG timing error.

RESULTS

Excellent agreement was observed between the fully sampled and retrospectively undersampled reconstructions, up to an undersampling factor of four. Visually, differences between ECG and MOG reconstructions of adult data were negligible. This was consistent with quantitative comparisons of reconstruction error (RMSE_ECG  = 0.07-0.13; RMSE_MOG  = 0.08-0.13), and image blur (B_ECG  = 1.03-1.20; B_MOG  = 1.03-1.20). The calculated MOG timing error (2-42 ms) was comparable to the acquired temporal resolution (∼60 ms). Quantitative evaluation of retrospectively undersampled (R = 2-8) fetal data (RMSE_MOG  = 0.06-0.12; B_MOG  = 1.04-1.27) was comparable to the adult volunteer results.

CONCLUSION

CS-MOG for dynamic imaging of the fetal heart was developed and validated. Using CS-MOG, images were obtained up to four times faster than conventional acquisitions. Magn Reson Med 77:2125-2135, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

3D Cartesian MRI with compressed sensing and variable view sharing using complementary poisson-disc sampling

PURPOSE

To enable robust, high spatio-temporal-resolution three-dimensional Cartesian MRI using a scheme incorporating a novel variable density random k-space sampling trajectory allowing flexible and retrospective selection of the temporal footprint with compressed sensing (CS).

METHODS

A complementary Poisson-disc k-space sampling trajectory was designed to allow view sharing and varying combinations of reduced view sharing with CS from the same prospective acquisition. These schemes were used for two-point Dixon-based dynamic contrast-enhanced MRI (DCE-MRI) of the breast and abdomen. Results were validated in vivo with a novel approach using variable-flip-angle data, which was retrospectively accelerated using the same methods but offered a ground truth.

RESULTS

In breast DCE-MRI, the temporal footprint could be reduced 2.3-fold retrospectively without introducing noticeable artifacts, improving depiction of rapidly enhancing lesions. Further, experiments with variable-flip-angle data showed that reducing view sharing improved accuracy in reconstruction and T₁ mapping. In abdominal MRI, 2.3-fold and 3.6-fold reductions in temporal footprint allowed reduced motion artifacts.

CONCLUSION

The complementary-Poisson-disc k-space sampling trajectory allowed a retrospective spatiotemporal resolution tradeoff using CS and view sharing, imparting robustness to motion and contrast enhancement. The technique was also validated using a novel approach of fully acquired variable-flip-angle acquisition. Magn Reson Med 77:1774-1785, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

Development and testing of hyperpolarized (13)C MR calibrationless parallel imaging

A calibrationless parallel imaging technique developed previously for (1)H MRI was modified and tested for hyperpolarized (13)C MRI for applications requiring large FOV and high spatial resolution. The technique was demonstrated with both retrospective and prospective under-sampled data acquired in phantom and in vivo rat studies. A 2-fold acceleration was achieved using a 2D symmetric EPI readout equipped with random blips on the phase encode dimension. Reconstructed images showed excellent qualitative agreement with fully sampled data. Further acceleration can be achieved using acquisition schemes that incorporate multi-dimensional under-sampling.

Improved quantification and mapping of anomalous pulmonary venous flow with four-dimensional phase-contrast MRI and interactive streamline rendering

BACKGROUND

Cardiac MRI is routinely performed for quantification of shunt flow in patients with anomalous pulmonary veins, but can be technically-challenging to perform. Four-dimensional phase-contrast (4D-PC) MRI has potential to simplify this exam. We sought to determine whether 4D-PC may be a viable clinical alternative to conventional 2D phase-contrast MR imaging.

METHODS

With institutional review board approval and HIPAA-compliance, we retrospectively identified all patients with anomalous pulmonary veins who underwent cardiac MRI at either 1.5 Tesla (T) or 3T with parallel-imaging compressed-sensing (PI-CS) 4D-PC between April, 2011 and October, 2013. A total of 15 exams were included (10 male, 5 female). Algorithms for interactive streamline visualization were developed and integrated into in-house software. Blood flow was measured at the valves, pulmonary arteries and veins, cavae, and any associated shunts. Pulmonary veins were mapped to their receiving atrial chamber with streamlines. The intraobserver, interobserver, internal consistency of flow measurements, and consistency with conventional MRI were then evaluated with Pearson correlation and Bland-Altman analysis.

RESULTS

Triplicate measurements of blood flow from 4D-PC were highly consistent, particularly at the aortic and pulmonary valves (cv 2-3%). Flow measurements were reproducible by a second observer (ρ = 0.986-0.999). Direct measurements of shunt volume from anomalous veins and intracardiac shunts matched indirect estimates from the outflow valves (ρ = 0.966). Measurements of shunt fraction using 4D-PC using any approach were more consistent with ventricular volumetric displacements than conventional 2D-PC (ρ = 0.972-0.991 versus 0.929).

CONCLUSION

Shunt flow may be reliably quantified with 4D-PC MRI, either indirectly or with detailed delineation of flow from multiple shunts. The 4D-PC may be a more accurate alternative to conventional MRI.

ESPIRiT--an eigenvalue approach to autocalibrating parallel MRI: where SENSE meets GRAPPA

PURPOSE

Parallel imaging allows the reconstruction of images from undersampled multicoil data. The two main approaches are: SENSE, which explicitly uses coil sensitivities, and GRAPPA, which makes use of learned correlations in k-space. The purpose of this work is to clarify their relationship and to develop and evaluate an improved algorithm.

THEORY AND METHODS

A theoretical analysis shows: (1) The correlations in k-space are encoded in the null space of a calibration matrix. (2) Both approaches restrict the solution to a subspace spanned by the sensitivities. (3) The sensitivities appear as the main eigenvector of a reconstruction operator computed from the null space. The basic assumptions and the quality of the sensitivity maps are evaluated in experimental examples. The appearance of additional eigenvectors motivates an extended SENSE reconstruction with multiple maps, which is compared to existing methods.

RESULTS

The existence of a null space and the high quality of the extracted sensitivities are confirmed. The extended reconstruction combines all advantages of SENSE with robustness to certain errors similar to GRAPPA.

CONCLUSION

In this article the gap between both approaches is finally bridged. A new autocalibration technique combines the benefits of both.

Correlated spectroscopic imaging of calf muscle in three spatial dimensions using group sparse reconstruction of undersampled single and multichannel data

PURPOSE

To implement a 5D (three spatial + two spectral) correlated spectroscopic imaging sequence for application to human calf.

THEORY AND METHODS

Nonuniform sampling was applied across the two phase encoded dimensions and the indirect spectral dimension of an echo planar-correlated spectroscopic imaging sequence. Reconstruction was applied that minimized the group sparse mixed ℓ2,1-norm of the data. Multichannel data were compressed using a sensitivity map-based approach with a spatially dependent transform matrix and utilized the self-sparsity of the individual coil images to simplify the reconstruction.

RESULTS

Single channel data with 8× and 16× undersampling are shown in the calf of a diabetic patient. A 15-channel scan with 12× undersampling of a healthy volunteer was reconstructed using 5 virtual channels and compared to a fully sampled single slice scan. Group sparse reconstruction faithfully reconstructs the lipid cross peaks much better than ℓ1 minimization.

CONCLUSION

COSY spectra can be acquired over a 3D spatial volume with scan time under 15 min using echo planar readout with highly undersampled data and group sparse reconstruction.

Accelerated T1ρ acquisition for knee cartilage quantification using compressed sensing and data-driven parallel imaging: A feasibility study

PURPOSE

Quantitative T1ρ imaging is beneficial for early detection for osteoarthritis but has seen limited clinical use due to long scan times. In this study, we evaluated the feasibility of accelerated T1ρ mapping for knee cartilage quantification using a combination of compressed sensing (CS) and data-driven parallel imaging (ARC-Autocalibrating Reconstruction for Cartesian sampling).

METHODS

A sequential combination of ARC and CS, both during data acquisition and reconstruction, was used to accelerate the acquisition of T1ρ maps. Phantom, ex vivo (porcine knee), and in vivo (human knee) imaging was performed on a GE 3T MR750 scanner. T1ρ quantification after CS-accelerated acquisition was compared with non CS-accelerated acquisition for various cartilage compartments.

RESULTS

Accelerating image acquisition using CS did not introduce major deviations in quantification. The coefficient of variation for the root mean squared error increased with increasing acceleration, but for in vivo measurements, it stayed under 5% for a net acceleration factor up to 2, where the acquisition was 25% faster than the reference (only ARC).

CONCLUSION

To the best of our knowledge, this is the first implementation of CS for in vivo T1ρ quantification. These early results show that this technique holds great promise in making quantitative imaging techniques more accessible for clinical applications.

Accelerated whole-brain multi-parameter mapping using blind compressed sensing

PURPOSE

To introduce a blind compressed sensing (BCS) framework to accelerate multi-parameter MR mapping, and demonstrate its feasibility in high-resolution, whole-brain T1ρ and T2 mapping.

METHODS

BCS models the evolution of magnetization at every pixel as a sparse linear combination of bases in a dictionary. Unlike compressed sensing, the dictionary and the sparse coefficients are jointly estimated from undersampled data. Large number of non-orthogonal bases in BCS accounts for more complex signals than low rank representations. The low degree of freedom of BCS, attributed to sparse coefficients, translates to fewer artifacts at high acceleration factors (R).

RESULTS

From 2D retrospective undersampling experiments, the mean square errors in T1ρ and T2 maps were observed to be within 0.1% up to R = 10. BCS was observed to be more robust to patient-specific motion as compared to other compressed sensing schemes and resulted in minimal degradation of parameter maps in the presence of motion. Our results suggested that BCS can provide an acceleration factor of 8 in prospective 3D imaging with reasonable reconstructions.

CONCLUSION

BCS considerably reduces scan time for multiparameter mapping of the whole brain with minimal artifacts, and is more robust to motion-induced signal changes compared to current compressed sensing and principal component analysis-based techniques.

Parallel Magnetic Resonance Imaging as Approximation in a Reproducing Kernel Hilbert Space

In Magnetic Resonance Imaging (MRI) data samples are collected in the spatial frequency domain (k-space), typically by time-consuming line-by-line scanning on a Cartesian grid. Scans can be accelerated by simultaneous acquisition of data using multiple receivers (parallel imaging), and by using more efficient non-Cartesian sampling schemes. To understand and design k-space sampling patterns, a theoretical framework is needed to analyze how well arbitrary sampling patterns reconstruct unsampled k-space using receive coil information. As shown here, reconstruction from samples at arbitrary locations can be understood as approximation of vector-valued functions from the acquired samples and formulated using a Reproducing Kernel Hilbert Space (RKHS) with a matrix-valued kernel defined by the spatial sensitivities of the receive coils. This establishes a formal connection between approximation theory and parallel imaging. Theoretical tools from approximation theory can then be used to understand reconstruction in k-space and to extend the analysis of the effects of samples selection beyond the traditional image-domain g-factor noise analysis to both noise amplification and approximation errors in k-space. This is demonstrated with numerical examples.

STEP: Self-supporting tailored k-space estimation for parallel imaging reconstruction

PURPOSE

A new subspace-based iterative reconstruction method, termed Self-supporting Tailored k-space Estimation for Parallel imaging reconstruction (STEP), is presented and evaluated in comparison to the existing autocalibrating method SPIRiT and calibrationless method SAKE.

THEORY AND METHODS

In STEP, two tailored schemes including k-space partition and basis selection are proposed to promote spatially variant signal subspace and incorporated into a self-supporting structured low rank model to enforce properties of locality, sparsity, and rank deficiency, which can be formulated into a constrained optimization problem and solved by an iterative algorithm. Simulated and in vivo datasets were used to investigate the performance of STEP in terms of overall image quality and detail structure preservation.

RESULTS

The advantage of STEP on image quality is demonstrated by retrospectively undersampled multichannel Cartesian data with various patterns. Compared with SPIRiT and SAKE, STEP can provide more accurate reconstruction images with less residual aliasing artifacts and reduced noise amplification in simulation and in vivo experiments. In addition, STEP has the capability of combining compressed sensing with arbitrary sampling trajectory.

CONCLUSION

Using k-space partition and basis selection can further improve the performance of parallel imaging reconstruction with or without calibration signals.

Variable density incoherent spatiotemporal acquisition (VISTA) for highly accelerated cardiac MRI

PURPOSE

For the application of compressive sensing to parallel MRI, Poisson disk sampling (PDS) has been shown to generate superior results compared with random sampling methods. However, due to its limited flexibility to incorporate additional constraints, PDS is not readily extendible to dynamic applications. Here, we propose and validate a pseudo-random sampling technique that allows incorporating constraints specific to dynamic imaging.

METHODS

The proposed sampling scheme, called variable density incoherent spatiotemporal acquisition (VISTA), is based on constrained minimization of Riesz energy on a spatiotemporal grid. Data from both a digital phantom and real-time cine were used to compare VISTA with uniform interleaved sampling (UIS) and variable density random sampling (VRS). The image quality was assessed qualitatively and quantitatively.

RESULTS

VISTA improved the trade-off between noise and sharpness. Also, VISTA produced diagnostic quality images at an acceleration rate of 15, whereas UIS and VRS images degraded below the diagnostic threshold at lower acceleration rates.

CONCLUSIONS

VISTA generates spatiotemporal sampling patterns with high levels of uniformity and incoherence, while maintaining a constant temporal resolution. Using a small pilot study, VISTA was shown to produce diagnostic quality images at acceleration rates up to 15.

A unified Bayesian hierarchical model for MRI tissue classification

Various works have used magnetic resonance imaging (MRI) tissue classification extensively to study a number of neurological and psychiatric disorders. Various noise characteristics and other artifacts make this classification a challenging task. Instead of splitting the procedure into different steps, we extend a previous work to develop a unified Bayesian hierarchical model, which addresses both the partial volume effect and intensity non-uniformity, the two major acquisition artifacts, simultaneously. We adopted a normal mixture model with the means and variances depending on the tissue types of voxels to model the observed intensity values. We modeled the relationship among the components of the index vector of tissue types by a hidden Markov model, which captures the spatial similarity of voxels. Furthermore, we addressed the partial volume effect by construction of a higher resolution image in which each voxel is divided into subvoxels. Finally, We achieved the bias field correction by using a Gaussian Markov random field model with a band precision matrix designed in light of image filtering. Sparse matrix methods and parallel computations based on conditional independence are exploited to improve the speed of the Markov chain Monte Carlo simulation. The unified model provides more accurate tissue classification results for both simulated and real data sets.

Highly accelerated aortic 4D flow MR imaging with variable-density random undersampling

PURPOSE

To investigate an effective time-resolved variable-density random undersampling scheme combined with an efficient parallel image reconstruction method for highly accelerated aortic 4D flow MR imaging with high reconstruction accuracy.

MATERIALS AND METHODS

Variable-density Poisson-disk sampling (vPDS) was applied in both the phase-slice encoding plane and the temporal domain to accelerate the time-resolved 3D Cartesian acquisition of flow imaging. In order to generate an improved initial solution for the iterative self-consistent parallel imaging method (SPIRiT), a sample-selective view sharing reconstruction for time-resolved random undersampling (STIRRUP) was introduced. The performance of different undersampling and image reconstruction schemes were evaluated by retrospectively applying those to fully sampled data sets obtained from three healthy subjects and a flow phantom.

RESULTS

Undersampling pattern based on the combination of time-resolved vPDS, the temporal sharing scheme STIRRUP, and parallel imaging SPIRiT, were able to achieve 6-fold accelerated 4D flow MRI with high accuracy using a small number of coils (N=5). The normalized root mean square error between aorta flow waveforms obtained with the acceleration method and the fully sampled data in three healthy subjects was 0.04±0.02, and the difference in peak-systolic mean velocity was -0.29±2.56cm/s.

CONCLUSION

Qualitative and quantitative evaluation of our preliminary results demonstrate that time-resolved variable-density random sampling is efficient for highly accelerating 4D flow imaging while maintaining image reconstruction accuracy.

Parallel imaging and compressed sensing combined framework for accelerating high-resolution diffusion tensor imaging using inter-image correlation

PURPOSE

Increasing acquisition efficiency is always a challenge in high-resolution diffusion tensor imaging (DTI), which has low signal-to-noise ratio and is sensitive to reconstruction artifacts. In this study, a parallel imaging (PI) and compressed sensing (CS) combined framework is proposed, which features motion error correction, PI calibration, and sparsity model using inter-image correlation tailored for high-resolution DTI.

THEORY AND METHODS

The proposed method, named anisotropic sparsity SPIRiT, consists of three steps: (i) motion-induced phase error estimation, (ii) initial CS reconstruction and PI kernel calibration, and (iii) final reconstruction combining PI and CS. Inter-image correlation of diffusion-weighted images are used through anisotropic signals for improved sparsity. A specific implementation based on multishot variable density spiral DTI is used to demonstrate the method.

RESULTS

The proposed reconstruction method was compared with CG-SENSE, CS-based joint reconstruction, and PI and CS combined methods with L1 and joint sparsity regularization, in brain DTI experiments at acceleration factors of 3 to 5. Both qualitative and quantitative results demonstrated that the proposed method resulted in better preserved image quality and more accurate DTI parameters than other methods.

CONCLUSION

The proposed method can accelerate high-resolution DTI acquisition effectively by using the sharable information among different diffusion encoding directions.

Distributed MRI reconstruction using Gadgetron-based cloud computing

PURPOSE

To expand the open source Gadgetron reconstruction framework to support distributed computing and to demonstrate that a multinode version of the Gadgetron can be used to provide nonlinear reconstruction with clinically acceptable latency.

METHODS

The Gadgetron framework was extended with new software components that enable an arbitrary number of Gadgetron instances to collaborate on a reconstruction task. This cloud-enabled version of the Gadgetron was deployed on three different distributed computing platforms ranging from a heterogeneous collection of commodity computers to the commercial Amazon Elastic Compute Cloud. The Gadgetron cloud was used to provide nonlinear, compressed sensing reconstruction on a clinical scanner with low reconstruction latency (eg, cardiac and neuroimaging applications).

RESULTS

The proposed setup was able to handle acquisition and 11 -SPIRiT reconstruction of nine high temporal resolution real-time, cardiac short axis cine acquisitions, covering the ventricles for functional evaluation, in under 1 min. A three-dimensional high-resolution brain acquisition with 1 mm(3) isotropic pixel size was acquired and reconstructed with nonlinear reconstruction in less than 5 min.

CONCLUSION

A distributed computing enabled Gadgetron provides a scalable way to improve reconstruction performance using commodity cluster computing. Nonlinear, compressed sensing reconstruction can be deployed clinically with low image reconstruction latency.

Accelerated MRI with CIRcular Cartesian UnderSampling (CIRCUS): a variable density Cartesian sampling strategy for compressed sensing and parallel imaging

PURPOSE

This study proposes and evaluates a novel method for generating efficient undersampling patterns for 3D Cartesian acquisition with compressed sensing (CS) and parallel imaging (PI).

METHODS

Image quality achieved with schemes that accelerate data acquisition, including CS and PI, are sensitive to the design of the specific undersampling scheme used. Ideally random sampling is required to recover MR images from undersampled data with CS. In practice, pseudo-random sampling schemes are usually applied. Radial or spiral sampling either for Cartesian or non-Cartesian acquisitions has been using because of its favorable features such as interleaving flexibility. In this study, we propose to undersample data on the ky-kz plane of the 3D Cartesian acquisition by circularly selecting sampling points in a way that maintains the features of both random and radial or spiral sampling.

RESULTS

The proposed sampling scheme is shown to outperform conventional random and radial or spiral samplings for 3D Cartesian acquisition and is found to be comparable to advanced variable-density Poisson-Disk sampling (vPDS) while retaining interleaving flexibility for dynamic imaging, based on the results with retrospective undersampling. Our preliminary results with the prospective implementation of the proposed undersampling strategy demonstrated its favorable features.

CONCLUSIONS

The proposed undersampling patterns for 3D Cartesian acquisition possess the desirable properties of randomization and radial or spiral trajectories. It provides easy implementation, flexible sampling, and high accuracy of image reconstruction with CS and PI.

Robust 4D flow denoising using divergence-free wavelet transform

PURPOSE

To investigate four-dimensional flow denoising using the divergence-free wavelet (DFW) transform and compare its performance with existing techniques.

THEORY AND METHODS

DFW is a vector-wavelet that provides a sparse representation of flow in a generally divergence-free field and can be used to enforce "soft" divergence-free conditions when discretization and partial voluming result in numerical nondivergence-free components. Efficient denoising is achieved by appropriate shrinkage of divergence-free wavelet and nondivergence-free coefficients. SureShrink and cycle spinning are investigated to further improve denoising performance.

RESULTS

DFW denoising was compared with existing methods on simulated and phantom data and was shown to yield better noise reduction overall while being robust to segmentation errors. The processing was applied to in vivo data and was demonstrated to improve visualization while preserving quantifications of flow data.

CONCLUSION

DFW denoising of four-dimensional flow data was shown to reduce noise levels in flow data both quantitatively and visually.

Inlet and outlet valve flow and regurgitant volume may be directly and reliably quantified with accelerated, volumetric phase-contrast MRI

PURPOSE

To determine whether it is feasible to use solely an accelerated 4D phase-contrast magnetic resonance imaging (4D-PC MRI) acquisition to quantify net and regurgitant flow volume through each of the cardiac valves.

MATERIALS AND METHODS

Accelerated, 4D-PC MRI examinations performed between March 2010 through June 2011 as part of routine MRI examinations for congenital, structural heart disease were retrospectively reviewed and analyzed using valve-tracking visualization and quantification algorithms developed in Java and OpenGL. Excluding patients with transposition or single ventricle physiology, a total of 34 consecutive pediatric patients (19 male, 15 female; mean age 6.9 years; age range 10 months to 15 years) were identified. 4D-PC flow measurements were compared at each valve and against routine measurements from conventional cardiac MRI using Bland-Altman and Pearson correlation analysis.

RESULTS

Inlet and outlet valve net flow were highly correlated between all valves (P = 0.940-0.985). The sum of forward flow at the outlet valve and regurgitant flow at the inlet valve were consistent with volumetric displacements in each ventricle (P = 0.939-0.948). These were also highly consistent with conventional planar MRI measurements with net flow (P = 0.923-0.935) and regurgitant fractions (P = 0.917-0.972) at the outlet valve and ventricular volumes (P = 0.925-0.965).

CONCLUSION

It is possible to obtain consistent measurements of net and regurgitant blood flow across the inlet and outlet valves relying solely on accelerated 4D-PC. This may facilitate more efficient clinical quantification of valvular regurgitation.