Pub Date : 2025-10-01Epub Date: 2025-07-31DOI: 10.1142/S0129065725500510
Yu Xue, Keyu Liu, Ferrante Neri
Neural Architecture Search (NAS) automates the design of deep neural networks but remains computationally expensive, particularly in multi-objective settings. Existing predictor-assisted evolutionary NAS methods suffer from slow convergence and rank disorder, which undermines prediction accuracy. To overcome these limitations, we propose CHENAS: a Classifier-assisted multi-objective Hybrid Evolutionary NAS framework. CHENAS combines the global exploration of evolutionary algorithms with the local refinement of gradient-based optimization to accelerate convergence and enhance solution quality. A novel dominance classifier predicts Pareto dominance relationships among candidate architectures, reframing multi-objective optimization as a classification task and mitigating rank disorder. To further improve efficiency, we employ a contrastive learning-based autoencoder that maps architectures into a continuous, structured latent space tailored for dominance prediction. Experiments on several benchmark datasets demonstrate that CHENAS outperforms state-of-the-art NAS approaches in identifying high-performing architectures across multiple objectives. Future work will focus on improving the computational efficiency of the framework and extending it to other application domains.
{"title":"Dominant Classifier-assisted Hybrid Evolutionary Multi-objective Neural Architecture Search.","authors":"Yu Xue, Keyu Liu, Ferrante Neri","doi":"10.1142/S0129065725500510","DOIUrl":"10.1142/S0129065725500510","url":null,"abstract":"<p><p>Neural Architecture Search (NAS) automates the design of deep neural networks but remains computationally expensive, particularly in multi-objective settings. Existing predictor-assisted evolutionary NAS methods suffer from slow convergence and rank disorder, which undermines prediction accuracy. To overcome these limitations, we propose CHENAS: a Classifier-assisted multi-objective Hybrid Evolutionary NAS framework. CHENAS combines the global exploration of evolutionary algorithms with the local refinement of gradient-based optimization to accelerate convergence and enhance solution quality. A novel dominance classifier predicts Pareto dominance relationships among candidate architectures, reframing multi-objective optimization as a classification task and mitigating rank disorder. To further improve efficiency, we employ a contrastive learning-based autoencoder that maps architectures into a continuous, structured latent space tailored for dominance prediction. Experiments on several benchmark datasets demonstrate that CHENAS outperforms state-of-the-art NAS approaches in identifying high-performing architectures across multiple objectives. Future work will focus on improving the computational efficiency of the framework and extending it to other application domains.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2550051"},"PeriodicalIF":6.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144755506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-01Epub Date: 2025-08-04DOI: 10.1142/S0129065725500522
Gabriel Rojas-Albarracín, António Pereira, Antonio Fernández-Caballero, María T López
Areas, such as the identification of human activity, have accelerated thanks to the immense development of artificial intelligence (AI). However, the lack of data is a major obstacle to even faster progress. This is particularly true in computer vision, where training a model typically requires at least tens of thousands of images. Moreover, when the activity a researcher is interested in is far from the usual, such as falls, it is difficult to have a sufficiently large dataset. An example of this could be the identification of people suffering from a heart attack. In this sense, this work proposes a novel approach that relies on generative models to extend image datasets, adapting them to generate more domain-relevant images. To this end, a refinement to stable diffusion models was performed using low-rank adaptation. A dataset of 100 images of individuals simulating infarct situations and neutral poses was created, annotated, and used. The images generated with the adapted models were evaluated using learned perceptual image patch similarity to test their closeness to the target scenario. The results obtained demonstrate the potential of synthetic datasets, and in particular the strategy proposed here, to overcome data sparsity in AI-based applications. This approach can not only be more cost-effective than building a dataset in the traditional way, but also reduces the ethical concerns of its applicability in smart environments, health monitoring, and anomaly detection. In fact, all data are owned by the researcher and can be added and modified at any time without requiring additional permissions, streamlining their research.
{"title":"Expanding Domain-Specific Datasets with Stable Diffusion Generative Models for Simulating Myocardial Infarction.","authors":"Gabriel Rojas-Albarracín, António Pereira, Antonio Fernández-Caballero, María T López","doi":"10.1142/S0129065725500522","DOIUrl":"10.1142/S0129065725500522","url":null,"abstract":"<p><p>Areas, such as the identification of human activity, have accelerated thanks to the immense development of artificial intelligence (AI). However, the lack of data is a major obstacle to even faster progress. This is particularly true in computer vision, where training a model typically requires at least tens of thousands of images. Moreover, when the activity a researcher is interested in is far from the usual, such as falls, it is difficult to have a sufficiently large dataset. An example of this could be the identification of people suffering from a heart attack. In this sense, this work proposes a novel approach that relies on generative models to extend image datasets, adapting them to generate more domain-relevant images. To this end, a refinement to stable diffusion models was performed using low-rank adaptation. A dataset of 100 images of individuals simulating infarct situations and neutral poses was created, annotated, and used. The images generated with the adapted models were evaluated using learned perceptual image patch similarity to test their closeness to the target scenario. The results obtained demonstrate the potential of synthetic datasets, and in particular the strategy proposed here, to overcome data sparsity in AI-based applications. This approach can not only be more cost-effective than building a dataset in the traditional way, but also reduces the ethical concerns of its applicability in smart environments, health monitoring, and anomaly detection. In fact, all data are owned by the researcher and can be added and modified at any time without requiring additional permissions, streamlining their research.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2550052"},"PeriodicalIF":6.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144786192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-01Epub Date: 2025-07-29DOI: 10.1142/S0129065725300013
Francisco Portal, Javier De Lope, Manuel Graña
Speech Emotion Recognition (SER) is becoming a key element of speech-based human-computer interfaces, endowing them with some form of empathy towards the emotional status of the human. Transformers have become a central Deep Learning (DL) architecture in natural language processing and signal processing, recently including audio signals for Automatic Speech Recognition (ASR) and SER. A central question addressed in this paper is the achievement of speaker-independent SER systems, i.e. systems that perform independently of a specific training set, enabling their deployment in real-world situations by overcoming the typical limitations of laboratory environments. This paper presents a comprehensive performance evaluation review of transformer architectures that have been proposed to deal with the SER task, carrying out an independent validation at different levels over the most relevant publicly available datasets for validation of SER models. The comprehensive experimental design implemented in this paper provides an accurate picture of the performance achieved by current state-of-the-art transformer models in speaker-independent SER. We have found that most experimental instances reach accuracies below 40% when a model is trained on a dataset and tested on a different one. A speaker-independent evaluation combining up to five datasets and testing on a different one achieves up to 58.85% accuracy. In conclusion, the SER results improved with the aggregation of datasets, indicating that model generalization can be enhanced by extracting data from diverse datasets.
{"title":"A Performance Benchmarking Review of Transformers for Speaker-Independent Speech Emotion Recognition.","authors":"Francisco Portal, Javier De Lope, Manuel Graña","doi":"10.1142/S0129065725300013","DOIUrl":"10.1142/S0129065725300013","url":null,"abstract":"<p><p>Speech Emotion Recognition (SER) is becoming a key element of speech-based human-computer interfaces, endowing them with some form of empathy towards the emotional status of the human. Transformers have become a central Deep Learning (DL) architecture in natural language processing and signal processing, recently including audio signals for Automatic Speech Recognition (ASR) and SER. A central question addressed in this paper is the achievement of speaker-independent SER systems, i.e. systems that perform independently of a specific training set, enabling their deployment in real-world situations by overcoming the typical limitations of laboratory environments. This paper presents a comprehensive performance evaluation review of transformer architectures that have been proposed to deal with the SER task, carrying out an independent validation at different levels over the most relevant publicly available datasets for validation of SER models. The comprehensive experimental design implemented in this paper provides an accurate picture of the performance achieved by current state-of-the-art transformer models in speaker-independent SER. We have found that most experimental instances reach accuracies below 40% when a model is trained on a dataset and tested on a different one. A speaker-independent evaluation combining up to five datasets and testing on a different one achieves up to 58.85% accuracy. In conclusion, the SER results improved with the aggregation of datasets, indicating that model generalization can be enhanced by extracting data from diverse datasets.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2530001"},"PeriodicalIF":6.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144736404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-01Epub Date: 2025-06-27DOI: 10.1142/S0129065725500479
Hussain Ahmad Madni, Hafsa Shujat, Axel De Nardin, Silvia Zottin, Gian Luca Foresti
Accurate anomaly detection in brain Magnetic Resonance Imaging (MRI) is crucial for early diagnosis of neurological disorders, yet remains a significant challenge due to the high heterogeneity of brain abnormalities and the scarcity of annotated data. Traditional one-class classification models require extensive training on normal samples, limiting their adaptability to diverse clinical cases. In this work, we introduce MadIRC, an unsupervised anomaly detection framework that leverages Inter-Realization Channels (IRC) to construct a robust nominal model without any reliance on labeled data. We extensively evaluate MadIRC on brain MRI as the primary application domain, achieving a localization AUROC of 0.96 outperforming state-of-the-art supervised anomaly detection methods. Additionally, we further validate our approach on liver CT and retinal images to assess its generalizability across medical imaging modalities. Our results demonstrate that MadIRC provides a scalable, label-free solution for brain MRI anomaly detection, offering a promising avenue for integration into real-world clinical workflows.
{"title":"Unsupervised Brain MRI Anomaly Detection via Inter-Realization Channels.","authors":"Hussain Ahmad Madni, Hafsa Shujat, Axel De Nardin, Silvia Zottin, Gian Luca Foresti","doi":"10.1142/S0129065725500479","DOIUrl":"10.1142/S0129065725500479","url":null,"abstract":"<p><p>Accurate anomaly detection in brain Magnetic Resonance Imaging (MRI) is crucial for early diagnosis of neurological disorders, yet remains a significant challenge due to the high heterogeneity of brain abnormalities and the scarcity of annotated data. Traditional one-class classification models require extensive training on normal samples, limiting their adaptability to diverse clinical cases. In this work, we introduce MadIRC, an unsupervised anomaly detection framework that leverages Inter-Realization Channels (IRC) to construct a robust nominal model without any reliance on labeled data. We extensively evaluate MadIRC on brain MRI as the primary application domain, achieving a localization AUROC of 0.96 outperforming state-of-the-art supervised anomaly detection methods. Additionally, we further validate our approach on liver CT and retinal images to assess its generalizability across medical imaging modalities. Our results demonstrate that MadIRC provides a scalable, label-free solution for brain MRI anomaly detection, offering a promising avenue for integration into real-world clinical workflows.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2550047"},"PeriodicalIF":6.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144510084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-01Epub Date: 2025-06-28DOI: 10.1142/S0129065725500480
María Paula Bonomini, Eduardo Ghiglioni, Noelia Belén Ríos
Graph theory has proven to be useful in studying brain dysfunction in Alzheimer's disease using MagnetoEncephaloGraphy (MEG) and fMRI signals. However, it has not yet been tested enough with reduced sets of electrodes, as in the 10-20 EEG. In this paper, we applied techniques from the Graph Spectral Analysis (GSA) derived from EEG signals of patients with Alzheimer, Frontotemporal Dementia and control subjects. A collection of global GSA metrics were computed, accounting for general properties of the adjacency or Laplacian matrices. Also, regional GSA metrics were calculated, disentangling centrality measures in five cortical regions (frontal, central, parietal, temporal and occipital). These two sort of measures were then utilized in a binary AD/controls classification problem to test their utility in AD diagnosis and identify most valuable parameters. The Theta band appeared as the most connected and synchronizable rhythm for all three groups. Also, it was the rhythm with most preserved connections among temporal electrodes, exhibiting the shortest average distances among [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text]. In addition, Theta emerged as the rhythm with the highest classification performances based on regional parameters according to a [Formula: see text] cross-validation scheme (mean [Formula: see text], mean [Formula: see text] and mean F1-[Formula: see text]). In general, regional parameters produced better classification performances for most of the rhythms, encouraging further investigation into GSA parameters with refined spatial and functional specificity.
{"title":"Graph Spectral Analysis Using Electroencephalography in Alzheimer Disease and Frontotemporal Dementia Patients.","authors":"María Paula Bonomini, Eduardo Ghiglioni, Noelia Belén Ríos","doi":"10.1142/S0129065725500480","DOIUrl":"https://doi.org/10.1142/S0129065725500480","url":null,"abstract":"<p><p>Graph theory has proven to be useful in studying brain dysfunction in Alzheimer's disease using MagnetoEncephaloGraphy (MEG) and fMRI signals. However, it has not yet been tested enough with reduced sets of electrodes, as in the 10-20 EEG. In this paper, we applied techniques from the Graph Spectral Analysis (GSA) derived from EEG signals of patients with Alzheimer, Frontotemporal Dementia and control subjects. A collection of global GSA metrics were computed, accounting for general properties of the adjacency or Laplacian matrices. Also, regional GSA metrics were calculated, disentangling centrality measures in five cortical regions (frontal, central, parietal, temporal and occipital). These two sort of measures were then utilized in a binary AD/controls classification problem to test their utility in AD diagnosis and identify most valuable parameters. The Theta band appeared as the most connected and synchronizable rhythm for all three groups. Also, it was the rhythm with most preserved connections among temporal electrodes, exhibiting the shortest average distances among [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text]. In addition, Theta emerged as the rhythm with the highest classification performances based on regional parameters according to a [Formula: see text] cross-validation scheme (mean [Formula: see text], mean [Formula: see text] and mean <i>F</i>1-[Formula: see text]). In general, regional parameters produced better classification performances for most of the rhythms, encouraging further investigation into GSA parameters with refined spatial and functional specificity.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":"35 9","pages":"2550048"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144585974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-01Epub Date: 2025-06-12DOI: 10.1142/S012906572550042X
Pablo Zubasti, Miguel A Patricio, Antonio Berlanga, Jose M Molina
The reduction of dimensionality in machine learning and artificial intelligence problems constitutes a pivotal element in the simplification of models, significantly enhancing both their performance and execution time. This process enables the generation of results more rapidly while also facilitating the scalability and optimization of systems that rely on such models. Two primary approaches are commonly employed to achieve dimensionality reduction: feature selection-based methods and those grounded in feature extraction. In this paper, we propose a distance-correlation feature space, upon which we define a dimensionality reduction algorithm based on space transformations and graph embeddings. This methodology is applied in the context of dementia diagnosis through learning models, with the overarching objective of optimizing the diagnostic process.
{"title":"Optimizing Dementia Diagnosis Through Distance-Correlation Feature Space and Dimensionality Reduction.","authors":"Pablo Zubasti, Miguel A Patricio, Antonio Berlanga, Jose M Molina","doi":"10.1142/S012906572550042X","DOIUrl":"10.1142/S012906572550042X","url":null,"abstract":"<p><p>The reduction of dimensionality in machine learning and artificial intelligence problems constitutes a pivotal element in the simplification of models, significantly enhancing both their performance and execution time. This process enables the generation of results more rapidly while also facilitating the scalability and optimization of systems that rely on such models. Two primary approaches are commonly employed to achieve dimensionality reduction: feature selection-based methods and those grounded in feature extraction. In this paper, we propose a distance-correlation feature space, upon which we define a dimensionality reduction algorithm based on space transformations and graph embeddings. This methodology is applied in the context of dementia diagnosis through learning models, with the overarching objective of optimizing the diagnostic process.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2550042"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144287655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-01Epub Date: 2025-06-01DOI: 10.1142/S0129065725500443
Juan A Barios, Yolanda Vales, Jose M Catalán, Andrea Blanco-Ivorra, David Martínez-Pascual, Nicolás García-Aracil
Task-oriented rehabilitation is essential for hand function recovery in stroke patients, and recent advancements in BCI-controlled exoskeletons and neural biomarkers - such as post-movement beta rebound (PMBR) - offer new pathways to optimize these therapies. Movement-related EEG signals from the sensorimotor cortex, particularly PMBR (post-movement) and event-related desynchronization (ERD, during movement), exhibit high task specificity and correlate with stroke severity. This study evaluated PMBR in 34 chronic stroke patients across two cohorts, along with a control group of 16 healthy participants, during voluntary and exoskeleton-assisted movement tasks. Longitudinal tracking in the second cohort enabled the analysis of PMBR changes, with EEG recordings acquired at three timepoints over a 30-session rehabilitation program. Findings revealed significant PMBR alterations in both passive and active movement tasks: patients with severe impairment lacked a PMBR dipole in the ipsilesional hemisphere, while moderately impaired patients showed a diminished response. The marked differences in PMBR patterns between stroke patients and controls highlight the extent of sensorimotor cortex disruption due to stroke. ERD showed minimal task-specific variation, underscoring PMBR as a more reliable biomarker of motor function impairment. These findings support the use of PMBR, particularly the PMBR/ERD ratio, as a biomarker for EEG-guided monitoring of motor recovery over time during exoskeleton-assisted rehabilitation.
{"title":"Post-Movement Beta Rebound for Longitudinal Monitoring of Motor Rehabilitation in Stroke Patients Using an Exoskeleton-Assisted Paradigm.","authors":"Juan A Barios, Yolanda Vales, Jose M Catalán, Andrea Blanco-Ivorra, David Martínez-Pascual, Nicolás García-Aracil","doi":"10.1142/S0129065725500443","DOIUrl":"https://doi.org/10.1142/S0129065725500443","url":null,"abstract":"<p><p>Task-oriented rehabilitation is essential for hand function recovery in stroke patients, and recent advancements in BCI-controlled exoskeletons and neural biomarkers - such as post-movement beta rebound (PMBR) - offer new pathways to optimize these therapies. Movement-related EEG signals from the sensorimotor cortex, particularly PMBR (post-movement) and event-related desynchronization (ERD, during movement), exhibit high task specificity and correlate with stroke severity. This study evaluated PMBR in 34 chronic stroke patients across two cohorts, along with a control group of 16 healthy participants, during voluntary and exoskeleton-assisted movement tasks. Longitudinal tracking in the second cohort enabled the analysis of PMBR changes, with EEG recordings acquired at three timepoints over a 30-session rehabilitation program. Findings revealed significant PMBR alterations in both passive and active movement tasks: patients with severe impairment lacked a PMBR dipole in the ipsilesional hemisphere, while moderately impaired patients showed a diminished response. The marked differences in PMBR patterns between stroke patients and controls highlight the extent of sensorimotor cortex disruption due to stroke. ERD showed minimal task-specific variation, underscoring PMBR as a more reliable biomarker of motor function impairment. These findings support the use of PMBR, particularly the PMBR/ERD ratio, as a biomarker for EEG-guided monitoring of motor recovery over time during exoskeleton-assisted rehabilitation.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":"35 9","pages":"2550044"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144585975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-01Epub Date: 2025-05-24DOI: 10.1142/S0129065725500418
Xiangle Ping, Wenhui Huang
Interactivity is crucial for enabling models to adjust and optimize based on user feedback, thereby enhancing overall performance. However, existing electroencephalogram (EEG)-based emotion recognition models rely on static training paradigms, lack interactivity, and struggle to effectively handle uncertainty in predictions. To address this issue, we propose a novel paradigm for interactive emotion recognition based on incremental Gaussian processes (GP). Unlike existing methods, our approach introduces an expert interaction mechanism to correct samples with high predictive uncertainty and incrementally update the model accordingly, thereby optimizing its performance. First, we model the emotion recognition task as a GP-based framework, utilizing the variance of the GP to quantify the model's uncertainty, thereby guiding experts in targeted interactions. Second, within the GP framework, we propose a novel incremental update strategy that allows the GP to incrementally update prediction results and uncertainties based only on new data obtained through expert interactions, without reprocessing all existing data. This effectively overcomes the shortcomings of traditional GP in updating efficiency. Third, to address the high computational complexity of GP, we use a sparse approximation strategy, selecting inducing points and performing variational inference to efficiently approximate the GP posterior, thereby reducing computational complexity. Subject-dependent and subject-independent experiments conducted on the DEAP and DREAMER datasets demonstrate that the proposed method exhibits significant advantages over state-of-the-art (SOTA) methods. In subject-dependent experiments, our method achieved the highest improvement (1.73%) in the Dominance dimension on the DREAMER dataset. In subject-independent experiments, it attained the largest performance improvement (2.96%) in the Arousal dimension on the DEAP dataset. These results further validate the proposed method's effectiveness.
{"title":"Interactive EEG Emotion Recognition with Incremental Gaussian Processes.","authors":"Xiangle Ping, Wenhui Huang","doi":"10.1142/S0129065725500418","DOIUrl":"10.1142/S0129065725500418","url":null,"abstract":"<p><p>Interactivity is crucial for enabling models to adjust and optimize based on user feedback, thereby enhancing overall performance. However, existing electroencephalogram (EEG)-based emotion recognition models rely on static training paradigms, lack interactivity, and struggle to effectively handle uncertainty in predictions. To address this issue, we propose a novel paradigm for interactive emotion recognition based on incremental Gaussian processes (GP). Unlike existing methods, our approach introduces an expert interaction mechanism to correct samples with high predictive uncertainty and incrementally update the model accordingly, thereby optimizing its performance. First, we model the emotion recognition task as a GP-based framework, utilizing the variance of the GP to quantify the model's uncertainty, thereby guiding experts in targeted interactions. Second, within the GP framework, we propose a novel incremental update strategy that allows the GP to incrementally update prediction results and uncertainties based only on new data obtained through expert interactions, without reprocessing all existing data. This effectively overcomes the shortcomings of traditional GP in updating efficiency. Third, to address the high computational complexity of GP, we use a sparse approximation strategy, selecting inducing points and performing variational inference to efficiently approximate the GP posterior, thereby reducing computational complexity. Subject-dependent and subject-independent experiments conducted on the DEAP and DREAMER datasets demonstrate that the proposed method exhibits significant advantages over state-of-the-art (SOTA) methods. In subject-dependent experiments, our method achieved the highest improvement (1.73%) in the Dominance dimension on the DREAMER dataset. In subject-independent experiments, it attained the largest performance improvement (2.96%) in the Arousal dimension on the DEAP dataset. These results further validate the proposed method's effectiveness.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2550041"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144145249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-08-01Epub Date: 2025-04-28DOI: 10.1142/S0129065725500364
Junjie Li, Hong Peng, Bing Li, Zhicai Liu, Rikong Lugu, Bingyan He
Due to the differences in size, shape, and location of brain tumors, brain tumor segmentation differs greatly from that of other organs. The purpose of brain tumor segmentation is to accurately locate and segment tumors from MRI images to assist doctors in diagnosis, treatment planning and surgical navigation. NSNP-like convolutional model is a new neural-like convolutional model inspired by nonlinear spiking mechanism of nonlinear spiking neural P (NSNP) systems. Therefore, this paper proposes a global-local feature fusion network based on NSNP-like convolutional model for MRI brain tumor segmentation. To this end, we have designed three characteristic modules that take full advantage of the NSNP-like convolution model: dilated SNP module (DSNP), multi-path dilated SNP pooling module (MDSP) and Poolformer module. The DSNP and MDSP modules are employed to construct the encoders. These modules help address the issue of feature loss and enable the fusion of more high-level features. On the other hand, the Poolformer module is used in the decoder. It processes features that contain global context information and facilitates the interaction between local and global features. In addition, channel spatial attention (CSA) module is designed at the skip connection between encoder and decoder to establish the long-range dependence between the same layers, thereby enhancing the relationship between channels and making the model have global modeling capabilities. In the experiments, our model achieves Dice coefficients of 85.71[Formula: see text], 92.32[Formula: see text], 87.75[Formula: see text] for ET, WT, and TC, respectively, on the N-BraTS2021 dataset. Moreover, our model achieves Dice coefficients of 83.91[Formula: see text], 91.96[Formula: see text], 90.14[Formula: see text] and 85.05[Formula: see text], 92.30[Formula: see text], 90.31[Formula: see text] on the BraTS2018 and BraTS2019 datasets respectively. Experimental results also indicate that our model not only achieves good brain tumor segmentation performance, but also has good generalization ability. The code is already available on GitHub: https://github.com/Li-JJ-1/NSNP-brain-tumor-segmentation.
由于脑肿瘤的大小、形状和位置的不同,脑肿瘤的分割与其他器官有很大的不同。脑肿瘤分割的目的是从MRI图像中对肿瘤进行准确定位和分割,以辅助医生进行诊断、治疗计划和手术导航。NSNP-like卷积模型是受非线性spike neural P (NSNP)系统的非线性spike机制启发而建立的一种新的类神经卷积模型。为此,本文提出了一种基于类nsnp卷积模型的全局-局部特征融合网络用于MRI脑肿瘤分割。为此,我们设计了充分利用类nsnp卷积模型的三个特征模块:扩展SNP模块(DSNP)、多路径扩展SNP池化模块(MDSP)和Poolformer模块。采用DSNP和MDSP模块构建编码器。这些模块有助于解决功能丢失的问题,并支持融合更高级的功能。另一方面,在解码器中使用Poolformer模块。它处理包含全局上下文信息的特征,并促进局部特征和全局特征之间的交互。此外,在编码器和解码器之间的跳接处设计信道空间注意(channel spatial attention, CSA)模块,建立同层之间的远程依赖关系,从而增强信道之间的关系,使模型具有全局建模能力。在实验中,我们的模型在N-BraTS2021数据集上,ET、WT和TC的Dice系数分别为85.71[公式:见文]、92.32[公式:见文]、87.75[公式:见文]。此外,我们的模型在BraTS2018和BraTS2019数据集上分别实现了83.91[公式:见文]、91.96[公式:见文]、90.14[公式:见文]和85.05[公式:见文]、92.30[公式:见文]、90.31[公式:见文]的Dice系数。实验结果表明,该模型不仅具有良好的脑肿瘤分割性能,而且具有良好的泛化能力。代码已经可以在GitHub上获得:https://github.com/Li-JJ-1/NSNP-brain-tumor-segmentation。
{"title":"Global-Local Feature Fusion Network Based on Nonlinear Spiking Neural Convolutional Model for MRI Brain Tumor Segmentation.","authors":"Junjie Li, Hong Peng, Bing Li, Zhicai Liu, Rikong Lugu, Bingyan He","doi":"10.1142/S0129065725500364","DOIUrl":"10.1142/S0129065725500364","url":null,"abstract":"<p><p>Due to the differences in size, shape, and location of brain tumors, brain tumor segmentation differs greatly from that of other organs. The purpose of brain tumor segmentation is to accurately locate and segment tumors from MRI images to assist doctors in diagnosis, treatment planning and surgical navigation. NSNP-like convolutional model is a new neural-like convolutional model inspired by nonlinear spiking mechanism of nonlinear spiking neural P (NSNP) systems. Therefore, this paper proposes a global-local feature fusion network based on NSNP-like convolutional model for MRI brain tumor segmentation. To this end, we have designed three characteristic modules that take full advantage of the NSNP-like convolution model: dilated SNP module (DSNP), multi-path dilated SNP pooling module (MDSP) and Poolformer module. The DSNP and MDSP modules are employed to construct the encoders. These modules help address the issue of feature loss and enable the fusion of more high-level features. On the other hand, the Poolformer module is used in the decoder. It processes features that contain global context information and facilitates the interaction between local and global features. In addition, channel spatial attention (CSA) module is designed at the skip connection between encoder and decoder to establish the long-range dependence between the same layers, thereby enhancing the relationship between channels and making the model have global modeling capabilities. In the experiments, our model achieves Dice coefficients of 85.71[Formula: see text], 92.32[Formula: see text], 87.75[Formula: see text] for ET, WT, and TC, respectively, on the N-BraTS2021 dataset. Moreover, our model achieves Dice coefficients of 83.91[Formula: see text], 91.96[Formula: see text], 90.14[Formula: see text] and 85.05[Formula: see text], 92.30[Formula: see text], 90.31[Formula: see text] on the BraTS2018 and BraTS2019 datasets respectively. Experimental results also indicate that our model not only achieves good brain tumor segmentation performance, but also has good generalization ability. The code is already available on GitHub: https://github.com/Li-JJ-1/NSNP-brain-tumor-segmentation.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2550036"},"PeriodicalIF":0.0,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143994994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-08-01Epub Date: 2025-05-26DOI: 10.1142/S012906572550039X
Fengxiang Liao, Lu Leng, Ziyuan Yang, Bob Zhang
Palmprint recognition is a pivotal biometric modality, renowned for its numerous advantages and applications in the field of biometrics. The Gabor filter is a classic and efficient texture feature extractor abstracted from the nervous system. The existing palmprint texture coding methods only focus on first-order texture features (1TFs), while neglecting discriminative second-order texture features (2TFs). Therefore, this paper proposes multi-order extensions for state-of-the-art (SOTA) palmprint texture coding methods, which makes full usage of 1TFs and 2TFs. A filter is used to extract 1TFs from the palmprint image, and the same filter is applied to extract 2TFs from 1TFs. Here, different methods employ various filters to extract diverse textures. Due to the simultaneous participations of 1TFs and 2TFs in multi-order extension codes, more discriminative features are extracted and fused. The experimental results on three public databases, including contact, noncontact and multispectral acquisition types, show that the accuracies of all the palmprint texture coding methods are remarkably improved by multi-order extension, establishing it as a general framework extendable to other texture-based recognition tasks.
{"title":"Multi-Order Extension Codes for Palmprint Recognition.","authors":"Fengxiang Liao, Lu Leng, Ziyuan Yang, Bob Zhang","doi":"10.1142/S012906572550039X","DOIUrl":"https://doi.org/10.1142/S012906572550039X","url":null,"abstract":"<p><p>Palmprint recognition is a pivotal biometric modality, renowned for its numerous advantages and applications in the field of biometrics. The Gabor filter is a classic and efficient texture feature extractor abstracted from the nervous system. The existing palmprint texture coding methods only focus on first-order texture features (1TFs), while neglecting discriminative second-order texture features (2TFs). Therefore, this paper proposes multi-order extensions for state-of-the-art (SOTA) palmprint texture coding methods, which makes full usage of 1TFs and 2TFs. A filter is used to extract 1TFs from the palmprint image, and the same filter is applied to extract 2TFs from 1TFs. Here, different methods employ various filters to extract diverse textures. Due to the simultaneous participations of 1TFs and 2TFs in multi-order extension codes, more discriminative features are extracted and fused. The experimental results on three public databases, including contact, noncontact and multispectral acquisition types, show that the accuracies of all the palmprint texture coding methods are remarkably improved by multi-order extension, establishing it as a general framework extendable to other texture-based recognition tasks.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":"35 8","pages":"2550039"},"PeriodicalIF":0.0,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144577442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}