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

LarTap: A Luminance-aware Framework with Text-correlation Priors for Multi-Exposure Image Fusion

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Wang, Enlong Li, Jiawei Yan, Tiantian Lei, Jia Zhou, Shihua Wang, Bin Liu, Jinyuan Kasabov, Nikola K. Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China University of the Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Xi’an Jiaotong University School of Software Engineering Shaanxi Xi’an710049 China Dalian Univer sity of Technology School of Mechanical Engineering Dalian116024 China Auckland University of Technology Knowledge Engineering and Discovery Research Institute Auckland1061 New Zealand

Conventional imaging devices often struggle to produce high-dynamic-range (HDR) images that accurately represent natural scenes. To overcome this limitation, multi-exposure image fusion (MEF) techniques have been introduced as a viable solution. Existing MEF approaches aim to enhance performance by optimizing or searching architectures. However, they face challenges in precise feature extraction and scene reconstruction, leading to distortion in the fused images. Additionally, most methods do not adequately address luminance variations across different image regions, which may result in the loss of essential details. To address these challenges, we present a novel luminance-aware MEF framework that integrates text-correlation priors (LarTap). By embedding textual information into fusion process, the proposed framework enhances content extraction and comprehension. Specifically, it consist of two key components: the text-image correlation network (N1) and the multi-exposure fusion network (N2). First, N1 performs correlation training to achieve a holistic alignment between text and image pairs. Its iterative vision encoders (VEs) generate text-correlated prior knowledge to facilitate the fusion process in N2. Second, N2 leverages these priors for scene reconstruction and dynamically adjusts luminance based on comparative perception. Extensive experiments on multiple datasets demonstrate that LarTap outperforms state-of-the-art methods. © 1991-2012 IEEE.

关键词： Image correlation

来源：评论

学校读者我要写书评

暂无评论

Cross-Inhibitor: A time-sensitive molecular circuit based on DNA strand displacement

引用

Nucleic Acids Research 2020年第19期48卷 10691-10701页

作者： Liu, Chanjuan Liu, Yuan Zhu, Enqiang Zhang, Qiang Wei, Xiaopeng Wang, Bin School of Computer Science and Technology Dalian University of Technology Dalian 116024 China Institute of Computing Science and Technology Guangzhou University Guangzhou 510006 China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian 116622 China

designing biochemical systems that can be effectively used in diverse fields, including diagnostics, molecular computing and nanomachines, has long been recognized as an important goal of molecular programming and DNA nanotechnology. A key issue in the development of such practical devices on the nanoscale lies in the development of biochemical components with information-processing capacity. In this article, we propose a molecular device that utilizes DNA strand displacement networks and allows interactive inhibition between two input signals;thus, it is termed a cross-inhibitor. More specifically, the device supplies each input signal with a processor such that the processing of one input signal will interdict the signal of the other. Biochemical experiments are conducted to analyze the interdiction performance with regard to effectiveness, stability and controllability. To illustrate its feasibility, a biochemical framework grounded in this mechanism is presented to determine the winner of a tic-tac-toe game. Our results highlight the potential for DNA strand displacement cascades to act as signal controllers and event triggers to endow molecular systems with the capability of controlling and detecting events and signals. © 2020 The Author(s). Published by Oxford University Press on behalf of Nucleic Acids Research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RobustPFL: Robust Personalized Federated Learning

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Chen, Guorong Wang, Wei Wu, Yufang Li, Chao Xu, Guangquan Ji, Shouling Li, Tao Shen, Meng Han, Yufei Xi'an Jiaotong University Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an China Beijing Jiaotong University 3 Shangyuancun Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China Tianjin University Tianjin Key Laboratory of Advanced Networking College of Intelligence and Computing Tianjin300350 China Zhejiang University College of Computer Science and Technology Hangzhou310027 China ITAI Haihe Lab Tianjin China Nankai University College of Computer Science Tianjin300350 China Beijing Institute of Technology School of Cyberspace Security Beijing100081 China Peng Cheng Laboratory Cyberspace Security Research Center Shenzhen518066 China INRIA Bretagne Rennes35042 France

