Abstract
Parallel imaging techniques such as SENSE are essential for accelerating MRI acquisitions. A critical metric in these techniques is the g-factor, which quantifies noise amplification resulting from undersampling. While analytical calculation of g-factors is straightforward for uniform undersampling, it becomes computationally infeasible for arbitrary trajectories in high dimensions, such as those used in compressed sensing. This work introduces an efficient Monte-Carlo (MC) method for calculating g-factors in Conjugate Gradient SENSE (CG-SENSE) and applies it to analyze random Cartesian undersampling.
Introduction
Parallel imaging (PI) accelerates MRI by skipping k-space data points, using spatial information from multiple receiver coils to reconstruct the full image. However, this process inherently amplifies noise, a phenomenon characterized by the geometry factor, or g-factor. For standard SENSE with uniform undersampling, g-factors are easily computed. In contrast, modern 3D imaging often employs random undersampling trajectories to facilitate compressed sensing. For these complex trajectories, calculating g-factors analytically requires inverting a massive system matrix ($E^*E$), which is computationally prohibitive for high-resolution volumes. Consequently, researchers often lack precise knowledge of the noise characteristics introduced by their sampling patterns.
Methods
To overcome the computational bottleneck of matrix inversion, we utilized a Monte-Carlo (MC) approach. The method involves:
- Noise Simulation: Adding multiple instances of synthetic white noise to the system model.
- Reconstruction: Processing these noise-only datasets through a CG-SENSE reconstruction algorithm.
- Statistical Estimation: Calculating the standard deviation of the reconstructed noise images across multiple simulations to empirically determine the g-factor at each voxel.
Efficiency was improved by calculating only the diagonal elements of the noise covariance matrix. The method was first validated against an analytical solution in a 2D numerical simulation to determine the necessary number of MC iterations for convergence. Subsequently, it was applied to 3D whole-heart imaging (1.3 mm isotropic resolution) using a 32-channel coil array, comparing 4-fold uniform and random undersampling.
Results and Discussion
Validation results demonstrated that the MC method accurately approximates the analytical g-factor. Convergence was observed to occur at approximately 50 simulations, making the approach computationally practical for high-dimensional data.
In the 3D whole-heart experiments, a significant difference was observed between uniform and random undersampling. While uniform SENSE produces localized noise "folding" artifacts, random undersampling results in a more homogeneous noise distribution. Furthermore, the g-factor in random undersampling exhibited "semi-convergence," where the noise amplification level depends on the number of iterations in the CG-SENSE algorithm.
Quantitatively, random undersampling yielded lower g-factors at high acceleration rates compared to traditional uniform patterns. For instance, near the ascending aorta, the random undersampling g-factor was lower in early iterations than the convergent g-factor of uniform SENSE, suggesting superior noise performance for practical reconstruction settings.
Conclusion
The proposed Monte-Carlo method provides an efficient and accurate means of calculating g-factors for complex, high-dimensional MRI trajectories. Our findings suggest that random undersampling offers distinct advantages in 3D parallel imaging by providing more uniform noise amplification and potentially lower overall noise levels at high acceleration factors. This tool enables the optimization of sampling patterns for advanced cardiac MRI applications.
Summary updated