Related papers: Fast Finite Shearlet Transform
In the paper we design a Parseval wavelet frame with a compact support and many vanishing moments. The corresponding refinement mask approximates an arbitrary continuous periodic function $f$, $f(0)=1$. The refinable function has stable…
The efficient multiangle centered discrete fractional Fourier transform (MA-CDFRFT) [1] has proven to be a useful tool for time-frequency analysis; in this paper, we generalize the MA-CDFRFT to general M -periodic transforms, which, among…
This paper presents an approach for the development of a number theoretic discrete Hilbert transform. The forward transformation has been applied by taking the odd reciprocals that occur in the DHT matrix with respect to a power of 2.…
In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…
The technologically-relevant task of feature extraction from data performed in deep-learning systems is routinely accomplished as repeated fast Fourier transforms (FFT) electronically in prevalent domain-specific architectures such as in…
Faraday tomography through broadband polarimetry can provide crucial information on magnetized astronomical objects, such as quasars, galaxies, or galaxy clusters. However, the limited wavelength coverage of the instruments requires that we…
We show that the cone-adapted shearlet coefficients can be computed by means of the limited angle horizontal and vertical (affine) Radon transforms and the one-dimensional wavelet transform. This yields formulas that open new perspectives…
Convolutional networks are one of the most widely employed architectures in computer vision and machine learning. In order to leverage their ability to learn complex functions, large amounts of data are required for training. Training a…
Like the continous shearlet transform and their relatives, discrete transformations based on the interplay between several filterbanks with anisotropic dilations provide a high potential to recover directed features in two and more…
Computational micromechanics and homogenization require the solution of the mechanical equilibrium of a periodic cell that comprises a (generally complex) microstructure. Techniques that apply the Fast Fourier Transform have attracted much…
Pseudo-spectral method is one of the most accurate techniques for simulating turbulent flows. Fast Fourier transform (FFT) is an integral part of this method. In this paper, we present a new procedure to compute FFT in which we save…
Multivariate problems are typically governed by anisotropic features such as edges in images. A common bracket of most of the various directional representation systems which have been proposed to deliver sparse approximations of such…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
This paper presents a novel frequency-domain approach for path following problem, specifically designed to handle paths described by discrete data. The proposed algorithm utilizes the fast Fourier Transform (FFT) to process the discrete…
In this work, we propose an algorithm for a filter based on the Fast Fourier Transform (FFT), which, due to its characteristics, allows for an efficient computational implementation, ease of use, and minimizes amplitude variation in the…
In this paper we will look at the connection of frames and finite dimensionality. A main focus is to present simple algorithms and make them available online. The main result is a way to 'switch' between different frames, giving an…
In this paper, we focus on Fourier analysis and holographic transforms for signal representation. For instance, in the case of image processing, the holographic representation has the property that an arbitrary portion of the transformed…
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
The precise analysis and accurate measurement of harmonic provides a reliable scientific industrial application. However, the high-performance DSP processor is the important method of electrical harmonic analysis. Hence, in this research…