A novel approach for automated alcoholism detection using Fourier decomposition method

Virender Kumar Mehla1, Amit Singhal1, Pushpendra Singh2

  • 1Department of Electronics and Communication Engineering, Bennett University, Greater Noida, India.

Summary

This study introduces a novel Fourier decomposition method (FDM) for automatic alcoholism identification using electroencephalogram (EEG) signals. The FDM approach achieves high accuracy, offering an efficient solution for real-time detection of alcoholism.

Related Concept Videos

Mass Spectrometry: Alcohol Fragmentation01:03

Mass Spectrometry: Alcohol Fragmentation

Alcohols (R-OH) ionize to lose one non-bonded electron from the oxygen atom, forming molecular ions. Due to their tendency to fragment rapidly, the intensity of the molecular ion peak in the mass spectrum is weak or sometimes absent. The fragmentation patterns for alcohols occur in two ways, i.e. ⍺-cleavage and dehydration. During ⍺-cleavage, the bond at the ⍺-position adjacent to the hydroxyl group cleaves to give a resonance-stabilized cation and a radical. However, intramolecular...
4.2K
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
681
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
714