Highly secure access control requires Swiss-cheese-type multi-layer security protocols. The use of electroencephalogram (EEG) to provide cognitive indicators for human workload and fatigue has created environments where the EEG data are well-integrated into systems, making it readily available for more forms of innovative uses including biometrics. However, most of the existing studies on EEG biometrics rely on resting state signals or require specific and repetitive sensory stimulation, limiting their uses in naturalistic settings. Moreover, the limited discriminatory power of uni-variate measures denies an opportunity to use dependences information inherent in brain regions to design more robust biometric identifiers. In this paper, we proposed a novel model for ongoing EEG biometric identification using EEG collected during a diverse set of tasks. The novelty lies in representing EEG signals as a graph based on within-frequency and cross-frequency functional connectivity estimates, and the use of graph convolutional neural network (GCNN) to automatically capture deep intrinsic structural representations from the EEG graphs for person identification. An extensive investigation was carried out to assess the robustness of the method against diverse human states, including resting states under eye-open and eye-closed conditions and active states drawn during the performance of four different tasks. We compared our method with the state-of-the-art EEG features, classifiers, and models of EEG biometrics. Results show that the representation drawn from EEG functional connectivity graphs demonstrates more robust biometric traits than direct use of uni-variate features. Moreover, the GCNN can effectively and efficiently capture discriminative traits, thus generalizing better over diverse human states.
EEG signals could reveal unique information of an individual's brain activities. They have been regarded as one of the most promising biometric signals for person identification and verification. Steady-State Visual Evoked Potentials (SSVEPs), as EEG responses to visual stimulations at specific frequencies, could provide biometric information. However, current methods on SSVEP biometrics with hand-crafted power spectrum features and canonical correlation analysis (CCA) present only a limited range of individual distinctions and suffer relatively low accuracy. In this paper, we propose convolution neural networks (CNNs) with raw SSVEPs for person identification and verification without the need for any hand-crafted features. We conduct a comprehensive comparison between the performance of CNN with raw signals and a number of classical methods on two SSVEP datasets consisting of four and ten subjects, respectively. The proposed method achieved an averaged identification accuracy of 96.8%±0.01, which outperformed the other methods by an average of 45.5% (p-value <; 0.05). In addition, it achieved an averaged False Acceptance Rate (FAR) of 1.53%±0.01 and True Acceptance Rate (TAR) of 97.09%±0.02 for person verification. The averaged verification accuracy is 98.34% ± 0.01, which outperformed the other methods by an average of 11.8% (p-value <; 0.05). The proposed method based on deep learning offers opportunities to design a general-purpose EEG-based biometric system without the need for complex pre-processing and feature extraction techniques, making it feasible for real-time embedded systems.
Despite the extensive literature investigating stylometry analysis in authorship attribution research, translator stylometry is an understudied research area. The identification of translator stylometry contributes to many fields including education, intellectual property rights and forensic linguistics. In a two stage process, this paper first evaluates the use of existing lexical measures for the translator stylometry problem. Similar to previous research we found that using vocabulary richness in its traditional form as it has been used in the literature could not identify translator stylometry. This encouraged us to design an approach with the aim of identifying the distinctive patterns of a translator by employing network-motifs. Networks motifs are small sub-graphs which aim at capturing the local structure of a complex network. The proposed approach achieved an average accuracy of 83% in three-way classification. These results demonstrate that classic tools based on lexical features can be used for identifying translator stylometry if they get augmented with appropriate non-parametric scaling. Moreover, the use of complex network analysis and network motifs mining provided made it possible to design features that can solve translator stylometry analysis problems.
Sheepdogs smartly herd a flock of sheep and guide them towards a goal. A single dog can herd a few hundred sheep in easy to navigate environments. Understanding the interaction space between the sheepdogs, sheep and the environment is important due to the possibility of transferring this knowledge to solve practical swarm robotics problems. This interaction space is a complex mesh of influencing factors. We scrutinize this interaction space to identify areas where the complexity of the herding problem changes from low (easy to solve) to high (harder to solve or becoming unsolvable) complexity. In particular, we study reactive models for shepherding, whereby agents respond directly to stimuli in the environments by fusing the set of force vectors influencing their behaviour. We present an enhanced shepherding model with higher success rate than its predecessor. We investigate four key factors that influence the complexity of the problem: the relative speed between the sheepdog and sheep, the spatial configuration of the sheep at the start of the task, the number of sheepdogs, and the density of obstacles in the environment.We discovered a phase transition in shepherding resulting from the interaction between the number of sheepdogs and obstacles. The phase transition occurs as the density of obstacles range from 0:2% for a single shepherding agent to 5% for 10 shepherding agents. During this phase transition, the problem changes from being an easy problem where the flock gets collected quickly, to a hard one where the overall herding task becomes utterly not achievable using reactive approaches.
27 January 2021 in IEEE Transactions on Cybernetics
A single dataset could hide a significant number of relationships among its feature set. Learning these relationships simultaneously avoids the time complexity associated with running the learning algorithm for every possible relationship, and affords the learner with an ability to recover missing data and substitute erroneous ones by using available data. In our previous research, we introduced the gate-layer autoencoders (GLAEs), which offer an architecture that enables a single model to approximate multiple relationships simultaneously. GLAE controls what an autoencoder learns in a time series by switching on and off certain input gates, thus, allowing and disallowing the data to flow through the network to increase network’s robustness. However, GLAE is limited to binary gates. In this article, we generalize the architecture to weighted gate layer autoencoders (WGLAE) through the addition of a weight layer to update the error according to which variables are more critical and to encourage the network to learn these variables. This new weight layer can also be used as an output gate and uses additional control parameters to afford the network with abilities to represent different models that can learn through gating the inputs. We compare the architecture against similar architectures in the literature and demonstrate that the proposed architecture produces more robust autoencoders with the ability to reconstruct both incomplete synthetic and real data with high accuracy.