Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. SCI. COMPUT. c 2008 Society for Industrial and Applied Mathematics
 

Summary: Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
SIAM J. SCI. COMPUT. c 2008 Society for Industrial and Applied Mathematics
Vol. 30, No. 2, pp. 764­784
A FRAMEWORK FOR DISCRETE INTEGRAL
TRANSFORMATIONS I--THE PSEUDOPOLAR
FOURIER TRANSFORM
A. AVERBUCH, R. R. COIFMAN, D. L. DONOHO§, M. ISRAELI¶, AND
Y. SHKOLNISKY
In memory of Moshe Israeli 1940­2007
Abstract. The Fourier transform of a continuous function, evaluated at frequencies expressed in
polar coordinates, is an important conceptual tool for understanding physical continuum phenomena.
An analogous tool, suitable for computations on discrete grids, could be very useful; however, no
exact analogue exists in the discrete case. In this paper we present the notion of pseudopolar grid (pp
grid) and the pseudopolar Fourier transform (ppFT), which evaluates the discrete Fourier transform
at points of the pp grid. The pp grid is a type of concentric-squares grid in which the radial density
of squares is twice as high as usual. The pp grid consists of equally spaced samples along rays,
where different rays are equally spaced in slope rather than angle. We develop a fast algorithm for
the ppFT, with the same complexity order as the Cartesian fast Fourier transform; the algorithm is
stable, invertible, requires only one-dimensional operations, and uses no approximate interpolations.
We prove that the ppFT is invertible and develop two algorithms for its inversion: iterative and direct,

  

Source: Averbuch, Amir - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences