Next Article in Journal
Soft and Stretchable Polymeric Optical Waveguide-Based Sensors for Wearable and Biomedical Applications
Next Article in Special Issue
Artifacts in Simultaneous hdEEG/fMRI Imaging: A Nonlinear Dimensionality Reduction Approach
Previous Article in Journal
On the Lateral Instability Analysis of MEMS Comb-Drive Electrostatic Transducers
Previous Article in Special Issue
A Blood Flow Volume Linear Inversion Model Based on Electromagnetic Sensor for Predicting the Rate of Arterial Stenosis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Selective Feature Generation Method Based on Time Domain Parameters and Correlation Coefficients for Filter-Bank-CSP BCI Systems

Division of Computer and Communications Engineering, Korea University, Seoul 02841, Korea
*
Author to whom correspondence should be addressed.
Sensors 2019, 19(17), 3769; https://doi.org/10.3390/s19173769
Submission received: 22 July 2019 / Revised: 21 August 2019 / Accepted: 29 August 2019 / Published: 30 August 2019
(This article belongs to the Special Issue Electromagnetic Sensors for Biomedical Applications)

Abstract

:
This paper presents a novel motor imagery (MI) classification algorithm using filter-bank common spatial pattern (FBCSP) features based on MI-relevant channel selection. In contrast to existing channel selection methods based on global CSP features, the proposed algorithm utilizes the Fisher ratio of time domain parameters (TDPs) and correlation coefficients: the channel with the highest Fisher ratio of TDPs, named principle channel, is selected and a supporting channel set for the principle channel that consists of highly correlated channels to the principle channel is generated. The proposed algorithm using the FBCSP features generated from the supporting channel set for the principle channel significantly improved the classification performance. The performance of the proposed method was evaluated using BCI Competition III Dataset IVa (18 channels) and BCI Competition IV Dataset I (59 channels).

1. Introduction

