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

DDS-SLAM: Dense Semantic Neural SLAM for Deformable Endoscopic Scenes

学校读者我要写书评

暂无评论

DDS-SLAM: Dense Semantic Neural SLAM for Deformable Endoscop...

IEEE/RSJ International Conference on intelligent Robots and Systems (IROS)

作者： Jiwei Shan Yirui Li Lujia Yang Qiyu Feng Lijun Han Hesheng Wang Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China School of Mechanical Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

Estimating camera motion and continuously reconstructing dense scenes in deformable environments presents a complex and open challenge. Many existing approaches tend to rely on assumptions about the scene’s topology or the nature of deformable motion. However, these assumptions do not hold true in medical endoscopy applications. To address these challenges, we introduce DDS-SLAM, a novel dense deformable semantic neural SLAM that achieves accurate camera tracking, continuous dense scene reconstruction, and high-quality image rendering in deformable scenes. First, we propose a novel hybrid neural scene representation method capable of capturing both natural and artificial deformations. Additionally, by leveraging the 2D semantic information of the scene, we introduce a semantic loss function based on semantic distance fields. This approach guides network optimization at a higher level, thereby enhancing system performance. Furthermore, we validate our method through a series of experiments conducted on several representative medical datasets, demonstrating its superiority over other state-of-the-art approaches. The code is available at: https://***/IRMVLab/DDS-SLAM.

关键词： Simultaneous localization and mapping Tracking System performance Semantics Cameras Rendering (computer graphics) Topology image reconstruction Optimization Biomedical imaging

Motor Fault Diagnosis Under Complex Working Conditions Based on Signal Fusion and CA-CNN

学校读者我要写书评

暂无评论

Motor Fault Diagnosis Under Complex Working Conditions Based...

Chinese Automation Congress (CAC)

作者： Mingxuan Cai Qi Liu Yuxiang Liu Bo Yang Department of Automation Shanghai Jiao Tong University shanghai China Key Laboratory of System Control and Information Processing Shanghai Engineering Research Center of Intelligent Control and Management Ministry of Education of China Shanghai China

ISBN: (数字)9798350368604

ISBN: (纸本)9798350368611

Accurate fault diagnosis plays a key role in the safe and efficient operation of electrical motors. Aiming at multiclass motor fault diagnosis under complex working conditions, a signal fusion-based fault diagnosis framework is proposed. Measurement parameters from different sensors are first transformed by wavelet denoising and fast Fourier transform (FFT). Then, multiple parameters spectrum and working condition information are integrated and converted into high-dimension matrices. Finally, a channel-attention-based convolution neural network (CA-CNN) is proposed to extract fault patterns from a reconstructed matrix and output diagnosis results. Experiment results on both simulated and experimental datasets verify the effectiveness of the proposed method.

关键词： Fault diagnosis Employee welfare Wavelet transforms Accuracy Fast Fourier transforms Motors Sensors Numerical models Velocity measurement Matrix converters

Joint Masked Reconstruction and Contrastive Learning for Mining Interactions Between Proteins

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Jiang Wang, Xiaoping School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Institute of Artificial Intelligence Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Brain-Inspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan430074 China

Protein-protein interaction (PPI) prediction is an instrumental means in elucidating the mechanisms underlying cellular operations, holding significant practical implications for the realms of pharmaceutical development and clinical treatment. Presently, the majority of research methods primarily concentrate on the analysis of amino acid sequences, while investigations predicated on protein structures remain in the nascent stages of exploration. Despite the emergence of several structure-based algorithms in recent years, these are still confronted with inherent challenges: (1) the extraction of intrinsic structural information of proteins typically necessitates the expenditure of substantial computational resources;(2) these models are overly reliant on seen protein data, struggling to effectively unearth interaction cues between unknown proteins. To further propel advancements in this domain, this paper introduces a novel PPI prediction method jointing masked reconstruction and contrastive learning, termed JmcPPI. This methodology dissects the PPI prediction task into two distinct phases: during the residue structure encoding phase, JmcPPI devises two feature reconstruction tasks and employs graph attention mechanism to capture structural information between residues;during the protein interaction inference phase, JmcPPI perturbs the original PPI graph and employs a multi-graph contrastive learning strategy to thoroughly mine extrinsic interaction information of novel proteins. Extensive experiments conducted on three widely utilized PPI datasets demonstrate that JmcPPI surpasses existing optimal baseline models across various data partition schemes. The associated code can be accessed via https://***/lijfrankopen/JmcPPI. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