Conventional federated learning (FL) coordinated by a central server focuses on training a global model and protecting the privacy of clients' training data by storing it locally. However, the statistical heterogeneity hinders the global model from adapting to the non-IID distributions among clients. Moreover, untrusted and unreliable central servers and malicious clients may compromise model integrity and availability, thus degrading the robustness of FL. To address these challenges, we present RobustPFL, a decentralized personalized federated learning (PFL) approach that combines α-based Layer-position Normalized Similarity (α-LNS) and local collaborative training to improve personalized performance while utilizing a blockchain-based committee mechanism to coordinate the aggregation process, thereby achieving high personalized accuracy and robustness. Extensive experiments show that our RobustPFL approach outperforms multiple algorithms, including Local training, FedAvg, FedReptile, Per-FedAvg, FedBN, and SPFL, on MNIST, CIFAR10, EMNIST, and N-BaIoT datasets in four non-IID settings. We also evaluate RobustPFL's effectiveness against attacks - poisoning attacks and free-riding attacks. Particularly, for three prevalent poisoning attacks (backdoor, label flipping, and model poisoning attacks), we compare non-defensive (FedAvg) and defensive (Krum, trimmed mean, Bulyan, FedBN, FLAME, and FangTrmean) methods with our proposed RobustPFL. The results show that our approach achieves significant defensive effects. © 2004-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization

arXiv

引用

arXiv 2023年

作者： Yuan, Haonan Sun, Qingyun Fu, Xingcheng Zhang, Ziwei Ji, Cheng Peng, Hao Li, Jianxin Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University China School of Computer Science and Engineering Beihang University China Key Lab of Education Blockchain and Intelligent Technology Guangxi Normal University China Department of Computer Science and Technology Tsinghua University China

Dynamic graph neural networks (DGNNs) are increasingly pervasive in exploiting spatio-temporal patterns on dynamic graphs. However, existing works fail to generalize under distribution shifts, which are common in real-world scenarios. As the generation of dynamic graphs is heavily influenced by latent environments, investigating their impacts on the out-of-distribution (OOD) generalization is critical. However, it remains unexplored with the following two major challenges: (1) How to properly model and infer the complex environments on dynamic graphs with distribution shifts? (2) How to discover invariant patterns given inferred spatio-temporal environments? To solve these challenges, we propose a novel Environment-Aware dynamic Graph LEarning (EAGLE) framework for OOD generalization by modeling complex coupled environments and exploiting spatiotemporal invariant patterns. Specifically, we first design the environment-aware EA-DGNN to model environments by multi-channel environments disentangling. Then, we propose an environment instantiation mechanism for environment diversification with inferred distributions. Finally, we discriminate spatio-temporal invariant patterns for out-of-distribution prediction by the invariant pattern recognition mechanism and perform fine-grained causal interventions node-wisely with a mixture of instantiated environment samples. Experiments on real-world and synthetic dynamic graph datasets demonstrate the superiority of our method against state-of-the-art baselines under distribution shifts. To the best of our knowledge, we are the first to study OOD generalization on dynamic graphs from the environment learning perspective. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning Visual Navigation Model Integrating Memory-prediction Mechanism

Deep Reinforcement Learning Visual Navigation Model Integrat...

引用

International Conference on Computer Supported Cooperative Work in design

作者： Qian Xiao Pengfei Yi Rui Liu Jing Dong Dongsheng Zhou Qiang Zhang Key Laboratory of Advanced Design and Intelligent Computing (Ministry of Education) Dalian University Dalian China Dalian University and Dalian University of Technology Dalian China

ISBN: (纸本)9781728165981