Brain–computer interfaces (BCIs) enable the translation of neural signals related to a user’s intention into control signals in the absence of muscle movements, and have drawn considerable attention in various research fields, including rehabilitation and engineering [1,2,3]. Due to the technological developments in practicality and portability in recent years, BCIs have also been applied to entertainment and educational filed. [4,5].
Most current BCI systems use electroencephalogram (EEG) extensively due to its high temporal resolution and non-invasiveness [6]. The EEG-based BCI studies show that, when imagining movement of the body, the EEG signals from the regions associated of the cerebral cortex show decreased and increased power in sensorimotor and beta rhythm, called event-related desynchronization (ERD) and event-related synchronization (ERS), respectively [7,8]. Thus, motor imagery (MI)-based BCIs are widely studied by identifying ERD/ERS patterns.
However, EEG signals suffer from low signal-to-noise ratios (SNR) and are highly correlated due to the volume conduction effect [9]. Consequently, they are susceptible to strong artifacts [10,11]. The common spatial pattern (CSP) approach is perhaps the most popular method for extracting ERD/ERS-related features, resolving these difficulties and thus improving the performance of MI-based BCI [12,13,14,15]. The CSP approach designs spatial filters that maximize the variance for one MI-task while simultaneously minimizing the variance for the other task, and extracts discriminative ERD/ERS-related features based on the spatially filtered EEG signals.
Various studies have examined ways to improve CSP algorithms in three categories: frequency optimization, regularization, and channel selection. Frequency range optimization for CSP has been proposed using filter-banks. The filter-bank CSP (FBCSP) approach, described in [16,17], performs the CSP for each frequency band and selects the distinct frequency bands by comparing mutual information of each frequency band CSP features. The FBCSP approach overcomes the frequency range problem of CSP and shows improved performance for MI-classification.
The regularized CSP (R-CSP) [18] approach considers regularization of CSP to overcome the sensitivity thereof to noise and overfitting. However, the performance of R-CSP is highly dependent on optimization of the regularization parameters, which requires exhaustive cross-validation. A frequency range-optimized version of R-CSP, filter-bank regularized CSP (FBRCSP), has also been proposed [19].
Since the CSP approach uses all available channels, including noisy and task-irrelevant channels, the selection of MI-related channels is important for improving the performance of CSP-based algorithms. The sparse CSP (SCSP) approach, described in [20], removes MI-irrelevant channels via sparse CSP filters based on the 1 / 2 -norm constraint, and applies the CSP to the remaining channels. The CSP-rank for multiple frequency band (CSP-R-MF) approach, described in [21], generates CSP outputs for each frequency band based on the channels with significant conventional CSP filter coefficients, and selects features from the multi-band CSP outputs using the least absolute shrinkage and selection operator (LASSO) algorithm [22]. The experimental results presented in this paper show that these channel selection approaches yield better performance than frequency optimization and regularization.
Although the channel selection CSP approaches improve performance markedly, they have a fundamental limitation that SCSP and CSP-R-MF select MI-relevant channels based on the global CSP, which might already be corrupted by the MI-irrelevant channels. Hence, a CSP-independent method for determining MI-relevant channels is desired.
In this paper, we propose a novel MI-relevant channel selection method for FBCSP. We utilize time domain parameters [23] (TDPs) and correlation coefficients of EEG channel pairs to determine MI-relevant channels. TDPs are extracted from wide frequency band EEG time domain signals and originally used as features to classify MI in [24]. In [24], three types of TDPs are introduced, namely the variance of the signal, the variance of the first derivative, and the variance of the second derivative, which represent activity, mobility, and complexity of the signal, respectively. We consider the channel with the highest Fisher ratio ([25]) of TDPs as the most discriminative channel for MI-tasks and refer to it as the principle channel. We form a supporting channel set for the principle channel with the channels that have high correlation coefficients with the principle channel. Finally, we extract the FBCSP features from the supporting channel set and use them as the input to the support vector machine (SVM) classifier [26]. The performance of the proposed method was evaluated using BCI Competition III Dataset IVa and BCI Competition IV Dataset I. Comparison of the performance with existing CSP-based methods demonstrates significant improvement in classification performance. The rest of this paper is structured as follows. Section 2 presents the proposed method. Section 3 provides the experiment results and discussion. Finally, the conclusion is drawn in Section 4.

2. Methods

In this paper, we consider the binary MI-classification. First, let us consider K channel EEG signals. We denote the kth channel EEG signal at time point n as x ( k ) ( n ) , where k = 1 , 2 , , K , n = 1 , 2 , , N and N is the number of time samples per channel. Assume that I trials of the MI-EEG signal are available, indexed as x i ( k ) = [ x i ( k ) ( 1 ) , x i ( k ) ( 2 ) , , x i ( k ) ( N ) ] T , where i = 1 , 2 , , I . We denote I 1 and I 2 as the index set of each MI class ( I 1 I 2 = { 1 , 2 , , N } ).
The block diagram in Figure 1 depicts the proposed algorithm. We first introduce the TDPs, and Fisher ratio of TDPs to measure the MI-relevance of each channel. The channel with the highest Fisher ratio of TDPs is referred to as the principle channel. A supporting channel set for the principle channel is constituted from channels that have correlation coefficients with the principle channel exceeding a certain threshold. The FBCSP features are extracted from the supporting channel set to improve the MI-classification performance.

2.1. Principle Channel Selection