Communication-Efficient Personalized Distributed Learning with Data and Node Heterogeneity

学校读者我要写书评

暂无评论

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Tian, Zhuojun Zhang, Zhaoyang Li, Yiwei Bennis, Mehdi Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China University of Oulu Center for Wireless Communications Oulu90014 Finland State Key Laboratory of Industrial Control Technology Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multimodal Communication Networks and Intelligent Information Processing Hangzhou310027 China Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China

To jointly tackle the challenges of data and node heterogeneity in decentralized learning, we propose a distributed strong lottery ticket hypothesis (DSLTH), based on which a communication-efficient personalized learning algorithm is developed. In the proposed method, each local model is represented as the ‌Hadamard product of global real-valued parameters and a personalized binary mask for pruning. The local model is learned by updating and fusing the personalized binary masks while the real-valued parameters are fixed among different agents. To further reduce the complexity of hardware implementation, we incorporate a group sparse regularization term in the loss function, enabling the learned local model to achieve structured sparsity. Then, a binary mask aggregation algorithm is designed by introducing an intermediate aggregation tensor and adding a personalized fine-tuning step in each iteration, which constrains model updates towards the local data distribution. The proposed method effectively leverages the relativity among agents while meeting personalized requirements in heterogeneous node conditions. We also provide a theoretical proof for the DSLTH, establishing it as the foundation of the proposed method. Numerical simulations confirm the validity of the DSLTH and demonstrate the effectiveness of the proposed algorithm. © 2015 IEEE.

关键词： Iterative methods

A fault isolation method using kernel canonical variate analysis-based contribution

学校读者我要写书评

暂无评论

A fault isolation method using kernel canonical variate anal...

第35届中国过程控制会议

作者： Hongxin Wang Lingxia Mu Nan Feng Han Liu Ding Liu Department of Information and Control Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology School of Intelligence Science and Technology University of Science and Technology Beijing

Fault diagnosis and isolation is important for industrial system. In this paper, a kernel canonical variate analysis(KCVA) is proposed for fault isolation. KCVA is originally used as a data dimension reduction technique which can account for nonlinearity and correlations in the industrial dynamical process data. But there are some difficulties using KCVA in the construction of the contribution for the fault isolation. On the one hand, it is difficult to compute the contributions of individual variables because it is scarcely possible to find an inverse mapping from the feature space to the original space. On the other hand, a smearing effect is hardly avoided. To solve the problem, a KCVA-based contributions is proposed using the state subspace and the residual subspace which can isolate the faulty variables effectively. Simulations are conducted on the Tennessee Eastman process to verify the performance of the proposed method.

关键词： Kernel canonical variate analysis contribution plot fault isolation

NPGA: A Unified Algorithmic Framework for Decentralized Constraint-Coupled Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Jingwang Su, Housheng School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan430074 China

This work focuses on a class of general decentralized constraint-coupled optimization problems. We propose a novel nested primal-dual gradient algorithm (NPGA), which can achieve linear convergence under the weakest known condition, and its theoretical convergence rate surpasses all known results. More importantly, NPGA serves not only as an algorithm but also as a unified algorithmic framework, encompassing various existing algorithms as special cases. By designing different network matrices, we can derive numerous versions of NPGA and analyze their convergences by leveraging the convergence results of NPGA conveniently, thereby enabling the design of more efficient algorithms. Finally, we conduct numerical experiments to compare the convergence rates of NPGA and existing algorithms, providing empirical evidence for the superior performance of NPGA. Copyright © 2022, The Authors. All rights reserved.

关键词： Consensus algorithm

Implicit Tracking-Based Distributed Constraint-Coupled Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Jingwang Su, Housheng The School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan430074 China

