Nonuniform fast Fourier transforms using min-max interpolation

By Jeffrey A. Fessler, Bradley P. Sutton. IEEE Transactions on Signal Processing, 2003

1,345 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition, Electrical and Electronic Engineering, Signal Processing

View Paper: https://www.semanticscholar.org/paper/d372abe997c24a58c29d13bdfbb1c92a3ba1eb72

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

In Electrical and Electronic Engineering

In Signal Processing

Citations in the corpus

Fast, iterative image reconstruction for MRI in the presence of field inhomogeneities (2003, methodology): “In the simulation and human studies, the NUFFT was used with the following parameters: two times oversampling, a neighborhood size of 5 5, and an optimized Kaiser-Bessel window and scaling factors [18].”
Low-rank and Sparse Matrix Decomposition for Accelerated Dynamic MRI with Separation of Background and Dynamic Components (2014, methodology): “The multicoil encoding operator E was implemented using FFT for the Cartesian case and NUFFT (28) for the non-Cartesian case following the method used in the iterative SENSE algorithm (24).”
MODEL-BASED IMAGE RECONSTRUCTION FOR MRI (2010, background): “…are given by alij5 3b 1 rS2 rSj 2cl 1 rS 2e2ti /T2*1Sr 2e2if1rS, ti2 drS. (16) In practice the basis functions are usually highly localized (e.g., voxels), so “center of voxel” approximations like the following are nearly always used, often implicitly alij cl 1 rSj 2e2ti /T2* 1rSj 2e2if1 rSj ,…”
Magnetic Resonance Fingerprinting (2013, positive): “The slice thickness was 5 mm. Images from each acquisition block were reconstructed separately using non-uniform Fourier transform (NUFFT) 50 .”
Accelerating the Nonuniform Fast Fourier Transform (2004, methodology): “There are a host of applications of such algorithms, and we refer the reader to the references [2, 6, 8, 11, 13, 14, 17] for examples.”
XD-GRASP: Golden-Angle Radial MRI with Reconstruction of Extra Motion-State Dimensions Using Compressed Sensing (2015, positive): “Free-Breathing 3D Abdominal Imaging Figure 4 compares the conventional NUFFT reconstruction of the full dataset without respiratory sorting (corresponding to the motion average) to XD-GRASP reconstruction with six respiratory motion states.”
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms (2009, methodology): “Common names for these schemes are non-uniform fast Fourier transform [Fessler and Sutton 2003], generalized fast Fourier transform [Dutt and Rokhlin 1993], unequally-spaced fast Fourier transform [Beylkin 1995], fast approximate Fourier transforms for irregularly spaced data [Ware 1998],…”
SPIRiT: Iterative Self-consistent Parallel Imaging Reconstruction from Arbitrary k-Space (2010, methodology): “The nonuniform Fourier transform can be computed fast using inverse-gridding (5) or non-uniform fast Fourier transform (nuFFT) algorithms (22).”
Fast Fourier Transform (2011, methodology): “In particular, Kaiser-Besselfunctions [55, 58] and powers of the sinc-function [90] lead to good results.”
Image reconstruction by domain-transform manifold learning (2017, methodology): “…Technique 15 ; 2) Spiral-trajectory k -space (rapid acquisition with non-Cartesian sampling) and Conjugate-Gradient SENSE reconstruction employing NUFFT regridding 13 ; 3) Poisson-disc undersampled k -space (incoherent sparse acquisition) and compressed sensing reconstruction with wavelet…”