2015
DOI: 10.1016/j.neucom.2015.03.041
|View full text |Cite
|
Sign up to set email alerts
|

Classification of mental tasks from EEG data using backtracking search optimization based neural classifier

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(20 citation statements)
references
References 35 publications
0
20
0
Order By: Relevance
“…• PSD features [39]. Four frequency bands are identified for interpretation of the EEG signals [40,41] but, as it is usual in BCI systems, only the most reactive frequency bands for MI have computed [39]: the alpha (8-12 Hz) and beta range (16)(17)(18)(19)(20)(21)(22)(23)(24). Then, for each EEG signal, two BP features are computed as the energies of the alpha and beta bands.…”
Section: Feature Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…• PSD features [39]. Four frequency bands are identified for interpretation of the EEG signals [40,41] but, as it is usual in BCI systems, only the most reactive frequency bands for MI have computed [39]: the alpha (8-12 Hz) and beta range (16)(17)(18)(19)(20)(21)(22)(23)(24). Then, for each EEG signal, two BP features are computed as the energies of the alpha and beta bands.…”
Section: Feature Extractionmentioning
confidence: 99%
“…There are also papers with the same MI task, published with data collected by the researchers [8,21]. Other examples of binary MI tasks available in the literature are discrimination left/right hand and tongue [22,23]; left/right hand and word generation [24]; left, right hand, foot and tongue [25]; left/right hand, foot and tongue [26]; left, right hand, both hands and both feet [27]; extension/flexion of wrist, open/close fingers [28].…”
Section: Introductionmentioning
confidence: 99%
“…% Topological opposition-based learning (TOBL) (10) for i � 1 : N do (11) for j � 1 : D do (12) OP ij � Low j + Up j − P ij (13) if abs(P best,j − P ij ) > abs(OP best,j − OP ij ) then (14) P ij � OP ij (15) end (16) end (17) end (18) % Selection-I (19) for a � randr; b � randrdo (20) if a < b then (21) OldP � P (22) end (23) end (24) OldP � permuting(OldP) (25) % Improved mutation (26) for i � 1 : Ndo (27) IMut (43) end (44) end (45) end (46) % Boundary control mechanism (47) for…”
Section: Contrastive Analysis Between Mbsagc and Bsamentioning
confidence: 99%
“…ese advantages make it become a promising newcomer among evolutionary algorithms. And so far, it has been successfully applied to digital image processing [15,16], power systems [17][18][19], energy and environmental management [20][21][22], artificial neural networks [23][24][25][26], induction motor [27,28], antenna arrays [29,30], and so on.…”
Section: Introductionmentioning
confidence: 99%
“…The former may be approached using such methods as common spatial pattern (CSP), extreme energy ratio (ERR), orthogonal parametric transforms [ 17 ], autoregressive (AR) parameters, wavelet packet transform (WPT) [ 18 ], principal component analysis (PCA or KLT) [ 19 , 20 ] or hidden Markov model (HMM) to carry out dimensionality reduction [ 21 ]. All aforementioned methods are constantly modified to meet the growing usability and effectiveness requirements.…”
Section: State Of the Artmentioning
confidence: 99%