A class of distributed optimization problem with a globally coupled equality constraint and local constrained sets is studied in this paper. For its special case where local constrained sets are absent, an augmented primal-dual gradient dynamics is proposed and analyzed, but it cannot be implemented distributedly since the violation of the coupled constraint needs to be used. Benefiting from the brand-new comprehending of a classical distributed unconstrained optimization algorithm, the novel implicit tracking approach is proposed to track the violation distributedly, which leads to the birth of the implicit tracking-based distributed augmented primal-dual gradient dynamics (IDEA). A projected variant of IDEA, i.e., Proj-IDEA, is further designed to deal with the general case where local constrained sets exist. With the aid of the Lyapunov stability theory, the convergences of IDEA and Proj-IDEA over undigraphs and digraphs are analyzed respectively. As far as we know, Proj-IDEA is the first constant step-size distributed algorithm which can solve the studied problem without the need of the strict convexity of local cost functions. Besides, if local cost functions are strongly convex and smooth, IDEA can achieve exponential convergence with a weaker condition about the coupled constraint. Finally, numerical experiments are taken to corroborate our theoretical results. © 2022, CC BY.

关键词： Cost functions

GraphCFC: A Directed Graph Based Cross-Modal Feature Complementation Approach for Multimodal Conversational Emotion Recognition

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Jiang Wang, Xiaoping Lv, Guoqing Zeng, Zhigang The School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan430074 China

Emotion Recognition in Conversation (ERC) plays a significant part in Human-Computer Interaction (HCI) systems since it can provide empathetic services. Multimodal ERC can mitigate the drawbacks of uni-modal approaches. Recently, Graph Neural Networks (GNNs) have been widely used in a variety of fields due to their superior performance in relation modeling. In multimodal ERC, GNNs are capable of extracting both long-distance contextual information and inter-modal interactive information. Unfortunately, since existing methods such as MMGCN directly fuse multiple modalities, redundant information may be generated and diverse information may be lost. In this work, we present a directed Graph based Cross-modal Feature Complementation (GraphCFC) module that can efficiently model contextual and interactive information. GraphCFC alleviates the problem of heterogeneity gap in multimodal fusion by utilizing multiple subspace extractors and Pair-wise Cross-modal Complementary (PairCC) strategy. We extract various types of edges from the constructed graph for encoding, thus enabling GNNs to extract crucial contextual and interactive information more accurately when performing message passing. Furthermore, we design a GNN structure called GAT-MLP, which can provide a new unified network framework for multimodal learning. The experimental results on two benchmark datasets show that our GraphCFC outperforms the state-of-the-art (SOTA) approaches. Copyright © 2022, The Authors. All rights reserved.

关键词： Emotion Recognition

Short-term Traffic Flow Prediction by Graph Deep Learning with Spatial Temporal Modeling 2

学校读者我要写书评

暂无评论

Short-term Traffic Flow Prediction by Graph Deep Learning wi...

2nd International Conference on Electronic Information Technology and Smart Agriculture, ICEITSA 2022

作者： Yuan, Lilian Fang, Weilin Xiao, Hongbo Xiao, Jianhua Shi, Yuanquan Yang, Yujun School of Computer Science and Engineering Huaihua University Hunan Huaihua418000 China Intelligent Processing and Application in Hunan Province Universities Key Laboratory of Wuling-Mountain Health Big Data Hunan Huaihua418000 China Wuling-Mountain Ecological Agriculture in Hunan Province Key Laboratory of Intelligent Control Technology for Huaihua Hunan418000 China

ISBN: (纸本)9781665464017

An extensive amount of research applications on traffic flow prediction models taking into account spatio-temporal modeling have been undertaken in recent years. Relative to traditional spatio-temporal modeling approaches, good application results have been achieved in predicting traffic flow. However, in real life, traffic flow proves to be time- and space-dependent, which poses difficulties for accurate modeling of traffic flow prediction. To address these problems, we propose the ST-GNN-GRU model, which mainly contains S-GNN and T-GRU modules. The model uses a combination of spatio-temporal modeling and deep learning, which can not only cope with the spatio-temporal modeling problem, but also improve the traffic flow prediction accuracy. The experiments are conducted using the METR-LA dataset, and the outcomes show that the proposed method performs more effectively than other baseline approaches. © 2022 IEEE.

关键词： Graph neural networks