Results 11 to 20 of about 1,334,101 (280)
Fourier ptychography algorithm based on scaled Fourier transform
This letter discusses an alternative Fourier ptychography algorithm based on the scaled fast Fourier transform propagation. The advantage of this scheme is that it enables a zoom‐in capability of the object spectrum and complex pupil within the synthetic
Mojde Hasanzade +3 more
doaj +1 more source
On the Clifford-Fourier Transform [PDF]
For functions that take values in the Clifford algebra, we study the Clifford-Fourier transform on $R^m$ defined with a kernel function $K(x,y) := e^{\frac{i π}{2} Γ_{y}}e^{-i }$, replacing the kernel $e^{i }$ of the ordinary Fourier transform, where $Γ_{y} := - \sum_ ...
De Bie, Hendrik, Xu, Yuan
openaire +3 more sources
Discrete Fourier transform and permutations [PDF]
It is well known that the magnitudes of the coefficients of the discrete Fourier transform (DFT) are invariant under certain operations on the input data. In this paper, the effects of rearranging the elements of an input data on its DFT are studied.
S. Hui, S.H. Żak
doaj +1 more source
Applications of Fourier transform infrared spectroscopy [PDF]
Podeu consultar el llibre complet a: http://hdl.handle.net/2445/32166This article summarizes the basic principles of Fourier Transform Infrared Spectroscopy, with examples of methodologies and applications to different field ...
Ferrer i Felis, Núria
core +6 more sources
Multiweighted-Type Fractional Fourier Transform: Unitarity
The definition of the discrete fractional Fourier transform (DFRFT) varies, and the multiweighted-type fractional Fourier transform (M-WFRFT) is its extended definition. It is not easy to prove its unitarity.
Tieyu Zhao, Yingying Chi
doaj +1 more source
Coefficient-of-Determination Fourier Transform
This algorithm is designed to perform numerical transforms to convert data from the temporal domain into the spectral domain. This algorithm obtains the spectral magnitude and phase by studying the Coefficient of Determination of a series of artificial ...
Matthew David Marko
doaj +1 more source
Transformer architectures show spectacular performance on NLP tasks and have recently also been used for tasks such as image completion or image classification. Here we propose to use a sequential image representation, where each prefix of the complete sequence describes the whole image at reduced resolution. Using such Fourier Domain Encodings (FDEs),
Tim-Oliver Buchholz, Florian Jug
openaire +2 more sources
Frequency chirped Fourier-Transform spectroscopy
Fast and high-resolution Fourier transform spectrometers are indispensable for cutting-edge infrared spectroscopy. In this study, the authors employed a newly-designed fast-rotating retroreflective, broadband delay line demonstrating fast dual-comb ...
Sergej Markmann +8 more
doaj +1 more source
Fast Fourier transform revisited
Using FFT (fast Fourier transform), it is assumed, that some signal samples in a respective period N are updated by a sensor in real time. It is urgent for every new signal sample to have new frequency samples (f.s.).
Rimantas Pupeikis
doaj +1 more source
A Didactic and Visual Approach to the Fourier Transform
This work provides a comprehensive derivation of the Fourier transform, with less emphasis on the mathematical rigor associated with the theory. Instead, its primary goal is to serve as a didactic resource that fosters an understanding of various ...
Daniel José Kmita +1 more
doaj +1 more source