Deep reinforcement learning (DRL) has been widely used in the field of visual navigation. However, due to the lack of adaptability of DRL to the new tasks, the generalization ability of current visual navigation model using DRL is not desired. In order to improve this deficiency, we introduce the memory-prediction mechanism. By enhancing the memory of the scene, and combining the past experience of navigation to predict the next state, a more reasonable action can be obtained. First, we pass the image features extracted during the navigation process to an LSTM, and use LSTM to memorize the scene information in the image features. Then, we combine all the information (including state, target, and action) of each time step in the navigation process, and pass the historical information of multiple time steps to another LSTM to predict the next state. The action performed by the robot is determined by the predicted state. We use the AI2-THOR framework to carry out experiments. The results show that the proposed method can improve the navigation performance of the DRL visual navigation model and improve its adaptability to new tasks.

关键词： Training Visualization Adaptation models Navigation Computational modeling Semantics Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Human-robot Interaction Method Combining Human Pose Estimation and Motion Intention Recognition

Human-robot Interaction Method Combining Human Pose Estimati...

引用

International Conference on Computer Supported Cooperative Work in design

作者： Yalin Cheng Pengfei Yi Rui Liu Jing Dong Dongsheng Zhou Qiang Zhang Ministry of Education Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian China Dalian University and Dalian University of Technology Dalian China

Although human pose estimation technology based on RGB images is becoming more and more mature, most of the current mainstream methods rely on depth camera to obtain human joints information. These interaction frameworks are affected by the infrared detection distance so that they cannot well adapt to the interaction scene of different distance. Therefore, the purpose of this paper is to build a modular interactive framework based on RGB images, which aims to alleviate the problem of high dependence on depth camera and low adaptability to distance in the current human-robot interaction (HRI) framework based on human body by using advanced human pose estimation technology. To enhance the adaptability of the HRI framework to different distances, we adopt optical cameras instead of depth cameras as acquisition equipment. Firstly, the human joints information is extracted by a human pose estimation network. Then, a joints sequence filter is designed in the intermediate stage to reduce the influence of unreasonable skeletons on the interaction results. Finally, a human intention recognition model is built to recognize the human intention from reasonable joints information, and drive the robot to respond according to the predicted intention. The experimental results show that our interactive framework is more robust in the distance than the framework based on depth camera and is able to achieve effective interaction under different distances, illuminations, costumes, customers, and scenes.

关键词： Optical filters Pose estimation Robot vision systems Human-robot interaction Lighting Predictive models Cameras

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Geometric Latent Diffusion Model for Graph Generation

arXiv

引用

arXiv 2024年

作者： Fu, Xingcheng Gao, Yisen Wei, Yuecen Sun, Qingyun Peng, Hao Li, Jianxin Li, Xianxian Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

Diffusion models have made significant contributions to computer vision, sparking a growing interest in the community recently regarding the application of them to graph generation. Existing discrete graph diffusion models exhibit heightened computational complexity and diminished training efficiency. A preferable and natural way is to directly diffuse the graph within the latent space. However, due to the non-Euclidean structure of graphs is not isotropic in the latent space, the existing latent diffusion models effectively make it difficult to capture and preserve the topological information of graphs. To address the above challenges, we propose a novel geometrically latent diffusion framework HypDiff. Specifically, we first establish a geometrically latent space with interpretability measures based on hyperbolic geometry, to define anisotropic latent diffusion processes for graphs. Then, we propose a geometrically latent diffusion process that is constrained by both radial and angular geometric properties, thereby ensuring the preservation of the original topological properties in the generative graphs. Extensive experimental results demonstrate the superior effectiveness of HypDiff for graph generation with various topologies. Copyright © 2024, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Dong, Xuewen Li, Jiachen Li, Shujun You, Zhichao Qu, Qiang Kholodov, Yaroslav Shen, Yulong The 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 The School of Computing Kent Interdisciplinary Research Centre in Cyber Security University of Kent CanterburyCT2 7NF United Kingdom Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China The Intelligent Transportation Systems Lab Innopolis University Innopolis Russia The School of Computer Science and Technology Xidian University 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%. © 2004-2012 IEEE. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Algorithmic fairness in social context

