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

Exploiting the Intrinsic Neighborhood Semantic Structure for Domain Adaptation in EEG-based Emotion Recognition

IEEE Transactions on Affective Computing 2025年

作者： Yang, Yi Wang, Ze Song, Yu Jia, Ziyu Wang, Boyu Jung, Tzyy-Ping Wan, Feng Macau University of Science and Technology Macao Centre for Mathematical Sciences Respiratory Disease AI Laboratory on Epidemic Intelligence and Medical Big Data Instrument Applications Faculty of Innovation Engineering 999078 China Tianjin University of Technology School of Electrical Engineering and Automation Tianjin Key Laboratory of New Energy Power Conversion Transmission and Intelligent Control Tianjin300384 China Chinese Academy of Sciences Beijing Key Laboratory of Brainnetome and Brain-Computer Interface and Brainnetome Center Institute of Automation Beijing100045 China Western University Department of Computer Science Brain Mind Institute LondonONN6A 3K7 Canada University of California at San Diego Swartz Center for Computational Neuroscience Institute for Neural Computation La Jolla CA92093 United States University of Macau Department of Electrical and Computer Engineering Faculty of Science and Technology China University of Macau Centre for Cognitive and Brain Sciences Centre for Artificial Intelligence and Robotics Institute of Collaborative Innovation 999078 China

Due to the inherent non-stationarity and individual differences present in electroencephalogram (EEG) signals, developing a generalizable model that performs well on new subjects is challenging in EEG-based emotion recognition. Most existing domain adaptation (DA) methods typically mitigate these discrepancies by aligning the marginal distributions of domain feature representations. However, when there is a significant difference in the class-conditional distribution between domain features and labels, the domain-invariant features learned by aligning marginal distributions may have limited discriminative ability for unlabeled target instances or even prove counterproductive. To address this issue, we propose a Neighborhood Semantic Aware Learning-based Dynamic Graph Attention Convolution (NSAL-DGAT) approach that learns target semantic information by considering the inter-domain semantic topological structure, thereby improving classifier adaptation for target instances. Specifically, the proposed NSAL framework is designed to capitalize on the insight that after domain feature alignment, some target samples and their neighboring source samples exhibit similar semantics. By leveraging the neighborhood topological structure, we extract and incorporate semantic target features to train a more transferable classifier. Besides, we implement an entropy weighting mechanism to emphasize representative target semantic information, encouraging target instances to prioritize high-confidence individuals within the source neighborhood. We have conducted extensive experiments on the public SEED dataset and our collected the Hearing-Impaired EEG Dataset (HIED). The experimental results underscore the efficacy of our proposed NSAL-DGAT approach, showcasing state-of-the-art accuracy in subject-dependent as well as subject-independent scenarios. The source code is available at https://***/YYingDL/NSAL-DGAT. © 2010-2012 IEEE.

关键词： Speech analysis

来源：评论

学校读者我要写书评

暂无评论

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

arXiv

引用

arXiv 2024年

作者： Ding, Yi He, Xuan Nguyen, Tuan Thanh Song, Wentu Yakhini, Zohar Yaakobi, Eitan Pan, Linqiang Tang, Xiaohu Cai, Kui Information Coding and Transmission Key Lab of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China Cluster Singapore University of Technology and Design 487372 Singapore Faculty of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel School of Computer Science RUNI Herzliya4615200 Israel Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carried out large scale experiments to validate our proposed DNA-based data storage architecture. Specifically, 1.61 and 1.69 MB data were encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages of 4.5 and 6.0, respectively. This experiment achieved the highest net information density and lowest coverage among existing DNA-based data storage experiments (with standard DNA), with data recovery rates and coverage approaching theoretical optima. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel coding

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Deep learning of Hash Method for Fast Image Retrieval

Deep learning of Hash Method for Fast Image Retrieval

引用

2021 China automation Congress, CAC 2021

作者： Peng, Taiying Wang, Tian Liu, Kexin Zhang, Mengyi Shi, Peng Snoussi, Hichem School of Automation Science and Electrical Engineering Beihang University Beijing China Institute of Artificial Intelligence Beihang University Beijing China College of Electrical Engineering and Control Science Nanjing Tech University Nanjing China School of Mathematics and Computer Science Fujian Normal University Fujian China Institute Charles Delaunay-LM2S University of Technology of Troyes Troyes France

ISBN: (纸本)9781665426473

Most of the image retrieval technology are complex and advanced methods to improve the accuracy of *** also have deep net layers, which costs much time to caculate the result. When we need deal with complex image task, it will be hard to complete the fast image retrieval. This paper presents a convolutional neural network combining with the fast encoding technology under the hash algorithm to improve fast retrieval time and accuracy. In order to keep the existing accuracy and retrieval speed of the network, we present a Hash method path of the network combining witn the dual *** clustering analysis and AlexNet,we get lots of high dimensional feature. Then these feature is put into Hash-coding *** algorithm will output binary feature to match the target image. Through learning similar graph pairs, Hash net work shorten the distance between the similar images, and achieve fast *** it realizes image retrieval and outputs the most similar *** the search task. © 2021 IEEE

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

