Search bioRxiv⌕ Search
Home/Archive/bioRxiv

bioRxiv · 10.1101/076646

Performance Evaluation of Empirical Mode Decomposition Algorithms for Mental Task Classification

Akshansh Gupta·Dhirendra Kumar·Anirban Chakraborti·Kiran Sharma
View original source ↗Export metadata ↓

Abstract

Brain Computer Interface (BCI), a direct pathway between the human brain and computer, is one of the most pragmatic applications of EEG signal. The electroencephalograph (EEG) signal is one of the monitoring techniques to observe brain functionality. Mental Task Classification (MTC) based on EEG signals is a demanding BCI. Success of BCI system depends on the efficient analysis of these signals. Empirical Mode Decomposition (EMD) is a filter based heuristic technique which is utilized to analyze EEG signal in recent past. There are several variants of EMD algorithms which have their own merits and demerits. In this paper, we have explored three variants of EMD algorithms named Empirical Mode Decomposition (EMD), Ensemble Empirical Mode Decomposition (EEMD) and Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) on EEG data for MTC-based BCI. Features are extracted from EEG signal in two phases; in the first phase, the signal is decomposed into different oscillatory functions with the help of different EMD algorithms and eight different parameters (features) are calculated for each function for compact representation in the second phase. These features are fed into Support Vector Machine (SVM) classifier to classify the different mental tasks. We have formulated two different types of MTC, the first one is binary and second one is multi-MTC. The proposed work outperforms the existing work for both binary and multi mental tasks classification.

Explore related subjects

BioinformaticsPreprint

Keep this discovery

BibTeXRIS

Akshansh Gupta, Dhirendra Kumar, Anirban Chakraborti, Kiran Sharma. 2016-09-21. Performance Evaluation of Empirical Mode Decomposition Algorithms for Mental Task Classification. https://doi.org/10.1101/076646

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

bioRxiv2016

iCARE: An R Package to Build and Apply Absolute Risk Models

This report describes a R package, called the Individualized Coherent Absolute Risk Estimation (iCARE) tool, that allows researchers to build and evaluate models for absolute risk and apply them to estimate an individuals risk of developing disease during a specified time interval based on a set of user defined input parameters. An attractive feature of the software is that it gives users flexibility to update models rapidly based on new knowledge on risk factors and tailor models to different populations by specifying three input arguments: (1) a model for relative risk, (2) an age-specific disease incidence rate, (3) the distribution of risk factors for the population of interest. The tool can handle missing information on risk factors for individuals for whom risks are to be predicted using a coherent approach where all estimates are derived from a single model after appropriate model averaging. The software allows single nucleotide polymorphisms (SNPs) to be incorporated into the model using published odds ratios and allele frequencies. The validation component of the software implements the methods for evaluation of model calibration, discrimination and risk-stratification based on independent validation datasets. We provide an illustration of the utility of iCARE for building, validating and applying absolute risk models using breast cancer as an example.

Bioinformatics↗
bioRxiv2016

deSPI: efficient classification of metagenomic reads with lightweight de Bruijn graph-based reference indexing

SummaryIn metagenomic studies, fast and effective tools are on wide demand to implement taxonomy classification for upto billions of reads. Herein, we propose deSPI, a novel read classification method that classifies reads by recognizing and analyzing the matches between reads and reference with de Bruijn graph-based lightweight reference indexing. deSPI has faster speed with relatively small memory footprint, meanwhile, it can also achieve higher or similar sensitivity and accuracy.\n\nAvailabilitythe C++ source code of deSPI is available at https://github.com/hitbc/deSPI\n\nContactydwang@hit.edu.cn\n\nSupplementary informationSupplementary data are available at Bioinformatics online.

Bioinformatics↗
bioRxiv2016

De novo assembly of viral quasispecies using overlap graphs

A viral quasispecies, the ensemble of viral strains populating an infected person, can be highly diverse. For optimal assessment of virulence, pathogenesis and therapy selection, determining the haplotypes of the individual strains can play a key role. As many viruses are subject to high mutation and recombination rates, high-quality reference genomes are often not available at the time of a new disease outbreak. We present SAVAGE, a computational tool for reconstructing individual haplotypes of intrahost virus strains without the need for a high-quality reference genome. SAVAGE makes use of either FM-index based data structures or ad-hoc consensus reference sequence for constructing overlap graphs from patient sample data. In this overlap graph, nodes represent reads and/or contigs, while edges reflect that two reads/contigs, based on sound statistical considerations, represent identical haplotypic sequence. Following an iterative scheme, a new overlap assembly algorithm that is based on the enumeration of statistically well-calibrated groups of reads/contigs then efficiently reconstructs the individual haplotypes from this overlap graph. In benchmark experiments on simulated and on real deep coverage data, SAV-AGE drastically outperforms generic de novo assemblers as well as the only specialized de novo viral quasispecies assembler available so far. When run on ad-hoc consensus reference sequence, SAVAGE performs very favorably in comparison with state-of-the-art reference genome guided tools. We also apply SAVAGE on two deep coverage samples of patients infected by the Zika and the hepatitis C virus, respectively, which sheds light on the genetic structures of the respective viral quasispecies.

Bioinformatics↗