FFTs on the rotation group
DOI10.1007/s00041-008-9013-5zbMath1146.43001OpenAlexW1986655361MaRDI QIDQ2483008
Peter J. Kostelec, Daniel N. Rockmore
Publication date: 5 May 2008
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00041-008-9013-5
Pattern matchingFast Fourier transformSpherical harmonicsRotation groupDiscrete polynomial transform
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Harmonic analysis on specific compact groups (43A75) Numerical methods for discrete and fast Fourier transforms (65T50) Software, source code, etc. for problems pertaining to abstract harmonic analysis (43-04) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of spherical harmonic expansion coefficients via FFT's
- Efficient computation of Fourier transforms on compact groups
- FFTs for the 2-sphere-improvements and variations
- Towards safe and effective high-order Legendre transforms with applications to FFTs for the 2-sphere
- Computational harmonic analysis for tensor fields on the two-sphere
- An empirical Bayes approach to directional data and efficient computation on the sphere
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- Fast Algorithms for Spherical Harmonic Expansions
- Separation of variables and the computation of Fourier transforms on finite groups, I
- Fourier transform summation of Legendre series and \(D\)-functions
This page was built for publication: FFTs on the rotation group