The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Nonuniform fast fourier transforms using min-max interpolation
Abstract
The fast Fourier transform (FFT) is used widely in signal processing for efficient computation of the FT of finite-length signals over a set of uniformly spaced frequency locations. However, in many applications, one requires nonuniform sampling in the frequency domain, i.e., a nonuniform FT. Several papers have described fast approximations for the nonuniform FT based on interpolating an oversampled FFT. This paper presents an interpolation method for the nonuniform FT that is optimal in the min-max sense of minimizing the worst-case approximation error over all signals of unit norm. The proposed method easily generalizes to multidimensional signals. Numerical results show that the min-max approach provides substantially lower approximation errors than conventional interpolation methods. The min-max criterion is also useful for optimizing the parameters of interpolation kernels such as the Kaiser-Bessel function.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
SENSE: Sensitivity encoding for fast MRI
Pruessmann, K. P., Weiger, M., Scheidegger, M. B., & Boesiger, P. (1999) · Magnetic Resonance in Medicine · doi:10.1002/(sici)1522-2594(199911)42:5<952::aid-mrm16>3.0.co;2-s · Cited by 6,251
Principles of Computerized Tomographic Imaging
Kak, A. C., & Slaney, M. (2001) · doi:10.1137/1.9780898719277 · Cited by 5,809
The Fourier reconstruction of a head section
Shepp, L. A., & Logan, B. F. (1974) · IEEE Transactions on Nuclear Science · doi:10.1109/tns.1974.6499235 · Cited by 2,179
Digital Signal Processing : A Computer-Based Approach
Mitra, S. (1997) · Cited by 2,115
Advances in sensitivity encoding with arbitrary k‐space trajectories
Pruessmann, K. P., Weiger, M., Börnert, P., & Boesiger, P. (2001) · Magnetic Resonance in Medicine · doi:10.1002/mrm.1241 · Cited by 1,211
Jackson, J. I., Meyer, C. H., Nishimura, D. G., & Macovski, A. (1991) · IEEE Transactions on Medical Imaging · doi:10.1109/42.97598 · Cited by 1,059
Multirate digital signal processing
Crochiere, R. E., & Rabiner, L. R. (1983) · Signal Processing · doi:10.1016/0165-1684(83)90013-0 · Cited by 949
Fast Fourier Transforms for Nonequispaced Data
Dutt, A., & Rokhlin, V. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914081 · Cited by 918
Ridgelets: a key to higher-dimensional intermittency?
Candès, E. J., & Donoho, D. L. (1999) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1999.0444 · Cited by 893
Fast algorithm for spectral analysis of unevenly sampled data
Press, W. H., & Rybicki, G. B. (1989) · The Astrophysical Journal · doi:10.1086/167197 · Cited by 772
Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase
Parks, T., & McClellan, J. (1972) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1972.1083419 · Cited by 772
A tomographic formulation of spotlight-mode synthetic aperture radar
Munson, D. C., O'Brien, J. D., & Jenkins, W. K. (1983) · Proceedings of the IEEE · doi:10.1109/proc.1983.12698 · Cited by 693
Multirate digital signal processing
(1984) · Signal Processing · doi:10.1016/0165-1684(84)90077-x · Cited by 514
On the Fast Fourier Transform of Functions with Singularities
Beylkin, G. (1995) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.1995.1026 · Cited by 334
Multidimensional digital image representations using generalized Kaiser–Bessel window functions
Lewitt, R. M. (1990) · Journal of the Optical Society of America A · doi:10.1364/josaa.7.001834 · Cited by 292
An accurate algorithm for nonuniform fast Fourier transforms (NUFFT's)
Liu, Q. H., & Nguyen, N. (1998) · IEEE Microwave and Guided Wave Letters · doi:10.1109/75.650975 · Cited by 261
Reconstruction of band-limited signals, irregularly sampled along one spatial direction
Duijndam, A. J. W., Schonewille, M. A., & Hindriks, C. O. H. (1999) · Geophysics · doi:10.1190/1.1444559 · Cited by 195
Fast Fourier Transforms for Nonequispaced Data, II
Dutt, A., & Rokhlin, V. (1995) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.1995.1007 · Cited by 193
The gridding method for image reconstruction by Fourier transformation
Schomberg, H., & Timmer, J. (1995) · IEEE Transactions on Medical Imaging · doi:10.1109/42.414625 · Cited by 189
Computation of spectra with unequal resolution using the fast Fourier transform
Oppenheim, A., Johnson, D., & Steiglitz, K. (1971) · Proceedings of the IEEE · doi:10.1109/proc.1971.8146 · Cited by 181
Nonuniform fast Fourier transform
Duijndam, A. J. W., & Schonewille, M. A. (1999) · Geophysics · doi:10.1190/1.1444560 · Cited by 151
The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
Nguyen, N., & Liu, Q. H. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827597325712 · Cited by 137
Fast Approximate Fourier Transforms for Irregularly Spaced Data
Ware, A. F. (1998) · SIAM Review · doi:10.1137/s003614459731533x · Cited by 113
On the optimality of the gridding reconstruction algorithm
Sedarat, H., & Nishimura, D. G. (2000) · IEEE Transactions on Medical Imaging · doi:10.1109/42.848182 · Cited by 99
Numerical analysis of the non-uniform sampling problem
Strohmer, T. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00361-7 · Cited by 81
3D-FRP: direct Fourier reconstruction with Fourier reprojection for fully 3-D PET
Matej, S., & Lewitt, R. M. (2001) · IEEE Transactions on Nuclear Science · doi:10.1109/23.958359 · Cited by 64
Rapid Computation of the Discrete Fourier Transform
Anderson, C., & Dahleh, M. D. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917059 · Cited by 61
Analysis and design of minimax-optimal interpolators
Choi, H., & Munson, D. C. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.678470 · Cited by 48
Warped discrete cosine transform and its application in image compression
Cho, N. I., & Mitra, S. (2000) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.889021 · Cited by 42
Cited by
Image reconstruction by domain-transform manifold learning
Zhu, B., Liu, J. Z., Cauley, S. F., Rosen, B. R., & Rosen, M. S. (2018) · Nature · doi:10.1038/nature25988 · Cited by 1,694
Magnetic resonance fingerprinting
Ma, D., Gulani, V., Seiberlich, N., Liu, K., Sunshine, J. L., Duerk, J. L., & Griswold, M. A. (2013) · Nature · doi:10.1038/nature11971 · Cited by 1,577
“The slice thickness was 5 mm. Images from each acquisition block were reconstructed separately using non-uniform Fourier transform (NUFFT) 50 .”
SPIRiT: Iterative self‐consistent parallel imaging reconstruction from arbitrary k‐space
Lustig, M., & Pauly, J. M. (2010) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22428 · Cited by 822
Accelerating the Nonuniform Fast Fourier Transform
Greengard, L., & Lee, J.-Y. (2004) · SIAM Review · doi:10.1137/s003614450343200x · Cited by 727
Otazo, R., Candès, E., & Sodickson, D. K. (2015) · Magnetic Resonance in Medicine · doi:10.1002/mrm.25240 · Cited by 697
Metadata
- Authors
- Fessler, J. A., & Sutton, B. P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2003-02
- Volume
- 51
- Issue
- 2
- Pages
- 560-574
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2099944953
- Cited by
- 1,337
- References
- 29
- FWCI
- 21.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.