The type p ( p = 0 , 1 , 2 ) time domain parameter (TDP) for the ith trial of the kth channel EEG signal, denoted by T ( i , p ) ( k ) , is defined by the following [23]:
T ( i , p ) ( k ) = log v a r d p x i ( k ) ( n ) d n p , p = 0 , 1 , 2 .
The first type ( p = 0 ) represents signal power, the second type ( p = 1 ) represents the EEG pattern for mean frequency, and the third type ( p = 2 ) represents the EEG pattern for frequency change [23].
The Fisher ratio is widely used to measure the class-discriminative property of a parameter by projecting high-dimensional parameters into one-dimensional space [27]. The Fisher ratio of the three types of TDP for channel k, defined by F ( k ) , is given by,
F ( k ) = p = 0 2 1 | I 1 | i I 1 T ( i , p ) ( k ) 1 | I 2 | i I 2 T ( i , p ) ( k ) 2 p = 0 2 c = 1 2 1 | I c | i I c T ( i , p ) ( k ) i I 1 T ( i , p ) ( k ) 2 ,
where | I c | denotes the size of the index set I c . Postulating that the channel with the highest Fisher ratio has the most significant discrimination between MI tasks, we select the channel with the highest Fisher ratio, denoted by k p , and refer to it as the principle channel.
k p = arg max k { 1 , , K } { F ( k ) } .

2.2. Supporting Channel Set for the Principle Channel

To extract features based on FBCSP, we need sufficient number of channels. For this, we use channels that are highly correlated with the principle channel. The (sample) correlation coefficient between the principle channel k p and a channel q for the ith trial EEG signals is given by:
ρ i ( k p , q ) = C ( x i ( k p ) , x i ( q ) ) P ( x i ( k p ) ) P ( x i ( q ) ) , q = 1 , 2 , , K , and q k p
where
C ( x i ( k p ) , x i ( q ) ) = n = 1 N x i ( k p ) ( n ) 1 N n = 1 N x i ( k p ) ( n ) x ( q ) ( n ) 1 N n = 1 N x i ( q ) ( n )
P ( x i ( q ) ) = n = 1 N x i ( q ) ( n ) 1 N n = 1 N x i ( q ) ( n ) 2
and the mean correlation coefficient for class c, denoted as ρ ¯ c ( k p , q ) , is given by:
ρ ¯ c ( k p , q ) = 1 | I c | i I c ρ i ( k p , q ) , c = 1 , 2 .
After calculating the mean correlation coefficients between the principle channel and other channels, we define the supporting channel set for the principle channel, denoted as S, as those channels with mean correlation coefficient exceeding a given threshold, ρ t h r , as follows:
S = q { 1 , 2 , , K } ρ ¯ 1 ( k p , q ) ρ t h r and ρ ¯ 2 ( k p , q ) ρ t h r

2.3. FBCSP Applied to the Supporting Channel Set

The FBCSP approach is then applied to the supporting channel set to extract the MI-relevant features. Let us consider the output of the mth filter-bank of the supporting channel set S at the ith trial as X i , m ( S ) , where m = 1 , 2 , , M and M is the number of filter-banks. The normalized sample covariance matrix E i , m ( S ) is given by:
E i , m ( S ) = X i , m ( S ) X i , m ( S ) T t r a c e X i , m ( S ) X i , m ( S ) T , i = 1 , 2 , , I ,
where E i , m ( S ) R | S | × | S | . Subsequently, the normalized mean sample covariance matrix for the class c, denote as E ¯ c , m ( S ) , is given by:
E ¯ c , m ( S ) = 1 | I c | i I c E i , m ( S ) , c = 1 , 2 .
Let p ( m ) be a spatial filter applied to X i , m ( S ) . The averaged variance of the spatially filtered EEG signals in S, in frequency band m for class c ( { 1 , 2 } ), can be written as p ( m ) T E ¯ ( c , m ) ( S ) p ( m ) . Let J ( p ( m ) ) denote the averaged variance ratio between two classes using a spatial filter p ( m ) ,
J ( p ( m ) ) = p ( m ) T E ¯ ( 1 , m ) ( S ) p ( m ) p ( m ) T E ¯ ( 2 , m ) ( S ) p ( m )
The common spatial pattern (CSP) algorithm [12,13,14] finds the spatial filters that maximize or minimize the averaged variance ratio J as denoted by the following equation:
p m a x ( m ) = arg max p ( m ) J ( p ( m ) ) , p m i n ( m ) = arg min p ( m ) J ( p ( m ) ) .
The CSP feature vector, for the ith trial data for supporting channel set S in the mth frequency band, is defined as:
v i ( m ) = v i , m a x ( m ) v i , m i n ( m ) T ,
where
v i , m a x ( m ) = log v a r ( p m a x ( m ) T X i , m ( S ) ) , v i , m i n ( m ) = log v a r ( p m i n ( m ) T X i , m ( S ) ) .
For each trial i, the FBCSP approach selects feature vectors in discriminative frequency bands among the M filter-banks by using the mutual information based individual feature (MIBIF) algorithm [17]. The MIBIF algorithm computes the mutual information between feature vectors and its class label to select the discriminative filter-banks. By selecting the best two frequency bands, e.g., m 1 and m 2 , we obtain the FBCSP feature vector for the ith trial data:
v i = v i , m a x ( m 1 ) v i , m i n ( m 1 ) v i , m a x ( m 2 ) v i , m i n ( m 2 ) T .
In the training phase, { v i } and their corresponding known class label vector are fed to the SVM classifier.

