检索结果-内蒙古大学图书馆

Tagging Continuous Labels for EEG-based Emotion Classification

学校读者我要写书评

暂无评论

Tagging Continuous Labels for EEG-based Emotion Classificati...

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Rong-Fei Gu Li-Ming Zhao Wei-Long Zheng Bao-Liang Lu Department of Computer Science and Engineering Center for Brain-Like Computing and Machine Intelligence the Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering and Brain Science and Technology Research Center Shanghai Jiao Tong University Shanghai People’s Republic of China RuiJin-Mihoyo Laboratory Clinical Neuroscience Center RuiJin Hospital Shanghai Jiao Tong University School of Medicine Shanghai People’s Republic of China

EEG-based emotion classification has long been a critical task in the field of affective brain-computer interface (aBCI). The majority of leading researches construct supervised learning models based on labeled datasets. Several datasets have been released, including different kinds of emotions while utilizing various forms of stimulus materials. However, they adopt discrete labeling methods, in which the EEG data collected during the same stimulus material are given a same label. These methods neglect the fact that emotion changes continuously, and mislabeled data possibly exist. The imprecision of discrete labels may hinder the progress of emotion classification in concerned works. Therefore, we develop an efficient system in this paper to support continuous labeling by giving each sample a unique label, and construct a continuously labeled EEG emotion dataset. Using our dataset with continuous labels, we demonstrate the superiority of continuous labeling in emotion classification through experiments on several classification models. We further utilize the continuous labels to identify the EEG features under induced and non-induced emotions in both our dataset and a public dataset. Our experimental results reveal the learnability and generality of the relation between the EEG features and their continuous labels.

关键词：

Objective Depression Detection Using EEG and Eye Movement Signals Induced by Oil Paintings

学校读者我要写书评

暂无评论

Objective Depression Detection Using EEG and Eye Movement Si...

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Luyu Liu Dan Peng Wei-Long Zheng Bao-Liang Lu Department of Computer Science and Engineering Center for Brain-Like Computing and Machine Intelligence the Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering and Brain Science and Technology Research Center Shanghai Jiao Tong University Shanghai People’s Republic of China RuiJin-Mihoyo Laboratory Clinical Neuroscience Center RuiJin Hospital Shanghai Jiao Tong University School of Medicine Shanghai People’s Republic of China

Depression is a mental disorder characterized by persistent sadness and loss of interest, which has become one of the leading causes of disability worldwide. There are currently no objective diagnostic standards for depression in clinical practice. Previous studies have shown that depression causes both brain abnormalities and behavioral disorders. In this study, both electroencephalography (EEG) and eye movement signals were used to objectively detect depression. By presenting 40 carefully selected oil paintings—20 positive and 20 negative—as stimuli, we were able to successfully evoke emotions in 48 depressed patients (DPs) and 40 healthy controls (HCs) from three centers. We then used Transformer, a deep learning model, to conduct emotion recognition and depression detection. The experimental results demonstrate that: a) Transformer achieves the best accuracies of 89.21% and 92.19% in emotion recognition and depression detection, respectively; b) The HC group has higher accuracies than the DP group in emotion recognition for both subject-dependent and subject-independent experiments; c) The neural pattern differences do exist between DPs and HCs, and we find the consistent asymmetry of the neural patterns in DPs; d) For depression detection, using single oil painting achieves the best accuracies, and using negative oil paintings has higher accuracies than using positive oil paintings. These findings suggest that EEG and eye movement signals induced by oil paintings can be used to objectively identify depression.

关键词：

EEG-Eye Movements Cross-Modal Decision Confidence Measurement with Generative Adversarial Networks

学校读者我要写书评

暂无评论

EEG-Eye Movements Cross-Modal Decision Confidence Measuremen...

International IEEE/EMBS Conference on Neural Engineering, CNE

作者： Cheng Fei Rui Li Li-Ming Zhao Wei-Long Zheng Bao-Liang Lu Department of Computer Science and Engineering Center for Brain-Like Computing and Machine Intelligence Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering and Brain Science and Technology Research Center Shanghai Jiao Tong University Shanghai People's Republic of China RuiJin-Mihoyo Laboratory Clinical Neuroscience Center RuiJin Hospital Shanghai Jiao Tong University School of Medicine Shanghai People's Republic of China

