Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
arXiv:2302.00414 · doi:10.3389/fams.2023.1155484
Abstract
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various applications such as MRI, solution of PDEs, etc., are interested in the inverse problem, i.e., computing Fourier coefficients from given nonequispaced data. In this paper we survey different kinds of approaches to tackle this problem. In contrast to iterative procedures, where multiple iteration steps are needed for computing a solution, we focus especially on so-called direct inversion methods. We review density compensation techniques and introduce a new scheme that leads to an exact reconstruction for trigonometric polynomials. In addition, we consider a matrix optimization approach using Frobenius norm minimization to obtain an inverse NFFT.
References in corpus (5)
- Continuous window functions for NFFT
- Edge-adaptive l2 regularization image reconstruction from non-uniform Fourier data
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
- The Discrete Fourier Transform for Golden Angle Linogram Sampling
- Accelerated Variance Based Joint Sparsity Recovery of Images from Fourier Data