3. Result and Discussion

We evaluated the proposed method in the task of classifying MI-task on publicly available BCI Competition III Dataset IVa and BCI Competition IV Dataset I. The classification performance of the proposed method was compared with TDP [24], FBCSP [17], FBRCSP [19], SCSP [20] and its filter-bank version denoted as FBSCSP, and CSP-R-MF [21].

3.1. BCI Competition Dataset IVa

The BCI Competition III Dataset IVa [28] was recorded from five healthy subjects, denoted as “al”, “aa”, “av”, “aw”, and “ay”. The five subjects each performed 140 trials involving right hand and right foot MI, divided into training and test set. Table 1 shows the number of training and test sets for the five subjects. Each subject performed the MI over 3.5 s after visual cue, and relaxed for a random length of time (1.75–2.25 s) thereafter. A total of 118 EEG channels corresponding to the positions of the extended international 10/20-system were used for recording, with a sampling rate of 100 Hz. The EEG data were bandpass-filtered between 0.05 and 200 Hz. In this experiment, we selectively used 18 channels ( K = 18 ) chosen based on the homunculus theory [29], as shown in Figure 2. The EEG signals in the time segment 0.5–2.5 s after presentation of the visual cue were bandpass-filtered using a fourth-order Butterworth filter operating at 0.5–40 Hz. For FBCSP, eight filter-banks were used for the frequency range 4–36 Hz, dividing evenly at 4-Hz intervals.

3.2. BCI Competition IV Dataset I

The BCI Competition IV Dataset I was recorded from four healthy subjects ( a , b , f and g ) and contains two MI EEG signal classes [30]. Fifty-nine EEG channels ( K = 59 ) were used to record the data, with a sampling rate of 100 Hz; these were bandpass-filtered between 0.05 Hz and 200 Hz. For each subject, the dataset consisted of 100 trials per class. This experiment used the EEG signals from 0.5 to 2.5 s after cue are used. For TDP extraction, the EEG signals were bandpass-filtered using a fourth-order Butterworth filter operating at 0.5–40 Hz. For FBCSP, eight filter-banks in the frequency range of 4–36 Hz that were divided evenly in 4-Hz intervals were used.

3.3. Experiment Results