Decision confidence is an individual's feeling of correctness or optimization when making a decision. Various physiological signals, including electroencephalography (EEG) and eye movements have been studied extensively in measuring levels of decision confidence in humans. While multimodal fusion generally performs better than single-modal approaches, it requires data from different modalities at a greater cost. In particular, collection of EEG data is more complicated and time consuming while eye movement signals are much easier to acquire. To tackle this problem, we propose a cross-modal method based on generative adversarial learning. In our method, the intrinsic relationship between eye movement and EEG features in a high-level feature space can be learned in the training phase, and then we can obtain multimodal information during the test phase when only eye movements are available as inputs. Experimental results on the SEED-VPDC dataset demonstrate that our proposed method outperforms single-modal methods trained and tested only on eye movement signals with an improvement of approximately 5.43% in accuracy, and maintains competitive performance in comparison with multimodal methods. Our cross-modal approach requires only eye movements as inputs and reduces reliance on EEG data, making the decision confidence measurement more applicable and practicable.

关键词： Training Costs Neural engineering Particle measurements Generative adversarial networks Electroencephalography Adversarial machine learning

GAN-based Facial Attribute Manipulation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Liu, Yunfan Li, Qi Deng, Qiyao Sun, Zhenan Yang, Ming-Hsuan The School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China The National Laboratory of Pattern Recognition Center for Research on Intelligent Perception and Computing Institute of Automation Chinese Academy of Sciences Beijing100190 China The Center for Research on Intelligent Perception and Computing Institute of Automation Chinese Academy of Sciences Beijing100190 China The Department of Computer Science and Engineering University of California MercedCA95340 United States

Facial Attribute Manipulation (FAM) aims to aesthetically modify a given face image to render desired attributes, which has received significant attention due to its broad practical applications ranging from digital entertainment to biometric forensics. In the last decade, with the remarkable success of Generative Adversarial Networks (GANs) in synthesizing realistic images, numerous GAN-based models have been proposed to solve FAM with various problem formulation approaches and guiding information representations. This paper presents a comprehensive survey of GAN-based FAM methods with a focus on summarizing their principal motivations and technical details. The main contents of this survey include: (i) an introduction to the research background and basic concepts related to FAM, (ii) a systematic review of GAN-based FAM methods in three main categories, and (iii) an in-depth discussion of important properties of FAM methods, open issues, and future research directions. This survey not only builds a good starting point for researchers new to this field but also serves as a reference for the vision community. Copyright © 2022, The Authors. All rights reserved.

关键词： Generative adversarial networks

Efficient and Trustworthy Block Propagation for Blockchain-enabled Mobile Embodied AI Networks: A Graph Resfusion Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Kang, Jiawen Liao, Jiana Gao, Runquan Wen, Jinbo Huang, Huawei Zhang, Maomao Yi, Changyan Zhang, Tao Niyato, Dusit Zheng, Zibin Anhui Engineering Research Center for Agricultural Product Quality Safety Digital Intelligence Fuyang Normal University Fuyang236037 China School of Automation Guangdong University of Technology Guangzhou510006 China School of Software Engineering Sun Yat-Sen University Zhuhai519082 China School of Intelligent Systems Engineering Sun Yat-Sen University Shenzhen518107 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing210016 China School of Cyberspace Science and Technology Beijing Jiaotong University Beijing100044 China College of Computing and Data Science Nanyang Technological University Singapore

