Sampling Density Compensation using Fast Fourier Deconvolution
Rui Luo, Peng Hu, Haikun Qi
TL;DR
This work tackles the slow, iterative computation of density compensation functions (DCFs) in non-Cartesian MRI by introducing a fast, non-iterative approach based on Fast Fourier Deconvolution (FFD). By decomposing the PSF and optimizing a windowed sampling pattern, the method derives an optimal weighted pattern $E^{\star}(\mathbf{k})$ that steers the PSF toward an impulse within the field of view, implemented via $FFD$. Across 2D and 3D trajectories, the proposed method achieves reconstruction-quality metrics comparable to a state-of-the-art iterative baseline while reducing DCF computation time from minutes to around 20 seconds for 3D trajectories. This substantial speedup enables efficient non-Cartesian MRI pipelines and broad practical adoption without sacrificing image fidelity.
Abstract
Density Compensation Function (DCF) is widely used in non-Cartesian MRI reconstruction, either for direct Non-Uniform Fast Fourier Transform (NUFFT) reconstruction or for iterative undersampled reconstruction. Current state-of-the-art methods involve time-consuming tens of iterations, which is one of the main hurdles for widespread application of the highly efficient non-Cartesian MRI. In this paper, we propose an efficient, non-iterative method to calculate DCF for arbitrary non-Cartesian $k$-space trajectories using Fast Fourier Deconvolution. Simulation experiments demonstrate that the proposed method is able to yield DCF for 3D non-Cartesian reconstruction in around 20 seconds, achieving orders of magnitude speed improvement compared to the state-of-the-art method while achieving similar reconstruction quality.