The threshold, ρ t h r , used for configuring supporting channel set S, plays an important role in classification performance. We determined the optimal threshold value by cross-validation. This can be set as a constant for all subject, or on individual basis for each subject. Although optimization of threshold for each individual subject performed better, this paper presents the experiment results obtained under both settings. Table 2 and Table 3 lists the classification results for the BCI Competition III Dataset IVa. Table 2 shows the classification performance of the CSP approach and its variants, and of the TDP algorithm. Table 3 compares the frequency-optimized CSP variants using filter-banks. The existing frequency-optimized channel selection approaches, FBSCSP and CSP-R-MF, yielded better performance (87.76% and 87.11%, respectively) than the FBCSP and FBRCSP approaches. The proposed method, i.e., frequency-optimized channel selection based on TDP, achieved the best mean classification accuracy, of 89.13%, among all existing algorithms.
Table 4 lists the classification performance in terms of the threshold value ( ρ t h r ) and the corresponding size of the supporting channel set (in parenthesis).
Table 5 shows the classification performance of the proposed method for BCI Competition IV Dataset I. In this experiment, we tested the algorithms using a 5 × 5 cross-validation. The performance of the proposed method was compared with the frequency-optimized channel selection approaches: FBSCSP, the filter-bank version of the sparse CSP (SCSP) [20], and CSP-R-MF [21].
As shown in Table 5, the proposed method yielded the highest mean classification accuracy. Since BCI Competition III Dataset IVa consists of the training and test data specified by BCI Competition III organizers, the performance evaluation based on the Dataset IVa might be overfitted. However, the performance evaluation using BCI Competition IV Dataset I based on cross-validation justified the high performance of the proposed method for an arbitrary training set.
Table 6 lists the classification performance in terms of the threshold value and the corresponding size of the supporting channel set (in parenthesis) for BCI Competition IV Dataset I.

4. Conclusions

In this paper, we present a motor imagery (MI) classification algorithm using FBCSP features based on a MI-relevant channel selection. The proposed algorithm uses the Fisher ratio of TDPs and correlation coefficients to obtain a set of channels supporting the principle channel. The FBCSP features generated from the supporting channel set significantly improved the classification performance over existing method, as evaluated using BCI Competition datasets.

Author Contributions

All authors contributed equally to this work. The final manuscript has been read and approved by all authors for submission.

Funding