By synergistically integrating mobile networks and embodied artificial intelligence (AI), Mobile Embodied AI Networks (MEANETs) represent an advanced paradigm that facilitates autonomous, context-aware, and interactive behaviors within dynamic environments. Nevertheless, the rapid development of MEANETs is accompanied by challenges in trustworthiness and operational efficiency. Fortunately, blockchain technology, with its decentralized and immutable characteristics, offers promising solutions for MEANETs. However, existing block propagation mechanisms suffer from challenges such as low propagation efficiency and weak security for block propagation, which results in delayed transmission of vehicular messages or vulnerability to malicious tampering, potentially causing severe traffic accidents in blockchain-enabled MEANETs. Moreover, current block propagation strategies cannot effectively adapt to real-time changes of dynamic topology in MEANETs. Therefore, in this paper, we propose a graph Resfusion model-based trustworthy block propagation optimization framework for consortium blockchain-enabled MEANETs. Specifically, we propose an innovative trust calculation mechanism based on the trust cloud model, which comprehensively accounts for randomness and fuzziness in the miner trust evaluation. Furthermore, by leveraging the strengths of graph neural networks and diffusion models, we develop a graph Resfusion model to effectively and adaptively generate the optimal block propagation trajectory. Simulation results demonstrate that the proposed model outperforms other routing mechanisms in terms of block propagation efficiency and trustworthiness. Additionally, the results highlight its strong adaptability to dynamic environments, making it particularly suitable for rapidly changing MEANETs. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

A Survey on Self-supervised Learning: Algorithms, Applications, and Future Trends

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Gui, Jie Chen, Tuo Zhang, Jing Cao, Qiong Sun, Zhenan Luo, Hao Tao, Dacheng School of Cyber Science and Engineering Southeast University with Purple Mountain Laboratories Nanjing210000 China School of Cyber Science and Engineering Southeast University China School of Computer Science The University of Sydney CamperdownNSW2050 Australia College of Computing & Data Science Nanyang Technological University #32 Block N4 #02a-014 50 Nanyang Avenue Singapore639798 Singapore JD Explore Academy Center for Research on Intelligent Perception and Computing Chinese Academy of Sciences Beijing100190 China Alibaba Group Hangzhou310052 China

Deep supervised learning algorithms typically require a large volume of labeled data to achieve satisfactory performance. However, the process of collecting and labeling such data can be expensive and time-consuming. Self-supervised learning (SSL), a subset of unsupervised learning, aims to learn discriminative features from unlabeled data without relying on human-annotated labels. SSL has garnered significant attention recently, leading to the development of numerous related algorithms. However, there is a dearth of comprehensive studies that elucidate the connections and evolution of different SSL variants. This paper presents a review of diverse SSL methods, encompassing algorithmic aspects, application domains, three key trends, and open research questions. Firstly, we provide a detailed introduction to the motivations behind most SSL algorithms and compare their commonalities and differences. Secondly, we explore representative applications of SSL in domains such as image processing, computer vision, and natural language processing. Lastly, we discuss the three primary trends observed in SSL research and highlight the open questions that remain. A curated collection of valuable resources can be accessed at https://***/guijiejie/SSL. Copyright © 2023, The Authors. All rights reserved.

关键词： Contrastive Learning

Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Dong, Xuewen Li, Jiachen Li, Shujun You, Zhichao Qu, Qiang Kholodov, Yaroslav Shen, Yulong School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi’an710071 China University of Kent CanterburyCT2 7NP United Kingdom Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Intelligent Transportation Systems Lab Innopolis University Innopolis Russia School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi’an710071 China

Recent studies show that graph neural networks (GNNs) are vulnerable to backdoor attacks. Existing backdoor attacks against GNNs use fixed-pattern triggers and lack reasonable trigger constraints, overlooking individual graph characteristics and rendering insufficient evasiveness. To tackle the above issues, we propose ABARC, the first Adaptive Backdoor Attack with Reasonable Constraints, applying to both graph-level and node-level tasks in GNNs. For graph-level tasks, we propose a subgraph backdoor attack independent of the graph’s topology. It dynamically selects trigger nodes for each target graph and modifies node features with constraints based on graph similarity, feature range, and feature type. For node-level tasks, our attack begins with an analysis of node features, followed by selecting and modifying trigger features, which are then constrained by node similarity, feature range, and feature type. Furthermore, an adaptive edge-pruning mechanism is designed to reduce the impact of neighbors on target nodes, ensuring a high attack success rate (ASR). Experimental results show that even with reasonable constraints for attack evasiveness, our attack achieves a high ASR while incurring a marginal clean accuracy drop (CAD). When combined with the state-of-the-art defense randomized smoothing (RS) method, our attack maintains an ASR over 94%, surpassing existing attacks by more than 7%. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

