Results 1 to 10 of about 584,919 (306)
Computation of the normalized cross-correlation by fast Fourier transform. [PDF]
The normalized cross-correlation (NCC), usually its 2D version, is routinely encountered in template matching algorithms, such as in facial recognition, motion-tracking, registration in medical imaging, etc. Its rapid computation becomes critical in time
Artan Kaso
doaj +3 more sources
Ultrasound Assessment of Honey Using Fast Fourier Transform [PDF]
Ultrasound inspection permits the characteristics of some foodstuffs to be determined easily and cheaply. This experimental study included the determination of various ultrasound parameters provided by the fast Fourier transform (FFT) which had not ...
Montaña Rufo +3 more
doaj +2 more sources
The rolling element bearing is one of the most critical components in a machine. Vibration signals resulting from these bearings imply important bearing defect information related to the machinery faults.
Hsiung-Cheng Lin, Yu-Chen Ye
doaj +2 more sources
Suppression law of quantum states in a 3D photonic fast Fourier transform chip. [PDF]
The identification of phenomena able to pinpoint quantum interference is attracting large interest. Indeed, a generalization of the Hong–Ou–Mandel effect valid for any number of photons and optical modes would represent an important leap ahead both from ...
Crespi A +9 more
europepmc +2 more sources
The Use of Continuous Wavelet Transform Based on the Fast Fourier Transform in the Analysis of Multi-channel Electrogastrography Recordings. [PDF]
This paper presents the analysis of multi-channel electrogastrographic (EGG) signals using the continuous wavelet transform based on the fast Fourier transform (CWTFT). The EGG analysis was based on the determination of the several signal parameters such
Komorowski D, Pietraszek S.
europepmc +2 more sources
Nonlinearizad of Fast Fourier Transform
A unified mathematical form of reversible nonlinear transformations based on a nonlinear tensor product is presented in the form of fast algorithms.
Valeriy Labunets +2 more
doaj +1 more source
For front-end wireless applications in small battery-powered devices, discrete Fourier transform (DFT) is a critical processing method for discrete time signals. Advanced radix structures are created to reduce the impact of transistor malfunction.
Ernest Ravindran Ramaswami Sachidanandan +2 more
doaj +1 more source
Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various applications such as MRI
Melanie Kircheis, Daniel Potts
doaj +1 more source
In response to the high demand of the operation reliability and predictive maintenance, health monitoring and fault diagnosis and classification have been paramount for complex industrial systems (e.g., wind turbine energy systems).
Yichuan Fu +4 more
semanticscholar +1 more source
A parallel non-uniform fast Fourier transform library based on an "exponential of semicircle" kernel [PDF]
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient parallel library
A. Barnett +2 more
semanticscholar +1 more source

