The windowed Fourier transform (short time Fourier transform) and the S-transform are widely used signal processing tools for extracting frequency information from non-stationary signals. Previously, the windowed Fourier transform had been adopted for signals on graphs and has been shown to be very useful for extracting vertex-frequency information from graphs. However, high computational compl...

This paper looks at an approach that uses symmetric properties of the basis function to remove redundancies in the calculation of the discrete Fourier transform (DFT). We develop an algorithm, called the quick Fourier transform (QFT), that reduces the number of oating point operations necessary to compute the DFT by a factor of two or four over direct methods or Goertzel's method for prime leng...

Shape is an essential visual feature of an image and it is widely used to describe image content in image classification and retrieval. In this paper, two new Fourier-based approaches for contour-based shape description are presented. These approaches present Fourier descriptors in multiple scales, which improves the shape classification and retrieval accuracy. The proposed methods outperform o...

The nonuniform discrete Fourier transform (NDFT), used in many processing schemes, can be computed using a fast algorithm known as the non uniform fast Fourier transform (NFFT). The NFFT is not a new algorithm, but it is an approximation scheme that can be use to calculate an approximate spectrum. In one dimension, computational complexity of the NFFT is O(NlogN) which is a dramatic improvement...

The Sparse Fast Fourier Transform is a recent algorithm developed by Hassanieh et al. at MIT for Discrete Fourier Transforms on signals with a sparse frequency domain. A reference implementation of the algorithm exists and proves that the Sparse Fast Fourier Transform can be faster than modern FFT libraries. However, the reference implementation does not take advantage of modern hardware featur...

We present fast, spatially dispersionless and unconditionally stable high-order solvers for Partial Differential Equations (PDEs) with variable coefficients in general smooth domains. Our solvers, which are based on (i) A certain “Fourier continuation” (FC) method for the resolution of the Gibbs phenomenon, together with (ii) A new, preconditioned, FC-based solver for two-point boundary value p...