Combining Kernelized Autoencoding and Centroid Prediction for Dynamic Multi-objective Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hou, Zhanglu Zou, Juan Ruan, Gan Liu, Yuan Xia, Yizhang Hunan Engineering Research Center of Intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education of China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Province Xiangtan411105 China CERCIA School of Computer Science University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom

Evolutionary algorithms face significant challenges when dealing with dynamic multi-objective optimization because Pareto optimal solutions and/or Pareto optimal fronts change. This paper proposes a unified paradigm, which combines the kernelized autoncoding evolutionary search and the centriod-based prediction (denoted by KAEP), for solving dynamic multi-objective optimization problems (DMOPs). Specifically, whenever a change is detected, KAEP reacts effectively to it by generating two subpopulations. The first subpoulation is generated by a simple centriod-based prediction strategy. For the second initial subpopulation, the kernel autoencoder is derived to predict the moving of the Pareto-optimal solutions based on the historical elite solutions. In this way, an initial population is predicted by the proposed combination strategies with good convergence and diversity, which can be effective for solving DMOPs. The performance of our proposed method is compared with five state-of-the-art algorithms on a number of complex benchmark problems. Empirical results fully demonstrate the superiority of our proposed method on most test instances. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

Enhancing drug-target interaction predictions in context of neurodegenerative diseases using bidirectional long short-term memory in male Swiss albino mice pharmaco-EEG analysis

学校读者我要写书评

暂无评论

Heliyon 2024年第21期10卷 e39279页

作者： Qureshi, Shahnawaz Iqbal, Syed Muhammad Zeeshan Ameer, Asif Karrila, Seppo Ghadi, Yazeed Yasin Shah, Syed Aziz Intelligent Biomedical Application Lab Sino-Pak center for Artificial Intelligence School of Computing Pak-Austria Fachhochschule: Institute of Applied Sciences and Technology Mang Haripur 22620 Pakistan Research and Development BrightWare LLC Riyadh 13323 Saudi Arabia Department of Computer Science National University of Computing and Emerging Sciences Faisalabad 38000 Pakistan Faculty of Science and Industrial Technology Prince of Songkla University Surat Thani Campus Muang Surat Thani 84000 Thailand Department of Computer Science Al Ain University Abu Dhab Al Ain United Arab Emirates Healthcare Sensing Technology Faculty Research Centre for Intelligent Healthcare Coventry University Coventry United Kingdom

Background and Objective: Emerging diseases like Parkinson or Alzheimer's, which are not curable, endanger human mental health and are challenging to research. Drug target interactions (DTI) are pivotal in the screening of candidate drugs and focus on a small pool of drug targets. Electroencephalogram shows the responses to psychotropic medicines in the brain bioelectric activity. Synaptic activity can be analyzed by using Local Field Potential recordings obtained from micro-electrodes implanted in the brain. The aim is to evaluate the effects of drug on brain bioelectric activity and increase the drug classification accuracy. The ultimate goal is to advance our understanding of how drugs affect synaptic activity and open the door to more focused treatment for neurodegenerative diseases. Methods: In this study, Pharmaco-EEG recordings are processed using Advanced neural network models, particularly Convolutional Neural Networks, to assess the effects of medications. The five different medicines used in this study are Ephedrine, Fluoxetine, Kratom, Morphine, and Saline. The signals observed are local field potential signals. To overcome some limits of DTI prediction, we propose Bidirectional Long Short-Term Memory (LSTM) for the categorization of intracranial EEG (i-EEG) data, departing from standard approaches. Similar EEG patterns are presumably caused by drugs that work by homologous pharmacological pathways, producing similar psychotropic effects. To improve accuracy and reduce training loss, our study introduces a bidirectional LSTM model for classification along with Bayesian optimization Results: High recall, precision, and F1-Scores, particularly a 95% F1-Score for morphine, ephedrine, fluoxetine, and saline, suggest good performance in predicting these drug classes. Kratom produces a somewhat lower recall of 94%, but a high F1-Score of 97% and perfect precision of 1.00. The weighted average F1-Score, macro average, and overall accuracy are all consistently h

关键词： Convolutional neural network Drug target interaction Intracranial EEG Local field potential Long short-term memory