This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2017-0-00432, Development of non-invasive integrated BCI SW platform to control home appliances and external devices by user’s thought via AR/VR interface) and Institute for Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2017-0-00451, Development of BCI based Brain and Cognitive Computing Technology for Recognizing User’s Intentions using Deep Learning).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wolpaw, J.R.; Birbaumer, N.; Heetderks, W.J.; McFarland, D.J.; Peckham, P.H.; Schalk, G.; Donchin, E.; Quatrano, L.A.; Robinson, C.J.; Vaughan, T.M. Brain-computer interface technology: A review of the first international meeting. IEEE Trans. Rehabil. Eng. 2000, 8, 164–173. [Google Scholar] [CrossRef] [PubMed]
  2. Curran, E.A.; Stokes, M.J. Learning to control brain activity: A review of the production and control of EEG components for driving brain-computer interface (BCI) systems. Brain Cognit. 2003, 51, 326–336. [Google Scholar] [CrossRef]
  3. Birbaumer, N. Brain-computer-interface research: Coming of age. Clin. Neurophysiol. 2006, 17, 479–483. [Google Scholar] [CrossRef] [PubMed]
  4. Katona, J.; Kovari, A. Examining the Learning Efficiency by a Brain-Computer Interface System. Acta Polytech. Hung. 2018, 15, 251–280. [Google Scholar]
  5. Kreilinger, A.; Hiebel, H.; MÜller-Putz, G.R. Single versus multiple events error potential detection in a BCI-controlled car game with continuous and discrete feedback. IEEE Trans. Biomed. Eng. 2016, 63, 519–529. [Google Scholar] [CrossRef]
  6. Wolpaw, J.R.; Birbaumer, N.; McFarland, D.J.; Pfurtscheller, G.; Vaughan, T.M. Brain-computer interfaces for communication and control. Clin. Neurophysiol. 2002, 113, 767–791. [Google Scholar] [CrossRef]
  7. Neuper, C.; Wörtz, M.; Pfurtscheller, G. ERD/ERS patterns reflecting sensorimotor activation and deactivation. Prog. Brain Res. 2006, 159, 211–222. [Google Scholar]
  8. Pfurtscheller, G.; Brunner, C.; Schlögl, A.; Lopes da Silva, F.H. Mu rhythm (de)synchronization and EEG single-trial classification of different motor imagery tasks. NeuroImage 2006, 31, 153–159. [Google Scholar] [CrossRef]
  9. Hamedi, H.; Salleh, S.H.; Noor, A.M. Electroencephalographic motor imagery brain connectivity analysis for BCI: A review. Neural Comput. 2016, 28, 999–1041. [Google Scholar] [CrossRef]
  10. Graimann, B.; Pfurtscheller, G. Quantification and visualization of event-related changes in oscillatory brain activity in the time frequency domain. Prog. Brain Res. 2006, 159, 79–97. [Google Scholar]
  11. Naeem, M.; Brunner, C.; Pfurtscheller, G. Dimensionality reduction and channel selection of motor imagery electroencephalographic data. Comput. Intell. Neurosci. 2009, 1, 1005–1009. [Google Scholar] [CrossRef] [PubMed]
  12. Blankertz, B.; Tomioka, R.; Lemm, S.; Kawanabe, M.; Müller, K.-R. Optimizing spatial filters for robust EEG single-trial analysis. IEEE Signal Process. Mag. 2008, 25, 41–56. [Google Scholar] [CrossRef]
  13. Ramoser, H.; Müller-Gerking, J.; Pfurtscheller, G. Optimal spatial filtering of single trial EEG during imagined hand movement. IEEE Trans. Rehabil. Eng. 2008, 8, 441–446. [Google Scholar] [CrossRef]
  14. Müller-Gerking, J.; Pfurtscheller, G.; Flyvbjerg, H. Designing optimal spatial filters for single-trial EEG classification in a movement task. Clin. Neurophysiol. 1999, 110, 787–798. [Google Scholar] [CrossRef]
  15. Wang, H.; Tang, Q.; Zheng, W. L1-norm-based common spatial patterns. IEEE Trans. Biomed. Eng. 2012, 59, 653–662. [Google Scholar] [CrossRef]
  16. Ang, K.K.; Chin, Z.Y.; Zhang, H.; Guan, C. Filter bank common spatial pattern (FBCSP) in brain-computer interface. In Proceedings of the 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), Hong Kong, China, 1–8 June 2008; pp. 2390–2397. [Google Scholar]
  17. Ang, K.K.; Chin, Z.Y.; Wang, C.; Guan, C.; Zhang, H. Filter bank common spatial pattern algorithm on BCI Competition IV datasets 2a and 2b. Frontiers Neurosci. 2012, 6, 1–9. [Google Scholar] [CrossRef]
  18. Lotte, F.; Guan, C. Regularizing common spatial patterns to improve BCI designs: Unified theory and new algorithms. IEEE Trans. Biomed. Eng. 2011, 58, 355–362. [Google Scholar] [CrossRef]
  19. Park, S.; Lee, D.; Lee, S. Filter Bank Regularized Common Spatial Pattern Ensemble for Small Sample Motor Imagery Classification. IEEE Trans. Neural Syst. Rehabil. Eng. 2018, 26, 498–505. [Google Scholar] [CrossRef]
  20. Arvaneh, M.; Guan, C.; Ang, K.K.; Quek, C. Optimizing the channel Selection and Classification Accuracy in EEG-Based BCI. IEEE Trans. Biomed. Eng. 2011, 58, 1865–1873. [Google Scholar] [CrossRef]
  21. Feng, J.K.; Jin, J.; Daly, I.; Zhou, J.; Niu, Y.; Wang, X.; Cichocki, A. An Optimized Channel Selection Method Based on Multifrequency CSP-Rank for Motor Imagery-Based BCI System. Comput. Intell. Neurosci. 2019, 2019, 1–10. [Google Scholar] [CrossRef] [Green Version]
  22. Belwafi, k.; Romain, O.; Gannouni, S.; Ghaffari, F.; Djemal, R.; Ouni, B. An embedded implementation based on adaptive filter bank for brain–computer interface systems. J. Neurosci. Methods 2018, 305, 1–16. [Google Scholar] [CrossRef] [PubMed]
  23. Vidaurre, C.; Kramer, N.; Blankertz, B.; Schlögl, A. Time domain parameters as a feature for EEG-based brain–computer interfaces. Neural Netw. 2009, 22, 1313–1319. [Google Scholar] [CrossRef] [PubMed]
  24. Yang, Y.; Kyrgyzov, O.; Wiart, J.; Bloch, I. Subject-specific channel selection for classification of motor imagery electroencephalographic data. In Proceedings of the ICASSP IEEE International Conference on Acoustics Speech and Signal Processing, Vancouver, BC, Canada, 26–31 May 2013; pp. 1277–1280. [Google Scholar]
  25. Li, X.; Guan, C.; Zhang, H.; Ang, K.K. A Unified Fishers Ratio Learning Method for Spatial Filter Optimization. IEEE Trans. Neural Netw. Learn. Syst. 2017, 28, 2727–2737. [Google Scholar] [CrossRef] [PubMed]
  26. Ye, J.; Xiong, T. Svm versus least squares svm. In Proceedings of the The 11th International Conference on Artificial Intelligence and Statistics (AISTATS), San Juan, Puerto Rico, 21–24 March 2007; Volume 2, pp. 640–647. [Google Scholar]
  27. Müller, K.R.; Krauledat, M.; Dornhege, G.; Curio, G.; Blankertz, B. Machine learning techniques for brain-computer interfaces. Biomed. Eng. Biomed. Tech. 2004, 49, 11–22. [Google Scholar]
  28. Data Set IVa for the BCI Competition III. Available online: http://www.bbci.de/competition/iii/desc IVa.html (accessed on 15 June 2005).
  29. Deklerk, C.; Johnson, M.H.; Southgate, V. An EEG study on the somatotopic organisation of sensorimotor cortex activation during action execution and observation in infancy. Dev. Cognit. Neurosci. 2015, 15, 1–10. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  30. Blankertz, B.; Dornhege, G.; Krauledat, M.; Curio, G.; Müller, K.-R. The noninvasive Berlin Brain-Computer Interface: Fast acquisition of effective performance in untrained subjects. NeuroImage 2007, 37, 539–550. [Google Scholar] [CrossRef]
