Skip to content
naulon
Not checkedNot checked for notices yet.

Semi-Skipping Layered Gated Unit and Efficient Network: Hybrid Deep Feature Selection Method for Edge Computing in EEG-Based Emotion Classification

Muhammad Adeel Asghar, Muhammad Jamil Khan, Humayun Shahid and 3 more

IEEE Access · 2021

doi:10.1109/access.2021.3051808 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this article, we propose a novel feature selection method based on hybrid neural networks for emotional classification avoiding expensive computation. With the development of neural networks for machine learning tools, the Electroencephalogram (EEG)-based classification of human emotions is increasingly important in providing health-care for Edge Computing in support of multiple Internet of Things (IoT) applications. However, classifying emotions through EEG signals is very challenging due to the low temporal boundaries and non-linear nature of EEG signals. Regarding non-linearity, we propose a hierarchical Semi-skipping Layered Gated Unit (SLGU) besides Efficient Network (ENet) for feature extraction. For faster processing, we have introduced a semi-skipping layer for Gated Recurrent Units (GRU) in Recurrent Neural Networks (RNN). The entered layer automatically skips the divergent factor during network training. Preprocessed EEG signals are sent to the hybrid SLGU-ENet model for deep feature extraction. To overcome the computational cost, an optimal function reduction method called the Bag of Visualized Characteristics (BoVC) is used. The entire facility is verified against two publicly available datasets. The results show that the classification performance of the proposed model achieves superior classification precision in a short processing time compared to the state-of-the-art models. The proposed algorithm required around 1.2-5 seconds, suitable for real-time IoT applications.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.