Abstract
In this paper we present algorithms to calculate the fast Fourier synthesis and its adjoint on the rotation group SO(3) for arbitrary sampling sets. They are based on the fast Fourier transform for nonequispaced nodes on the three-dimensional torus. Our algorithms evaluate the SO(3) Fourier synthesis and its adjoint, respectively, of B-bandlimited functions at M arbitrary input nodes in \(\mathcal O(M+B^4)\) or even \(\mathcal O(M + B^3 \log^2 B)\) flops instead of \(\mathcal O(MB^3)\). Numerical results will be presented establishing the algorithm’s numerical stability and time requirements.
Similar content being viewed by others
References
Baszenski, G., Tasche, M.: Fast polynomial multiplication and convolution related to the discrete cosine transform. Linear Algebra Appl. 252, 1–25 (1997)
Beylkin, G.: On the fast Fourier transform of functions with singularities. Appl. Comput. Harmon. Anal. 2, 363–381 (1995)
Bunge, H.J.: Texture Analysis in Material Science. Butterworths, Toronto (1982)
Castrillon-Candas, J.E., Siddavanahalli, V., Bajaj, C.: Nonequispaced Fourier transforms for protein-protein docking. ICES Report 05-44, Univ. Texas (2005)
Chirikjian, G.S., Kyatkin, A.: Engineering Applications of Noncommutative Harmonic Analysis: with Emphasis on Rotation and Motion Groups. CRC, Boca Raton (2001)
Davis, P.J., Rabinowitz, P.: Methods of Numerical Integration, 2nd edn. Academic, London (1984)
Driscoll, J.R., Healy, D.: Computing Fourier transforms and convolutions on the 2-sphere. Adv. Appl. Math. 15, 202–250 (1994)
Dutt, A., Rokhlin, V.: Fast Fourier transforms for nonequispaced data. SIAM J. Sci. Stat. Comput. 14, 1368–1393 (1993)
Frigo, M., Johnson, S.G.: FFTW, C subroutine library. http://www.fftw.org (2005)
Gräf, M., Kunis, S.: Stability results for scattered data interpolation on the rotation group. Electron. Trans. Numer. Anal. 31, 30–39 (2008)
Healy, D., Kostelec, P., Moore, S., Rockmore, D.: FFTs for the 2-sphere—improvements and variations. J. Fourier Anal. Appl. 9, 341–385 (2003)
Hielscher, R., Potts, D., Prestin, J., Schaeben, H., Schmalz, M.: The Radon transform on SO(3): a Fourier slice theorem and numerical inversion. Inverse Probl. 24, 025011 (2008)
Hielscher, R., Prestin, J., Vollrath, A.: Fast summation of functions on SO(3). Preprint 09-02, Univ. of Luebeck (2009)
Keiner, J., Kunis, S., Potts, D.: NFFT 3.0, C subroutine library. http://www.tu-chemnitz.de/~potts/nfft (2006)
Keiner, J., Potts, D.: Fast evaluation of quadrature formulae on the sphere. Math. Comput. 77, 397–419 (2008)
Kostelec, P.J., Rockmore, D.N.: FFTs on the rotation group. J. Fourier Anal. Appl. 14, 145–179 (2008)
Kunis, S., Potts, D.: Fast spherical Fourier algorithms. J. Comput. Appl. Math. 161, 75–98 (2003)
Makadia, A., Geyer, C., Sastry, S., Daniilidis, K.: Radon-based structure from motion without correspondences. In: CVPR ’05: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), vol. 1, pp. 796–803. IEEE Computer Society, Washington, DC (2005)
McEwen, J.D., Hobson, M.P., Lasenby, A.N.: A directional continuous wavelet transform on the sphere. ArXiv:astro-ph/0609159v1 (2006)
Mohlenkamp, M.J.: A fast transform for spherical harmonics. J. Fourier Anal. Appl. 5, 159–184 (1999)
Potts, D., Steidl, G., Tasche, M.: Fast algorithms for discrete polynomial transforms. Math. Comput. 67, 1577–1590 (1998)
Potts, D., Steidl, G., Tasche, M.: Fast and stable algorithms for discrete spherical Fourier transforms. Linear Algebra Appl. 275/276, 433–450 (1998)
Potts, D., Steidl, G., Tasche, M.: Fast Fourier transforms for nonequispaced data: a tutorial. In: Benedetto, J.J., Ferreira, P.J.S.G. (eds.), Modern Sampling Theory: Mathematics and Applications, pp. 247–270. Birkhäuser, Boston (2001)
Potts, D., Steidl, G., Tasche, M.: Numerical stability of fast trigonometric transforms - a worst case study. J. Concrete Appl. Math. 1, 1–36 (2003)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C. Cambridge University Press, Cambridge (1992)
Risbo, T.: Fourier transform summation of Legendre series and D-Functions. J. Geod. 70, 383–396 (1996)
Rokhlin, V., Tygert, M.: Fast algorithms for spherical harmonic expansions. SIAM J. Sci. Comput. 27, 1903–1928 (2006)
Schaeben, H., Boogaart, K.G.v.d.: Spherical harmonics in texture analysis. Tectonophysics 370, 253–268 (2003)
Schmid, D.: Marcinkiewicz-Zygmund inequalities and polynomial approximation from scattered data on SO(3). Numer. Funct. Anal. Optim. 29, 855–882 (2008)
Suda, R., Takami, M.: A fast spherical harmonics transform algorithm. Math. Comput. 71, 703–715 (2002)
Varshalovich, D., Moskalev, A., Khersonski, V.: Quantum Theory of Angular Momentum. World Scientific, Singapore (1988)
Vilenkin, N.: Special Functions and the Theory of Group Representations. American Mathematical Society, Providence (1968)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Potts, D., Prestin, J. & Vollrath, A. A fast algorithm for nonequispaced Fourier transforms on the rotation group. Numer Algor 52, 355–384 (2009). https://doi.org/10.1007/s11075-009-9277-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-009-9277-0
Keywords
- Rotation group
- Spherical Fourier transform
- Generalized spherical harmonics
- Fourier synthesis
- Wigner-D functions
- Wigner-d functions
- Fast discrete transforms
- Fast Fourier transform at nonequispaced nodes