Figure 1. Block diagram of the proposed method.
Figure 1. Block diagram of the proposed method.
Sensors 19 03769 g001
Figure 2. Locations of the 18 channels ( K = 18 ) in BCI Competition III Dataset IVa.
Figure 2. Locations of the 18 channels ( K = 18 ) in BCI Competition III Dataset IVa.
Sensors 19 03769 g002
Table 1. BCI Competition III Dataset IVa.
Table 1. BCI Competition III Dataset IVa.
SubjectTraining DataTest Data
al22456
aa168112
aw84196
av56224
ay28252
Table 2. Classification accuracy of the CSP variations and TDP algorithm for 18 channels ( K = 18 ) BCI Competition III Dataset IVa.
Table 2. Classification accuracy of the CSP variations and TDP algorithm for 18 channels ( K = 18 ) BCI Competition III Dataset IVa.
SubjectCSPSCSPRCSPTDP
al94.6494.698.21100
aa84.8288.3984.8275
av61.2261.2262.2465.82
aw77.6880.0281.2579.46
ay82.5482.1488.4989.68
mean80.1881.2883.0082.00
Table 3. Classification accuracy of the FBCSP variations and proposed method for 18 channels ( K = 18 ) BCI Competition III Dataset IVa.
Table 3. Classification accuracy of the FBCSP variations and proposed method for 18 channels ( K = 18 ) BCI Competition III Dataset IVa.
SubjectFBCSPFBRCSPFBSCSPCSP-R-MFProposed MethodProposed Method
(Constant Threshold, ρ thr = 0.6 )(Individual Threshold)
al94.6494.64100100100100 ( ρ t h r = 0.6 )
aa88.3991.0790.1889.2990.1891.96 ( ρ t h r = 0.7 )
av71.427570.9173.4672.4572.45 ( ρ t h r = 0.6 )
aw78.2176.7888.3987.588.3988.39 ( ρ t h r = 0.6 )
ay83.7393.6589.3185.3192.8692.86 ( ρ t h r = 0.6 )
mean83.2886.2387.7687.1188.7889.13
Table 4. Threshold and classification performance of the proposed method for 18 channels ( K = 18 ) BCI Competition III Dataset IVa.
Table 4. Threshold and classification performance of the proposed method for 18 channels ( K = 18 ) BCI Competition III Dataset IVa.
Subject ρ thr = 0.6 ρ thr = 0.65 ρ thr = 0.7 ρ thr = 0.75 ρ thr = 0.8
al100 (13)98.21 (11)98.21 (10)98.21 (7)98.21 (7)
aa90.18 (15)90.18 (12)91.96 (10)91.96 (10)87.5 (9)
av72.45 (17)72.45 (17)70.41(14)63.78 (12)58.16 (9)
aw88.39 (12)80.80 (10)77.23 (9)77.23 (9)76.34 (8)
ay92.86 (10)92.86 (10)92.86 (10)87.7 (8)87.7 (6)
mean88.7886.986.1383.7881.58
Table 5. The 5 × 5 cross-validation classification accuracy of the proposed methods and frequency-optimized channel selection methods for BCI Competition IV Dataset I.
Table 5. The 5 × 5 cross-validation classification accuracy of the proposed methods and frequency-optimized channel selection methods for BCI Competition IV Dataset I.
SubjectFBCSPFBSCSPCSP-R-MFProposed MethodProposed Method
(Constant Threshold, ρ thr = 0.75 )(Individual Threshold)
a7579.581.586.586.5 ( ρ t h r = 0.75 )
b5455.56353.557.25 ( ρ t h r = 0.7 )
f80.7582.757989.592.5 ( ρ t h r = 0.8 )
g92.59387.590.590.5 ( ρ t h r = 0.75 )
mean75.5677.6977.7580.0081.69
Table 6. Threshold and classification performance of proposed method for BCI Competition IV Dataset I.
Table 6. Threshold and classification performance of proposed method for BCI Competition IV Dataset I.
Subject ρ thr = 0.7 ρ thr = 0.75 ρ thr = 0.8 ρ thr = 0.85 ρ thr = 0.9
a82.75 (27)86.5 (23)83.75 (18)82.5 (12)82.75 (7)
b57.25 (49)53.5 (26)51.5 (19)55.5 (12)55 (8)
f88.5 (50)89.5 (43)92.5 (35)91.75 (30)89.5 (17)
g90.25 (15)90.5 (15)83 (10)82.75 (7)79.5 (5)
mean79.6980.0077.6978.1376.69

Share and Cite

MDPI and ACS Style

Park, Y.; Chung, W. Selective Feature Generation Method Based on Time Domain Parameters and Correlation Coefficients for Filter-Bank-CSP BCI Systems. Sensors 2019, 19, 3769. https://doi.org/10.3390/s19173769

AMA Style

Park Y, Chung W. Selective Feature Generation Method Based on Time Domain Parameters and Correlation Coefficients for Filter-Bank-CSP BCI Systems. Sensors. 2019; 19(17):3769. https://doi.org/10.3390/s19173769

Chicago/Turabian Style

Park, Yongkoo, and Wonzoo Chung. 2019. "Selective Feature Generation Method Based on Time Domain Parameters and Correlation Coefficients for Filter-Bank-CSP BCI Systems" Sensors 19, no. 17: 3769. https://doi.org/10.3390/s19173769

APA Style

Park, Y., & Chung, W. (2019). Selective Feature Generation Method Based on Time Domain Parameters and Correlation Coefficients for Filter-Bank-CSP BCI Systems. Sensors, 19(17), 3769. https://doi.org/10.3390/s19173769

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop