Daniel Potts

Computer Vision and Pattern Recognition · 1998–2013

A researcher in the Science corpus: 7 papers; trusts 16 researchers and is trusted by 18 researchers here, as inferred from the citation graph.

Subfields

• Computer Vision and Pattern Recognition — 9 citations into it; #7,976 of 21,575 by trust here, #14,822 by citations
• Applied Mathematics — 6 citations into it; #1,870 of 7,620 by trust here, #2,583 by citations
• Computational Mechanics — 6 citations into it; #3,262 of 10,001 by trust here, #7,173 by citations
• Signal Processing — 6 citations into it; #2,215 of 7,572 by trust here, #3,913 by citations

Whom Daniel Potts trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Stefan Kunis
2. Peter J. Kostelec
3. Dennis M. Healy Jr.
4. Gabriele Steidl
5. Manfred Tasche
6. E.J. Candes
7. Gregory Beylkin
8. Jeffrey A. Fessler
9. D. Rockmore
10. Bradley P. Sutton

Who trusts Daniel Potts overall

1. Taco Cohen
2. Sujit Kumar Bose
3. Jens Keiner
4. Jürgen Prestin
5. S. Clift
6. Jose J. Blanco-Pillado
7. Manuel Gräf
8. Stefan Kunis
9. Mario Geiger
10. Antje Vollrath

Papers from Daniel Potts's perspective

Ordered by how strongly the researchers Daniel Potts trusts endorse each paper. Same corpus, a different order for every researcher.

1. Computing Fourier Transforms and Convolutions on the 2-Sphere
2. Fast Discrete Curvelet Transforms (Multiscale Modeling & simulation)
3. Sampling signals with finite rate of innovation (IEEE Transactions on Signal Processing)
4. The Design and Implementation of FFTW3
5. Accelerating the Nonuniform Fast Fourier Transform (SIAM Review)
6. Rapid gridding reconstruction with a minimal oversampling ratio (IEEE Transactions on Medical Imaging)
7. Fast, iterative image reconstruction for MRI in the presence of field inhomogeneities (IEEE Transactions on Medical Imaging)
8. Fast spherical Fourier algorithms
9. Handbook of Mathematical Functions.
10. Approximation by exponential sums revisited

Their papers

• Parameter estimation for nonincreasing exponential sums by Prony-like methods (2013) — 131 citations
• A fast algorithm for nonequispaced Fourier transforms on the rotation group (2009) — 53 citations
• Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms (2009) — 381 citations
• Sampling Sets and Quadrature Formulae on the Rotation Group (2009) — 49 citations
• Fast spherical Fourier algorithms (2003) — 145 citations
• Fast Fourier Transforms for Nonequispaced Data: A Tutorial (2001) — 351 citations
• Fast and stable algorithms for discrete spherical Fourier transforms (1998)