| Literature DB >> 35783367 |
Rongkai Zhang1, Ying Zeng1,2, Li Tong1, Jun Shu1, Runnan Lu1, Zhongrui Li1, Kai Yang1, Bin Yan1.
Abstract
Electroencephalogram (EEG) authentication has become a research hotspot in the field of information security due to its advantages of living, internal, and anti-stress. However, the performance of identity authentication system is limited by the inherent attributes of EEG, such as low SNR, low stability, and strong randomness. Researchers generally believe that the in-depth fusion of features can improve the performance of identity authentication and have explored among various feature domains. This experiment invited 70 subjects to participate in the EEG identity authentication task, and the experimental materials were visual stimuli of the self and non-self-names. This paper proposes an innovative EEG authentication framework, including efficient three-dimensional representation of EEG signals, multi-scale convolution structure, and the combination of multiple authentication strategies. In this work, individual EEG signals are converted into spatial-temporal-frequency domain three-dimensional forms to provide multi-angle mixed feature representation. Then, the individual identity features are extracted by the various convolution kernel of multi-scale vision, and the strategy of combining multiple convolution kernels is explored. The results show that the small-size and long-shape convolution kernel is suitable for ERP tasks, which can obtain better convergence and accuracy. The experimental results show that the classification performance of the proposed framework is excellent, and the multi-scale convolution method is effective to extract high-quality identity characteristics across feature domains. The results show that the branch number matches the EEG component number can obtain the excellent cost performance. In addition, this paper explores the network training performance for multi-scale module combination strategy and provides reference for deep network construction strategy of EEG signal processing.Entities:
Keywords: 3D-CNN; EEG; ERP; identity authentication; multi-scale
Year: 2022 PMID: 35783367 PMCID: PMC9243312 DOI: 10.3389/fnbot.2022.901765
Source DB: PubMed Journal: Front Neurorobot ISSN: 1662-5218 Impact factor: 3.493
Figure 1Task paradigm of EEG authentication.
Figure 2EEG identity authentication experimental flow chart.
Figure 3Three-dimensional transformation flow chart of EEG. (A) EEG after preprocessing. (B) Time-frequency energy diagram of separated channels. (C) Spatial–temporal–frequency domain combinations of EEG three-dimensional tensor.
Figure 4The architecture of multi-scale vision convolution module.
Figure 53D Multi-scale convolutional framework for EEG authentication.
Architecture of main neural networks for EEG authentication.
|
|
|
|
|
|
|
|
|
|
|
| |
|---|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
|
|
|
|
|
| ||||
| Multi-scale visual module(a) | Conv(a1)/ padding | (24) × 1 × 7/0 × 0 | (24) × 9 × 7/0 × 0 | (24) × 5 × 9 × 7/0 × 0 | (24) × 1 × 7/0 × 2 | (24) × 3 × 7/0 × 2 | (24) × 7 × 7/2 × 2 | (24) × 7 × 3/0 × 2 × 0 | (24) × 6 × 3 × 7/0 × 0 × 2 | (24) × 6 × 7 × 7/0 × 2 × 2 | (24) × 6 × 7 × 3/0 × 2 × 0 |
| Conv(a2)/ | / | / | / | (24) × 1 × 5/0 × 1 | (24) × 3 × 5/0 × 1 | (24) × 5 × 5/1 × 1 | (24) × 5 × 3/0 × 1 × 0 | (24) × 6 × 3 × 5/0 × 0 × 1 | (24) × 6 × 5 × 5/0 × 1 × 1 | (24) × 6 × 5 × 3/0 × 1 × 0 | |
| Conv(a3) /padding | / | / | / | (24) × 1 × 3/0 × 0 | (24) × 3 × 3/0 × 0 | (24) × 3 × 3/0 × 0 | (24) × 3 × 3/0 × 0 | (24) × 6 × 3 × 3/0 × 0 × 0 | (24) × 6 × 3 × 3/0 × 0 × 0 | (24) × 6 × 3 × 3/0 × 0 × 0 | |
| Max pool(a) | 1 × 2 | 2 × 2 | 1 × 2 × 2 | 1 × 2 | 2 × 2 | 2 × 2 | 2 × 2 | 1 × 2 × 2 | 1 × 2 × 2 | 1 × 2 × 2 | |
| Multi-scale visual module(b) | Conv(b1) /padding | (72) × 1 × 7/0 × 0 | (24) × 12 × 8/0 × 0 | (72) × 7 × 12 × 8/0 × 0 | (72) × 1 × 7/0 × 2 | (72) × 3 × 7/0 × 2 | (72) × 7 × 7/2 × 2 | (72) × 7 × 3/0 × 2 × 0 | (72) × 6 × 3 × 7/0 × 0 × 2 | (72) × 6 × 7 × 7/0 × 2 × 2 | (72) × 6 × 7 × 3/0 × 2 × 0 |
| Conv(b2) /padding | / | / | / | (72) × 1 × 5/0 × 1 | (72) × 3 × 5/0 × 1 | (72) × 5 × 5/1 × 1 | (72) × 5 × 3/0 × 1 × 0 | (72) × 6 × 3 × 5/0 × 0 × 1 | (72) × 6 × 5 × 5/0 × 1 × 1 | (72) × 6 × 5 × 3/0 × 1 × 0 | |
| Conv(b3) /padding | / | / | / | (72) × 1 × 3/0 × 0 | (72) × 3 × 3/0 × 0 | (72) × 3 × 3/0 × 0 | (72) × 3 × 3/0 × 0 | (72) × 6 × 3 × 3/0 × 0 × 0 | (72) × 6 × 3 × 3/0 × 0 × 0 | (72) × 6 × 3 × 3/0 × 0 × 0 | |
| Max pool(b) | 1 × 2 | 4 × 4 | 1 × 4 × 4 | 1 × 2 | 2 × 2 | 2 × 2 | 2 × 2 | 1 × 2 × 2 | 1 × 2 × 2 | 1 × 2 × 2 | |
| Multi-scale visual module(c) | Conv(c1) /padding | (72) × 1 × 7/0 × 0 | (24) × 6 × 4/0 × 0 | (72) × 6 × 6 × 4/0 × 0 | (72) × 1 × 7/0 × 2 | (72) × 3 × 7/0 × 2 | (72) × 7 × 7/2 × 2 | (72) × 7 × 3/2 × 0 | (72) × 6 × 3 × 7/0 × 0 × 2 | (72) × 6 × 7 × 7/0 × 2 × 2 | (72) × 6 × 7 × 3/0 × 2 × 0 |
| Conv(c2) /padding | / | / | / | (72) × 1 × 5/0 × 1 | (72) × 3 × 5/0 × 1 | (72) × 5 × 5/1 × 1 | (72) × 5 × 3/0 × 1 × 0 | (72) × 6 × 3 × 5/0 × 0 × 1 | (72) × 6 × 5 × 5/0 × 1 × 1 | (72) × 6 × 5 × 3/0 × 1 × 0 | |
| Conv(c3) /padding | / | / | / | (72) × 1 × 3/0 × 0 | (72) × 3 × 3/0 × 0 | (72) × 3 × 3/0 × 0 | (72) × 3 × 3/0 × 0 | (72) × 6 × 3 × 3/0 × 0 × 0 | (72) × 6 × 3 × 3/0 × 0 × 0 | (72) × 6 × 3 × 3/0 × 0 × 0 | |
| Max pool(c) | 1 × 6 | 2 × 2 | / | 1 × 5 | 5 × 5 | 5 × 5 | 5 × 5 | 1 × 5 × 5 | 1 × 5 × 5 | 1 × 5 × 5 | |
| Dropout | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | |
| Linear | 16 × 3 × 72 | 72 × 3 × 2 | 72 × 3 × 2 × 1 | 16 × 4 × 72 | 4 × 2 × 72 | 4 × 2 × 72 | 4 × 2 × 72 | 1 × 4 × 2 × 72 | 1 × 4 × 2 × 72 | 1 × 4 × 2 × 72 | |
| Dropout | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | 0.4 | |
| Linear | 32 | 32 | 32 | 32 | 32 | 32 | 32 | 32 | 32 | 32 | |
| Softmax | 2 | 2 | 2 | 2 | 2 | 2 | 2 | 2 | 2 | 2 |
Figure 6Network training loss of single-scale convolution kernel. (a) The important inflection points of network loss convergence. The loss functions of different convolution kernels decrease rapidly before 1,000 iterations. Additionally, the loss function curves of all convolution kernels tend to be flat before 3,000 rounds. (b) The loss function performance of different convolution kernels after multi-round iteration. Long-shape and small-size convolution kernels are suitable for feature extraction of ERP tasks.
Figure 7Test accuracy of single-scale convolution kernel.
Figure 8Classification performance of multiple authentication strategies.
Figure 9Classification performance of multi-layer, multi-branch network architecture.
Figure 10Visualization of intermediate feature layer of multi-scale convolution structure.
Figure 11Training time consumption of different EEG authentication strategies.
Figure 12The convolution kernel corresponds to the real size of EEG data.
Convolution kernel size corresponds to real EEG window size.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The bold value shows the best three convolution kernel shapes.