A novel approach for intelligent diagnosis and grading of diabetic retinopathy

引用

computers in Biology and Medicine 2024年 172卷 108246-108246页

作者： Hai, Zeru Zou, Beiji Xiao, Xiaoxia Peng, Qinghua Yan, Junfeng Zhang, Wensheng Yue, Kejuan School of Informatics Hunan University of Chinese Medicine Hunan Province Changsha410208 China School of Computer Science and Engineering Central South University Hunan Province Changsha410083 China School of Traditional Chinese Medicine Hunan University of Chinese Medicine Hunan Province Changsha410208 China Beijing100049 China Research Center of Precision Sensing and Control Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Computer Science Hunan First Normal University Hunan Province Changsha410205 China

Diabetic retinopathy (DR) is a severe ocular complication of diabetes that can lead to vision damage and even blindness. Currently, traditional deep convolutional neural networks (CNNs) used for DR grading tasks face two primary challenges: (1) insensitivity to minority classes due to imbalanced data distribution, and (2) neglecting the relationship between the left and right eyes by utilizing the fundus image of only one eye for training without differentiating between them. To tackle these challenges, we proposed the DRGCNN (DR Grading CNN) model. To solve the problem caused by imbalanced data distribution, our model adopts a more balanced strategy by allocating an equal number of channels to feature maps representing various DR categories. Furthermore, we introduce a CAM-EfficientNetV2-M encoder dedicated to encoding input retinal fundus images for feature vector generation. The number of parameters of our encoder is 52.88 M, which is less than RegNet_y_16gf (80.57 M) and EfficientNetB7 (63.79 M), but the corresponding kappa value is higher. Additionally, in order to take advantage of the binocular relationship, we input fundus retinal images from both eyes of the patient into the network for features fusion during the training phase. We achieved a kappa value of 86.62% on the EyePACS dataset and 86.16% on the Messidor-2 dataset. Experimental results on these representative datasets for diabetic retinopathy (DR) demonstrate the exceptional performance of our DRGCNN model, establishing it as a highly competitive intelligent classification model in the field of DR. The code is available for use at https://***/Fat-Hai/DRGCNN. © 2024 The Authors

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

TDNCIB: Target-Driven Navigation with Convolutional Information Branch Based on Deep Reinforcement Learning

TDNCIB: Target-Driven Navigation with Convolutional Informat...

引用

2021 China automation Congress, CAC 2021

作者： Zhao, Xinzhou Wang, Tian Liu, Kexin Zhang, Mengyi Shi, Peng Snoussi, Hichem School of Automation Science and Electrical Engineering Beihang University Beijing China Institute of Artificial Intelligence Beihang University Beijing China College of Electrical Engineering and Control Science Nanjing Tech University Nanjing China School of Mathematics and Computer Science Fujian Normal University Fujian China Institute Charles Delaunay-LM2S University of Technology of Troyes Troyes France

ISBN: (纸本)9781665426473

Target-driven navigation has been a significant application field of reinforcement learning. However, sparse reward and lack of useful environment information are still existing problems. Therefore, in this paper, we propose a novel design to the target-driven visual navigation based on deep reinforcement learning: Target-Driven Navigation with Convolutional Information Branch (TDNCIB), which enriches the high-dimensional information learned by the network from the environment. It is an improvement of A2C algorithm. CIB can help make full use of environmental information and serve as a complement to the baseline. Besides, a novel reward design using similarity is introduced to relieve sparse reward. The ablation study is implemented in 4 different scenes of AI2-THOR framework comparing the baseline and our TDNCIB. According to our evaluation, TDNCIB converges faster than the baseline and achieves better performance in 5 common metrics with shorter trajectory length, less collision and higher success rate. © 2021 IEEE

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

Conservative-Progressive Collaborative Learning for Semi-supervised Semantic Segmentation

arXiv

引用

arXiv 2022年

作者： Fan, Siqi Zhu, Fenghua Feng, Zunlei Lv, Yisheng Song, Mingli Wang, Fei-Yue The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Tsinghua University Beijing China The College of Computer Science and Technology Zhejiang University Hangzhou China

Pseudo supervision is regarded as the core idea in semi-supervised learning for semantic segmentation, and there is always a tradeoff between utilizing only the high-quality pseudo labels and leveraging all the pseudo labels. Addressing that, we propose a novel learning approach, called Conservative-Progressive Collaborative Learning (CPCL), among which two predictive networks are trained in parallel, and the pseudo supervision is implemented based on both the agreement and disagreement of the two predictions. One network seeks common ground via intersection supervision and is supervised by the high-quality labels to ensure a more reliable supervision, while the other network reserves differences via union supervision and is supervised by all the pseudo labels to keep exploring with curiosity. Thus, the collaboration of conservative evolution and progressive exploration can be achieved. To reduce the influences of the suspicious pseudo labels, the loss is dynamic re-weighted according to the prediction confidence. Extensive experiments demonstrate that CPCL achieves state-of-the-art performance for semi-supervised semantic segmentation. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

