Quantifying the similarity between two networks is critical in many applications. A number of algorithms have been proposed to compute graph similarity, mainly based on the properties of nodes and edges. Interestingly, most of these algorithms ignore the physical location of the nodes, which is a key factor in the context of brain networks involving spatially defined functional areas. In this paper, we present a novel algorithm called “SimiNet” for measuring similarity between two graphs whose nodes are defined a priori within a 3D coordinate system. SimiNet provides a quantified index (ranging from 0 to 1) that accounts for node, edge and spatiality features. Complex graphs were simulated to evaluate the performance of SimiNet that is compared with eight state-of-art methods. Results show that SimiNet is able to detect weak spatial variations in compared graphs in addition to computing similarity using both nodes and edges. SimiNet was also applied to real brain networks obtained during a visual recognition task. The algorithm shows high performance to detect spatial variation of brain networks obtained during a naming task of two categories of visual stimuli: animals and tools. A perspective to this work is a better understanding of object categorization in the human brain.

Along with the study of brain activity evoked by external stimuli, the past two decades witnessed an increased interest in characterizing the spontaneous brain activity occurring during resting conditions. The identification of connectivity patterns in this so-called "resting-state" has been the subject of a great number of electrophysiology-based studies, using the Electro/Magneto-Encephalography (EEG/MEG) source connectivity method. However, no consensus has been reached yet regarding a unified (if possible) analysis pipeline, and several involved parameters and methods require cautious tuning. This is particularly challenging when different analytical choices induce significant discrepancies in results and drawn conclusions, thereby hindering the reproducibility of neuroimaging research. Hence, our objective in this study was to shed light on the effect of analytical variability on outcome consistency by evaluating the implications of parameters involved in the EEG source connectivity analysis on the accuracy of resting-state networks (RSNs) reconstruction. We simulated, using neural mass models, EEG data corresponding to two RSNs, namely the default mode network (DMN) and dorsal attentional network (DAN). We investigated the impact of five channel densities (19, 32, 64, 128, 256), three inverse solutions (weighted minimum norm estimate (wMNE), exact low-resolution brain electromagnetic tomography (eLORETA), and linearly constrained minimum variance (LCMV) beamforming) and four functional connectivity measures (phase-locking value (PLV), phase-lag index (PLI), and amplitude envelope correlation (AEC) with and without source leakage correction), on the correspondence between reconstructed and reference networks. We showed that, with different analytical choices related to the number of electrodes, source reconstruction algorithm, and functional connectivity measure, high variability is present in the results. More specifically, our results show that a higher number of EEG channels significantly increased the accuracy of the reconstructed networks. Additionally, our results showed significant variability in the performance of the tested inverse solutions and connectivity measures. Such methodological variability and absence of analysis standardization represent a critical issue for neuroimaging studies that should be prioritized. We believe that this work could be useful for the field of electrophysiology connectomics, by increasing awareness regarding the challenge of variability in methodological approaches and its implications on reported results.

Epileptic seizures result from abnormal brain activity, posing significant health risks due to their sudden and unpredictable nature. Accurate seizure prediction is crucial for improving patient outcomes and enabling timely interventions. Recent advancements in artificial intelligence (AI), particularly in machine learning (ML) and deep learning (DL), have significantly enhanced seizure detection and prediction. This review provides a comprehensive overview of seizure prediction models that integrate temporal and spectral features as inputs or enhanced representations for ML and DL models. Emphasizing convolutional neural networks (CNNs) and other deep architectures, we explore the role of time-domain and frequency-domain features, such as wavelet transforms, short-time Fourier transforms, and spectrogram representations, in improving model performance. Additionally, the review discusses common challenges, including feature interpretability, generalizability across datasets, and computational efficiency. By highlighting recent advancements and limitations, this study provides insights into optimizing spectral and temporal feature integration for seizure prediction, paving the way for more robust and clinically viable AI-based solutions.

In this paper, we propose, implement, and analyze the structures of two keyed hash functions using the Chaotic Neural Network (CNN). These structures are based on Sponge construction, and they produce two variants of hash value lengths, i.e., 256 and 512 bits. The first structure is composed of two-layered CNN, while the second one is formed by one-layered CNN and a combination of nonlinear functions. Indeed, the proposed structures employ two strong nonlinear systems, precisely a chaotic system and a neural network system. In addition, the proposed study is a new methodology of combining chaotic neural networks and Sponge construction that is proved secure against known attacks. The performance of the two proposed structures is analyzed in terms of security and speed. For the security measures, the number of hits of the two proposed structures doesn’t exceed 2 for 256-bit hash values and does not exceed 3 for 512-bit hash values. In terms of speed, the average number of cycles to hash one data byte (NCpB) is equal to 50.30 for Structure 1, and 21.21 and 24.56 for Structure 2 with 8 and 24 rounds, respectively. In addition, the performance of the two proposed structures is compared with that of the standard hash functions SHA-3, SHA-2, and with other classical chaos-based hash functions in the literature. The results of cryptanalytic analysis and the statistical tests highlight the robustness of the proposed keyed hash functions. It also shows the suitability of the proposed hash functions for the application such as Message Authentication, Data Integrity, Digital Signature, and Authenticated Encryption with Associated Data.