Efficient computation of Fourier transforms on compact groups

By D. Maslen. 1998

How researchers see this paper

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

1. Taco Cohen
2. Mario Geiger
3. Max Welling
4. Maurice Weiler
5. David W. Romero
6. Jonas Köhler
7. Erik J. Bekkers
8. Yoshua Bengio

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).”
• Recent progress and applications in group FFTs (2002, background): “Bandwidth is thus defined in terms of lengths of factorizations in sums of products of such elements expressing a given matrix element [ 31 ].”
• 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).”