1981
DOI: 10.1007/978-3-662-00551-4_4
|View full text |Cite
|
Sign up to set email alerts
|

The Fast Fourier Transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
97
0

Year Published

1985
1985
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 221 publications
(97 citation statements)
references
References 6 publications
0
97
0
Order By: Relevance
“…A sliding window extracts noise free features such as mean, standard deviation, energy, and correlation in time or frequency domain. Additionally, the FFT [110] is used to compute the energy in the frequency domain. MLP, along with Bayesian Regularization Neural Network (BRNN), is used to model the relationship between the input, gait, and output (BAC value).…”
Section: Gharani Et Al [109]mentioning
confidence: 99%
“…A sliding window extracts noise free features such as mean, standard deviation, energy, and correlation in time or frequency domain. Additionally, the FFT [110] is used to compute the energy in the frequency domain. MLP, along with Bayesian Regularization Neural Network (BRNN), is used to model the relationship between the input, gait, and output (BAC value).…”
Section: Gharani Et Al [109]mentioning
confidence: 99%
“…The Fourier operator allows us to switch from the time domain to the frequency domain through a projection of the signal acquired over time on an orthonormal basis of complex exponentials. When we apply the Fourier transform, we do nothing but switch between two different representations of the same signal: the original signal is in the time domain, while the transformed signal is in the frequency domain [19,20]. The fast Fourier transform (FFT) is a mathematical transformation to a function, f, represented by Equation (1):…”
Section: Signal Descriptor Selectionmentioning
confidence: 99%
“…The fast Fourier transform (FFT) [17] is an algorithm that computes the discrete Fourier transform (DFT) of a signal and converts it from the time or space domain to a representation in the frequency domain. FFTs are widely used in various fields and for different purposes, such as digital signal processing, data compression, polynomial multiplication, or even multiplication of large integers [36], [37].…”
Section: Appendix Fast Fourier Transformmentioning
confidence: 99%
“…One of the major challenges with searching over the 3D models themselves, as opposed to solely the metadata, is how to derive important characteristics from the models to allow for a robust search mechanism that encompasses both exact and partial matching. To solve this problem, we propose using the Fast Fourier Transform (FFT) [17] to convert models to the frequency domain 1 and deduce peak frequencies. We can use this peak information, as well as distances between peaks, to create a unique identifier, or "fingerprint", for each object.…”
Section: Introductionmentioning
confidence: 99%