A fast algorithm for nonequispaced Fourier transforms on the rotation group

By Daniel Potts, Jürgen Prestin, Antje Vollrath. 2009

53 citations recorded by the source corpus.

Subfields: Applied Mathematics, Radiology, Nuclear Medicine and Imaging, Signal Processing

How researchers see this paper

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

In Applied Mathematics

1. Manuel Gräf
2. Max Welling
3. Taco Cohen
4. Mario Geiger
5. Jonas Köhler
6. Daniel Potts

In Radiology, Nuclear Medicine and Imaging

1. Manuel Gräf
2. Max Welling
3. Mario Geiger
4. Taco Cohen
5. Jonas Köhler
6. Daniel Potts

In Signal Processing

1. Manuel Gräf
2. Max Welling
3. Taco Cohen
4. Mario Geiger
5. Jonas Köhler
6. Daniel Potts
7. David M. Blei

Citations in the corpus

• Spherical CNNs (2018, background): “Other important works include (Driscoll and Healy, 1994; Healy et al., 2003; Potts et al., 1998; Kunis and Potts, 2003; Drake et al., 2008; Maslen, 1998; Rockmore, 2004; Kostelec and Rockmore, 2007; 2008; Potts et al., 2009; Makadia et al., 2007; Gutman et al., 2008).”
• Sampling Sets and Quadrature Formulae on the Rotation Group (2009, methodology): “Finally, we present in Section 5 an algorithm for computing the quadrature weights for scattered data based on the fast SO(3) Fourier transform [14].”
• Convolutional Networks for Spherical Signals (2017, methodology): “…basis functions by U l (which is either vector-valued or matrix-valued), we can write the GFT of a function f : X → R as This integral can be computed efficiently using a G-FFT algorithm (Kostelec & Rockmore, 2007; 2008; Kunis & Potts, 2003; Driscoll & Healy, 1994; Maslen, 1998; Potts et al., 2009).”