Multi-scale 3D-CRU for EEG emotion recognition.

In this paper, we propose a novel multi-scale 3D-CRU model, with the goal of extracting more discriminative emotion feature from EEG signals. By concurrently exploiting the relative electrode locations and different frequency subbands of EEG signals, a three-dimensional feature representation is reconstructed wherein the Delta (δ) frequency pattern is included. We employ a multi-scale approach, termed 3D-CRU, to concurrently extract frequency and spatial features at varying levels of granularity within each time segment. In the proposed 3D-CRU, we introduce a multi-scale 3D Convolutional Neural Network (3D-CNN) to effectively capture discriminative information embedded within the 3D feature representation. To model the temporal dynamics across consecutive time segments, we incorporate a Gated Recurrent Unit (GRU) module to extract temporal representations from the time series of combined frequency-spatial features. Ultimately, the 3D-CRU model yields a global feature representation, encompassing comprehensive information across time, frequency, and spatial domains. Numerous experimental assessments conducted on publicly available DEAP and SEED databases provide empirical evidence supporting the enhanced performance of our proposed model in the domain of emotion recognition. These findings underscore the efficacy of the features extracted by the proposed multi-scale 3D-GRU model, particularly with the incorporation of the Delta (δ) frequency pattern. Specifically, on the DEAP dataset, the accuracy of Valence and Arousal are 93.12% and 94.31%, respectively, while on the SEED dataset, the accuracy is 92.25%.

Efficient CSP Algorithm With Spatio-Temporal Filtering for Motor Imagery Classification.

Common spatial pattern (CSP) is an efficient algorithm widely used in feature extraction of EEG-based motor imagery classification. Traditional CSP depends only on spatial filtering, that aims to maximize or minimize the ratio of variances of filtered EEG signals in different classes. Recent advances of CSP approaches show that temporal filtering is also preferable to extract discriminative features. In view of this perspective, a novel spatio-temporal filtering strategy is proposed in this paper. To improve computational efficiency and alleviate the overfitting issue frequently encountered in the case of small sample size, the same temporal filter is designed by EEG signals of the same class and shared by all the spatial channels. Spatial and temporal filters can be updated alternatively in practice. Furthermore, each of the resulting designs can still be cast as a CSP problem and tackled efficiently by the eigenvalue decomposition. To alleviate the adverse effects of outliers or noisy EEG channels, sparse spatial or temporal filters can also be achieved by incorporating an l1 -norm-based regularization term in our CSP problem. The regularized spatial or temporal filter design is iteratively reformulated as a CSP problem via the reweighting technique. Two sets of motor imagery EEG data of BCI competitions are used in our experiments to verify the effectiveness of the proposed algorithm.

Multirate-based fast parallel algorithms for 2-D DHT-based real-valued discrete Gabor transform.

Novel algorithms for the multirate and fast parallel implementation of the 2-D discrete Hartley transform (DHT)-based real-valued discrete Gabor transform (RDGT) and its inverse transform are presented in this paper. A 2-D multirate-based analysis convolver bank is designed for the 2-D RDGT, and a 2-D multirate-based synthesis convolver bank is designed for the 2-D inverse RDGT. The parallel channels in each of the two convolver banks have a unified structure and can apply the 2-D fast DHT algorithm to speed up their computations. The computational complexity of each parallel channel is low and is independent of the Gabor oversampling rate. All the 2-D RDGT coefficients of an image are computed in parallel during the analysis process and can be reconstructed in parallel during the synthesis process. The computational complexity and time of the proposed parallel algorithms are analyzed and compared with those of the existing fastest algorithms for 2-D discrete Gabor transforms. The results indicate that the proposed algorithms are the fastest, which make them attractive for real-time image processing.

Fast parallel approach for 2-D DHT-based real-valued discrete Gabor transform.

Two-dimensional fast Gabor transform algorithms are useful for real-time applications due to the high computational complexity of the traditional 2-D complex-valued discrete Gabor transform (CDGT). This paper presents two block time-recursive algorithms for 2-D DHT-based real-valued discrete Gabor transform (RDGT) and its inverse transform and develops a fast parallel approach for the implementation of the two algorithms. The computational complexity of the proposed parallel approach is analyzed and compared with that of the existing 2-D CDGT algorithms. The results indicate that the proposed parallel approach is attractive for real time image processing.