引用

BenchCouncil Transactions on Benchmarks, Standards and Evaluations 2023年第3期3卷 100137-100137页

作者： Huang, Yunyou Liu, Wenjing Gao, Wanling Lu, Xiangjiang Liang, Xiaoshuang Yang, Zhengxin Li, Hongxiao Ma, Li Tang, Suqin Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University No. 15 Yucai Road Qixing District Guangxi Guilin541004 China Research Center for Advanced Computer Systems Institute of Computing Technology Chinese Academy of Sciences No. 6 Kexueyuan South Road Haidian District Beijing 100190 China

Algorithmic fairness research is currently receiving significant attention, aiming to ensure that algorithms do not discriminate between different groups or individuals with similar characteristics. However, with the popularization of algorithms in all aspects of society, algorithms have changed from mere instruments to social infrastructure. For instance, facial recognition algorithms are widely used to provide user verification services and have become an indispensable part of many social infrastructures like transportation, health care, etc. As an instrument, an algorithm needs to pay attention to the fairness of its behavior. However, as a social infrastructure, it needs to pay even more attention to its impact on social fairness. Otherwise, it may exacerbate existing inequities or create new ones. For example, if an algorithm treats all passengers equally and eliminates special seats for pregnant women in the interest of fairness, it will increase the risk of pregnant women taking public transport and indirectly damage their right to fair travel. Therefore, algorithms have the responsibility to ensure social fairness, not just within their operations. It is now time to expand the concept of algorithmic fairness beyond mere behavioral equity, assessing algorithms in a broader societal context, and examining whether they uphold and promote social fairness. This article analyzes the current status and challenges of algorithmic fairness from three key perspectives: fairness definition, fairness dataset, and fairness algorithm. Furthermore, the potential directions and strategies to promote the fairness of the algorithm are proposed. © 2023 The Authors

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

MLFuse: Multi-Scenario Feature Joint Learning for Multi-Modality Image Fusion

引用

IEEE Transactions on Multimedia 2025年

作者： Lei, Jia Li, Jiawei Liu, Jinyuan Wang, Bin Zhou, Shihua Zhang, Qiang Wei, Xiaopeng Kasabov, Nikola K. Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Dalian University of Technology School of Mechanical Engineering Dalian116024 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China Auckland University of Technology Knowledge Engineering and Discovery Research Institute Auckland1010 New Zealand Ulster University Intelligent Systems Research Center LondonderryBT52 1SA United Kingdom

Multi-modality image fusion (MMIF) entails synthesizing images with detailed textures and prominent objects. Existing methods tend to use general feature extraction to handle different fusion tasks. However, these methods have difficulty breaking fusion barriers across various modalities owing to the lack of targeted learning routes. In this work, we propose a multi-scenario feature joint learning architecture, MLFuse, that employs the commonalities of multi-modality images to deconstruct the fusion progress. Specifically, we construct a cross-modal knowledge reinforcing network that adopts a multipath calibration strategy to promote information communication between different images. In addition, two professional networks are developed to maintain the salient and textural information of fusion results. The spatial-spectral domain optimizing network can learn the vital relationship of the source image context with the help of spatial attention and spectral attention. The edge-guided learning network utilizes the convolution operations of various receptive fields to capture image texture information. The desired fusion results are obtained by aggregating the outputs from the three networks. Extensive experiments demonstrate the superiority of MLFuse for infrared-visible image fusion and medical image fusion. The excellent results of downstream tasks (i.e., object detection and semantic segmentation) further verify the high-quality fusion performance of our method. The code is publicly available at https://***/jialei-sc/MLFuse. © 1999-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：