Related Experiment Video
Updated: Dec 9, 2025

09:26
Disruption of Frontal Lobe Neural Synchrony During Cognitive Control by Alcohol Intoxication
Published on: February 6, 2019
21.8K
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.
Journal of Neuroscience Methods
|September 10, 2020
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.
Area of Science:
- Neuroscience
- Biomedical Engineering
- Signal Processing
Background:
- Alcoholism poses significant risks to the central nervous system and overall health, leading to conditions like cardiomyopathy, immune disorders, and cirrhosis.
- Early and accurate identification of alcoholism is crucial for mitigating its severe health consequences.
- Electroencephalogram (EEG) signals offer a potential biomarker for neurological changes associated with alcoholism.
Purpose of the Study:
- To develop and validate a novel, automated method for alcoholism identification using EEG signals.
- To leverage Fourier theory for enhanced signal decomposition and feature extraction from EEG data.
- To assess the efficacy of the proposed method in accurately classifying alcoholism.
Main Methods:
- A Fourier decomposition method (FDM) was employed to decompose EEG signals into Fourier intrinsic band functions (FIBFs).
- Time-domain features were extracted from FIBFs, and the Kruskal-Wallis test was used for feature selection.
- Classification was performed using k-nearest neighbor (kNN), support vector machine (SVM), and linear discriminant analysis (LDA).
Main Results:
- The proposed FDM approach, particularly with an SVM classifier, achieved exceptional accuracy (99.98%), sensitivity (99.99%), and specificity (99.97%).
- The method demonstrated robust performance even in the presence of noise.
- Results significantly outperformed existing methods for alcoholism detection.
Conclusions:
- The Fourier decomposition method (FDM) provides a highly accurate and efficient approach for automatic alcoholism identification.
- The proposed scheme is suitable for real-time applications in clinical settings.
- This novel method holds promise for improving the early detection and management of alcoholism.
More Related Videos
Related Concept Videos
Mass Spectrometry: Alcohol Fragmentation
4.2K
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 Transform
681
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 Transform
714
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
714