General Impedance Modeling for Modular Multilevel Converter with Grid-forming and Grid-following control

arXiv

引用

arXiv 2024年

作者： Sun, Chu Zhang, Fei Xiao, Huafeng Wang, Na Chen, Jikai The School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm11428 Sweden The School of Electrical Engineering Southeast University Nanjing210096 China The School of Automation Science and Electrical Engineering Beihang University Beijing100191 China The Key Laboratory of Modern Power System Simulation and Control & Renewable Energy Technology Ministry of Education Northeast Electric Power University Jilin132012 China

Modular multilevel converter (MMC) has complex topology, control architecture and broadband harmonic spectrum. For this, linear-time-periodic (LTP) theory, covering multi-harmonic coupling relations, has been adopted for MMC impedance modeling recently. However, the existing MMC impedance models usually lack explicit expressions and general modeling procedure for different control strategies. To this end, this paper proposes a general impedance modeling procedure applicable to various power converters with grid-forming and grid-following control strategies. The modeling is based on a unified representation of MMC circuit as the input and output relation between the voltage or current on the AC side and the exerted modulation index, while the control part vice versa, thereby interconnected as closed-loop feedback. With each part expressed as transfer functions, the final impedance model keeps the explicit form of harmonic transfer function matrix, making it convenient to directly observe and analyze the influence of each part individually. Thereby the submodule capacitance is found as the main cause of difference between MMC impedance compared to two-level converter, which will get closer as the capacitance increases. Effectiveness and generality of the impedance modeling method is demonstrated through comprehensive comparison with impedance scanning using electromagnetic transient simulation. Copyright © 2024, The Authors. All rights reserved.

关键词： Harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Domain Adaptation on Graphs with Contrastive Learning and Minimax Entropy

arXiv

引用

arXiv 2023年

作者： Xiao, Jiaren Dai, Quanyu Shen, Xiao Xie, Xiaochen Dai, Jing Lam, James Kwok, Ka-Wai Department of Mechanical Engineering The University of Hong Kong Hong Kong Department of Computing The Hong Kong Polytechnic University Hong Kong School of Computer Science and Technology Hainan University Haikou China Department of Automation Harbin Institute of Technology Shenzhen China Institute for Automatic Control and Complex Systems University of Duisburg-Essen Duisburg Germany

Label scarcity in a graph is frequently encountered in real-world applications due to the high cost of data labeling. To this end, semi-supervised domain adaptation (SSDA) on graphs aims to leverage the knowledge of a labeled source graph to aid in node classification on a target graph with limited labels. SSDA tasks need to overcome the domain gap between the source and target graphs. However, to date, this challenging research problem has yet to be formally considered by the existing approaches designed for cross-graph node classification. This paper proposes a novel method called SemiGCL to tackle the graph Semi-supervised domain adaptation with Graph Contrastive Learning and minimax entropy training. SemiGCL generates informative node representations by contrasting the representations learned from a graph’s local and global views. Additionally, SemiGCL is adversarially optimized with the entropy loss of unlabeled target nodes to reduce domain divergence. Experimental results on benchmark datasets demonstrate that SemiGCL outperforms the state-of-the-art baselines on the SSDA tasks. © 2023, CC BY-NC-ND.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Protein-Folding Inspired Programmable control System for Robot Swarms

Protein-Folding Inspired Programmable Control System for Rob...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Feng Zhang Yuping Gu Zebin Wang Shuai Yuan Yongliang Yang School of Electrical and Control Engineering Shenyang Jianzhu University Shenyang Liaoning China State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang Liaoning China School of Computer Science and Engineering Shenyang Jianzhu University Shenyang Liaoning China

ISBN: (数字)9798331509644

ISBN: (纸本)9798331509651

In swarm robotics, most of the control algorithms are inspired by the behaviors of animal swarms. The capability gap between robots and animals, however, hinders the reliability of these algorithms. Toward developing reliable algorithms of robot swarms, a promising solution is learning from the collective behaviors of low-intelligent natural swarms, such as cell collectives and molecular assemblies. Here, we proposed a programmable control system inspired by protein folding. Using our homemade RoboFold platform, we demonstrated a protein-folding inspired programmable control method for robot swarms. By programming and designing the sequence of a thread of protein-like robots, the developed system can mimic the formation of hierarchical structures in robot swarms as the three-level of protein structures. We quantitatively characterized the specific features of self-organized morphologies. The experimental results together demonstrated the feasibility of this method. To summarize, this work successfully translated the principles of protein-folding into programming methods to control the morphology of robot swarms. Considering that the protein folding problem is essentially a physicochemical problem, this system is not only beneficial for the control of swarm robots but also has the potential to develop into a tool for studying the protein folding problem.

关键词： Proteins Vibrations Programmable control Animals Morphology Swarm robotics Programming control systems Robustness Robots

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：