1 / 20

Fast spherical hormonic transform

Fast spherical hormonic transform. 歐永俊 資工三 b92b02053. Background. Direct computation: O(N^4). Separable!!. BUT. Can be reduced to O(N^3). Background. Outer IDFT:. O(N^3). O(n^2lgn). FFT. Inner SHM:. O(N^3). O(n^2lgn). Fast SHM. Background.

fathi
Download Presentation

Fast spherical hormonic transform

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fast spherical hormonic transform 歐永俊 資工三 b92b02053

  2. Background Direct computation: O(N^4) Separable!! BUT Can be reduced to O(N^3)

  3. Background Outer IDFT: O(N^3) O(n^2lgn) FFT Inner SHM: O(N^3) O(n^2lgn) Fast SHM

  4. Background The problem of a fast spherical harmonic transform is now reduced to the efficient calculation of these discrete Legendre transforms. for an arbitrary input vector s with kth component [s]k.

  5. STEP1:using the Legendre recurrence The recurrence relation satisfied by degree:L Stands at level L, iterating the recurrence formula forward r steps associated legendre functions, satisfy follows: degree: r,r-1

  6. STEP1:using the Legendre recurrence In matrix form( recurrence relation): Purpose : rewrite projections onto high degree Legendre polynomials as sums of projections onto (shifted) legendre Polynomials of lower degree .

  7. STEP1:using the Legendre recurrence stored at early time degree at most r Higher degree inner product can be compute as inner products of stored data and (precomputed) sampled values of the polynomials A,B( remember it satisfies recurrence relation of asso.legendre) “A hint to divide and conquer but not enough!”

  8. STEP2:smoothing and subsampling(working inthe “cosine transform” domain) What is not enough? Projections of a data vector onto lower degree trigonometric polynomials should be computed more efficiently. How? Can be done by first lowpass filtering(smoothing) and subsampling the data vector(in cosine transform domain).Then the complexity of computing these inner products grows linearly with n.

  9. STEP2:smoothing and subsampling(working inthe “cosine transform” domain) denote the n-dinmensional orthogonal DCT matrix comprised of normalized sampled cosines DCT

  10. STEP2:smoothing and subsampling(working inthe “cosine transform” domain) fact1: orthogonality of C implies fact2: for any trigonometric polynomial Q of degree at most N-1 the cosine coefficients vanish for n>deg(Q) Computation of the low degree Legendre projections accomplished with very few operations

  11. STEP2:smoothing and subsampling(working inthe “cosine transform” domain) define: critically sampled lowpass operator (bandwidth p) define: truncation operator (keeps first p coordinates of given input vector) is to first to compute cosine representation of a vector the effect of of length N, then remove all frequency components beyond p from s (smoothing), and finally, to keep only those samples necessary to represent this smoothed version(subsampling).

  12. STEP2:smoothing and subsampling(working inthe “cosine transform” domain) Q: degree p Note: the effect of applying to is to simply sample Q on coarser grid O(nlgn) by fast DCT/IDCT

  13. STEP3:divide and conquer low degree transform coefficients: high degree transform coefficients: lower part: (a discrete transform of size N/2)

  14. STEP3:divide and conquer higher part: (Page 7) ( ) ( ) with degree at most N/2 (a discrete transform of size N/2)

  15. Summary O(NlgN) page 15 two problems of size N/2 Page 16,17 Overall is

  16. Numerical result

  17. reference 1.A fast spherical harmonics transform algorithm R Suda, M Takami - Math. Comp, 2002 2. D. Healy, S. Moore, and D. Rockmore, “An FFT for the 2-sphere - improvements and variations” Proc. of ICASSP-96 volume 3.pp.1323-1326

More Related