Accurate and fast discrete polar fourier transform

Conference Record of the Asilomar Conference on Signals, Systems and Computers

Volumn 2, Issue , 2003, Pages 1933-1937

  Averbuch, A ^a   Coifman, R R ^b   Donoho, D L ^c   Elad, M ^d   Israeli, M ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b YALE UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL IMAGES; FOURIER ANALYSIS; TWO DIMENSIONAL CONTINUUM;

FAST FOURIER TRANSFORMS; IMAGE ANALYSIS; INTERPOLATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS;

IMAGE PROCESSING;

EID: 4143119208     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Dongarra, J. and Sullivan, F. (2000) Introduction the top 10 algorithms, Special issue of Computing in Science and Engineering, Vol. 2, No. 1.
2. Briggs, B. and Henson, E. (1995) The FFT: an Owner's Manual for the Discrete Fourier Transform, SIAM, Philadelphia.
3. Averbuch, A., Coifman, R., Donoho, D.L., Eladm M. and Israeli, M. (2003) Accurate and Fast Discerete Polar Fourier Transform, draft.
4. Suli, E. and Ware, A. (1991) A spectral method of characteristics for hyperbolic problems SIAM J. Numer. Anal., Vol. 28, No. 2, pp. 423-445.
5. Boyd, J.P. (1992) A fast algorithm for Chebyshev, Fourier, and sine interpolation onto an irregular grid, J. of Comp. Phys., Vol. 103, No. 2, pp.243-257.
6. Beylkin, G. (1995) On the fast Fourier transform of functions with singularities, Applied Computational Harmonics, Vol. 2, pp. 263-381.
7. Anderson, C. and Dahleh, M. D. (1998) Rapid computation of the discrete Fourier transform, SIAM J. Sci. Comput., Vol. 17 pp. 913-919.
8. Dutt, A. and Rokhlin, V. (1993) Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Comput., Vol. 14, pp. 1368-1393.
9. Dutt, A. and Rokhlin, V. (1995) Fast Fourier transforms for nonequispaced data II, Appl. Comput. Harmon. Anal. Vol. 2, pp. 85-100.
10. Ware, A. F. (1998) Fast approximate Fourier transform for irregularly spaced data, SIAM Review, Vol. 40, No. 4, pp. 838-856.
11. Duijndam, A.j.W. and Schonewille, M.A. (1999), Nonuniform fast Fourier transform, Geophysics, Vol. 64, No. 2, pp. 539-551.
12. Nguyen, N. and Liu, Q.H. (1999) The regular Fourier matrices and nonuniform fast Fourier Transforms, SIAM Journal of Scientific Computing, Vol. 21, No. 1, pp. 283-293.
13. Fessler, J.A., and Sutton, B.P. (2003) Nonuniform Fast Fourier Transforms Using Min-Max Interpolation, IEEE Trans. on Signal Processing, Vol. 51, No. 2, pp. 560-574.
14. Mersereau, R. M. and Oppenheim, A. V., (1974) Digital reconstruction of multidimensional signals from their projections, Proc. IEEE, Vol. 62, No. 10, pp. 1319-1338.
15. Moraski, K. J. and Munson Jr., D.C. (1991) Fast tomographic reconstruction using chirp-z interpolation, in Proceedings of 25th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, pp. 1052-1056.
16. Choi, H. and Munson Jr., D.C., (1998) Direct-Fourier reconstruction in tomography and synthetic aperture radar, Int. J. of Imaging Systems and Tech., Vol.9, No.1, pp. 1-13.
17. Averbuch, A., Coifman, R., Donoho, D.L., and Israeli, M. (2003) Fast Slant Stack: A notion of Radon transform for data in a Cartesian grid which is rapidly computible, algebraically exact, geometrically faithful and invertible, to appear in SIAM Scientific Computing.
18. Golub, G.H. and Van Loan C.F, (1996) Matrix Computations, John Hopkins University Press, Third edition.