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

IEEE Transactions on Artificial Intelligence 2025年

作者： Hu, Xiantao Zhong, Bineng Liang, Qihua Shi, Liangtao Mo, Zhiyi Tai, Ying Yang, Jian Guangxi Normal University Guangxi Key Lab of Multi-Source Information Mining Guilin541004 China Guangxi Normal University Security Guilin541004 China Guangxi Normal University Intelligent Technology Guilin541004 China Guangxi Normal University Ministry of Education Guilin541004 China Wuzhou University School of Data Science Wuzhou543002 China Wuzhou University Software Engineering Wuzhou543002 China Nanjing University State Key Laboratory for Novel Software Technology Suzhou215163 China Nanjing University of Science and Technology School of Computer Science Nanjing210094 China Nanjing University of Science and Technology Engineering Nanjing210094 China

Recently, many multi-modal trackers prioritize RGB as the dominant modality, treating other modalities as auxiliary, and fine-tuning separately various multi-modal tasks. This imbalance in modality dependence limits the ability of methods to dynamically utilize complementary information from each modality in complex scenarios, making it challenging to fully perceive the advantages of multi-modal. As a result, a unified parameter model often underperforms in various multi-modal tracking tasks. To address this issue, we propose APTrack, a novel unified tracker designed for multi-modal adaptive perception. Unlike previous methods, APTrack explores a unified representation through an equal modeling strategy. This strategy allows the model to dynamically adapt to various modalities and tasks without requiring additional fine-tuning between different tasks. Moreover, our tracker integrates an adaptive modality interaction (AMI) module that efficiently bridges cross-modality interactions by generating learnable tokens. Experiments conducted on five diverse multi-modal datasets (RGBT234, LasHeR, VisEvent, DepthTrack, and VOT-RGBD2022) demonstrate that APTrack not only surpasses existing state-of-the-art unified multi-modal trackers but also outperforms trackers designed for specific multi-modal tasks. © 2020 IEEE.

关键词： Multicarrier modulation

来源：评论

学校读者我要写书评

暂无评论

A Generalized Hybrid Hoare Logic

arXiv

引用

arXiv 2023年

作者： Zhan, Naijun Jin, Xiangyu Zhan, Bohua Wang, Shuling Guelev, Dimitar School of Computer Science Peking University Institute of Software Chinese Academy of Sciences Beijing China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences University of CAS Beijing China Huawei Technologies Co. Ltd. Beijing China National Key Laboratory of Space Integrated Information System Institute of Software Chinese Academy of Sciences University of CAS Beijing China Institute of Mathematics and Informatics Bulgarian Academy of Sciences Sofia Bulgaria

Deductive verification of hybrid systems (HSs) increasingly attracts more attention in recent years because of its power and scalability, where a powerful specification logic for HSs is the cornerstone. Often, HSs are naturally modelled by concurrent processes that communicate with each other. However, existing specification logics cannot easily handle such models. In this paper, we present a specification logic and proof system for Hybrid Communicating Sequential Processes (HCSP), that extends CSP with ordinary differential equations (ODE) and interrupts to model interactions between continuous and discrete evolution. Because it includes a rich set of algebraic operators, complicated hybrid systems can be easily modelled in an algebra-like compositional way in HCSP. Our logic can be seen as a generalization and simplification of existing hybrid Hoare logics (HHL) based on duration calculus (DC), as well as a conservative extension of existing Hoare logics for concurrent programs. Its assertion logic is the first-order theory of differential equations (FOD), together with assertions about traces recording communications, readiness, and continuous *** prove continuous relative completeness of the logic w.r.t. FOD, as well as discrete relative completeness in the sense that continuous behaviour can be arbitrarily approximated by discretization. Finally, we implement the above logic in Isabelle/HOL, and apply it to verify two case studies to illustrate the power and scalability of our logic. Copyright © 2023, The Authors. All rights reserved.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Detecting Backdoors During the Inference Stage Based on Corruption Robustness Consistency

Detecting Backdoors During the Inference Stage Based on Corr...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Xiaogeng Liu Minghui Li Haoyu Wang Shengshan Hu Dengpan Ye Hai Jin Libing Wu Chaowei Xiao School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Software Engineering Huazhong University of Science and Technology School of Cyber Science and Engineering Wuhan University School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab Arizona State University

Deep neural networks are proven to be vulnerable to backdoor attacks. Detecting the trigger samples during the inference stage, i.e., the test-time trigger sample detection, can prevent the backdoor from being triggered. However, existing detection methods often require the defenders to have high accessibility to victim models, extra clean data, or knowledge about the appearance of backdoor triggers, limiting their practicality. In this paper, we propose the test-time corruption robustness consistency evaluation (TeCo) 1 1 https://***/CGCL-codes/TeCo, a novel test-time trigger sample detection method that only needs the hard-label outputs of the victim models without any extra information. Our journey begins with the intriguing observation that the backdoor-infected models have similar performance across different image corruptions for the clean images, but perform discrepantly for the trigger samples. Based on this phenomenon, we design TeCo to evaluate test-time robustness consistency by calculating the deviation of severity that leads to predictions' transition across different corruptions. Extensive experiments demonstrate that compared with state-of-the-art defenses, which even require either certain information about the trigger types or accessibility of clean data, TeCo outperforms them on different backdoor attacks, datasets, and model architectures, enjoying a higher AUROC by 10% and 5 times of stability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lens-to-Lens Bokeh Effect Transformation. NTIRE 2023 Challenge Report

Lens-to-Lens Bokeh Effect Transformation. NTIRE 2023 Challen...

引用

2023 IEEE/CVF Conference on computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Conde, Marcos V. Kolmet, Manuel Seizinger, Tim Bishop, Tom E. Timofte, Radu Kong, Xiangyu Zhang, Dafeng Wu, Jinlong Wang, Fan Peng, Juewen Pan, Zhiyu Liu, Chengxin Luo, Xianrui Sun, Huiqiang Shen, Liao Cao, Zhiguo Xian, Ke Liu, Chaowei Chen, Zigeng Yang, Xingyi Liu, Songhua Jing, Yongcheng Mi, Michael Bi Wang, Xinchao Yang, Zhihao Lian, Wenyi Lai, Siyuan Zhang, Haichuan Hoang, Trung Yazdani, Amirsaeed Monga, Vishal Luo, Ziwei Gustafsson, Fredrik K. Zhao, Zheng Sjölund, Jens Schön, Thomas B. Zhao, Yuxuan Chen, Baoliang Xu, Yiqing Niu, Jixiang Computer Vision Lab CAIDAS IFI University of Würzburg Germany Glass Imaging Inc. China Huazhong University of Science and Technology China Nanyang Technological University Singapore National University of Singapore Singapore University of Sydney Australia Huawei Uppsala University Sweden Department of Electrical Engineering Pennsylvania State University United States Department of Information Technology Uppsala University Sweden Key Laboratory of Intelligent Perception and Image Understanding of the Ministry of Education Xidian University Xi'an China North China University of Technology China

ISBN: (纸本)9798350302493

We present the new Bokeh Effect Transformation Dataset (BETD), and review the proposed solutions for this novel task at the NTIRE 2023 Bokeh Effect Transformation Challenge. Recent advancements of mobile photography aim to reach the visual quality of full-frame cameras. Now, a goal in computational photography is to optimize the Bokeh effect itself, which is the aesthetic quality of the blur in out-of-focus areas of an image. Photographers create this aesthetic effect by benefiting from the lens optical *** aim of this work is to design a neural network capable of converting the the Bokeh effect of one lens to the effect of another lens without harming the sharp foreground regions in the image. For a given input image, knowing the target lens type, we render or transform the Bokeh effect accordingly to the lens properties. We build the BETD using two full-frame Sony cameras, and diverse lens *** the best of our knowledge, we are the first attempt to solve this novel task, and we provide the first BETD dataset and benchmark for it. The challenge had 99 registered participants. The submitted methods gauge the state-of-the-art in Bokeh effect rendering and transformation. © 2023 IEEE.

关键词： Color photography

来源：评论

学校读者我要写书评

暂无评论

GrabDAE: An Innovative Framework for Unsupervised Domain Adaptation Utilizing Grab-Mask and Denoise Auto-Encoder

arXiv

引用

arXiv 2024年

作者： Chen, Junzhou Wen, Xuan Zhang, Ronghui Ren, Bingtao Wu, Di Xu, Zhigang Wang, Danwei The Guangdong Provincial Key Laboratory of Intelligent Transport System School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou510275 China The School of Transportation Science and Engineering Beihang University State Key Lab of Intelligent Transportation System Beijing100191 China The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China The Guangdong Key Laboratory of Big Data Analysis and Processing Guangdong510006 China The School of Information Engineering Chang’an University Shaanxi Xi’an710064 China The School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore

Unsupervised Domain Adaptation (UDA) aims to adapt a model trained on a labeled source domain to an unlabeled target domain by addressing the domain shift. Existing Unsupervised Domain Adaptation (UDA) methods often fall short in fully leveraging contextual information from the target domain, leading to suboptimal decision boundary separation during source and target domain alignment. To address this, we introduce GrabDAE, an innovative UDA framework designed to tackle domain shift in visual classification tasks. GrabDAE incorporates two key innovations: the Grab-Mask module, which blurs background information in target domain images, enabling the model to focus on essential, domain-relevant features through contrastive learning;and the Denoising Auto-Encoder (DAE), which enhances feature alignment by reconstructing features and filtering noise, ensuring a more robust adaptation to the target domain. These components empower GrabDAE to effectively handle unlabeled target domain data, significantly improving both classification accuracy and robustness. Extensive experiments on benchmark datasets, including VisDA-2017, OfficeHome, and Office31, demonstrate that GrabDAE consistently surpasses state-of-the-art UDA methods, setting new performance benchmarks. By tackling UDA’s critical challenges with its novel feature masking and denoising approach, GrabDAE offers both significant theoretical and practical advancements in domain adaptation. © 2024, CC BY-NC-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Consistency and Diversity induced Human Motion Segmentation

arXiv

引用

arXiv 2022年

作者： Zhou, Tao Fu, Huazhu Gong, Chen Shao, Ling Porikli, Fatih Ling, Haibin Shen, Jianbing The PCA Lab The Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Institute of High Performance Computing Agency for Science Technology and Research Singapore Riyadh Saudi Arabia The Research School of Engineering The Australian National University Australia The Department of Computer Science Stony Brook University Strony Brook NY United States The State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University United States

Subspace clustering is a classical technique that has been widely used for human motion segmentation and other related tasks. However, existing segmentation methods often cluster data without guidance from prior knowledge, resulting in unsatisfactory segmentation results. To this end, we propose a novel Consistency and Diversity induced human Motion Segmentation (CDMS) algorithm. Specifically, our model factorizes the source and target data into distinct multi-layer feature spaces, in which transfer subspace learning is conducted on different layers to capture multi-level information. A multi-mutual consistency learning strategy is carried out to reduce the domain gap between the source and target data. In this way, the domain-specific knowledge and domain-invariant properties can be explored simultaneously. Besides, a novel constraint based on the Hilbert Schmidt Independence Criterion (HSIC) is introduced to ensure the diversity of multi-level subspace representations, which enables the complementarity of multi-level representations to be explored to boost the transfer learning performance. Moreover, to preserve the temporal correlations, an enhanced graph regularizer is imposed on the learned representation coefficients and the multi-level representations of the source data. The proposed model can be efficiently solved using the Alternating Direction Method of Multipliers (ADMM) algorithm. Extensive experimental results on public human motion datasets demonstrate the effectiveness of our method against several state-of-the-art approaches. Copyright © 2022, The Authors. All rights reserved.

关键词： Motion analysis

来源：评论

学校读者我要写书评

暂无评论

PPO-Based Vehicle Control for Ramp Merging Scheme Assisted by Enhanced C-V2X

arXiv

引用

arXiv 2025年

作者： Wu, Qiong Ji, Maoxin Fan, Pingyi Wang, Kezhi Cheng, Nan Chen, Wen Letaief, Khaled B. The School of Internet of Things Engineering Jiangnan University Wuxi214122 China The Department of Electronic Engineering State Key laboratory of Space Network and Communications Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China The Department of Computer Science Brunel University Middlesex LondonUB8 3PH United Kingdom The State Key Lab. of ISN School of Telecommunications Engineering Xidian University Xi’an710071 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China Hong Kong

On-ramp merging presents a critical challenge in autonomous driving, as vehicles from merging lanes need to dynamically adjust their positions and speeds while monitoring traffic on the main road to prevent collisions. To address this challenge, we propose a novel merging control scheme based on reinforcement learning, which integrates lateral control mechanisms. This approach ensures the smooth integration of vehicles from the merging lane onto the main road, optimizing both fuel efficiency and passenger comfort. Furthermore, we recognize the impact of vehicle-to-vehicle (V2V) communication on control strategies and introduce an enhanced protocol leveraging Cellular Vehicle-to-Everything (C-V2X) Mode 4. This protocol aims to reduce the Age of Information (AoI) and improve communication reliability. In our simulations, we employ two AoI-based metrics to rigorously assess the protocol's effectiveness in autonomous driving scenarios. By combining the NS3 network simulator with Python, we simulate V2V communication and vehicle control simultaneously. The results demonstrate that the enhanced C-V2X Mode 4 outperforms the standard version, while the proposed control scheme ensures safe and reliable vehicle operation during on-ramp merging. Copyright © 2025, The Authors. All rights reserved.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

Nuwa: An Authoring Tool for Graph Visualizations

Nuwa: An Authoring Tool for Graph Visualizations

引用

Pacific (formerly Asia-Pacific APVIS) Visualization Symposium

作者： Dongming Han Haiyang Zhu Wei Chen Jiacheng Pan Ran Chen Xumeng Wang Zhen Wen Luoxuan Weng Minfeng Zhu Yingcai Wu Rüdiger Westermann State Key Lab of CAD&CG Zhejiang University China Hithink RoyalFlush Information Network Co. Ltd. China Wuchan Zhongda Digital Technology Co. Ltd. China Laboratory of Art and Archaeology Image (Zhejiang University) Ministry of Education China College of Computer Science Nankai University China Zhejiang University China Computer Graphics and Visualization Technical University of Munich Germany

ISBN: (数字)9798350393804

ISBN: (纸本)9798350393811

Authoring graph visualization requires advanced programming skills, expert domain knowledge, and significant workload. Existing authoring tools either support limited templates of graph visualization, or suffer from a high learning cost. We analyze the design requirements on a tool for graph visualizations, and contribute Nuwa, a user-friendly declarative authoring tool for the interactive specification of graph visualizations in terms of data, entity, change, and encoding. Our implementation empowers users to conveniently create, compare, and modulate comprehensive graph visualizations with a wide range of styles. We showcase various examples to verify the expressiveness of Nuwa. Via an expert interview and the analysis on cognitive dimensions we evaluate the usability of Nuwa.

关键词： Analytical models Authoring systems Costs Semantics Data visualization Prototypes Programming

来源：评论

学校读者我要写书评

暂无评论

A Many-Objective Evolutionary Algorithm Assisted by Ideal Hyperplane

SSRN

引用

SSRN 2022年

作者： Zhang, Zhixia Wen, Jie Wang, Hui Cai, Xingjuan Cui, Zhihua Zhang, Wensheng School of Computer Science and Technology Taiyuan University of Science and Technology China School of Information Engineering Nanchang Institute of Technology Nanchang330099 China State Key Laboratory of Intelligent Control and Management of Complex System Institute of Automation Chinese Academy of Sciences China State Key Lab. for Novel Software Technology Nanjing University China

In many-objective optimization problems (MaOPs), it is a difficult task for evolutionary algorithms to balance convergence and diversity while rapidly converging to the Pareto front. As the number of objectives increases, the difficulty of evolutionary algorithms increases with individual selection pressure. To address above problems, we propose a many-objective evolution algorithm assisted by an ideal hyperplane (MaOEA-IH). Firstly, the ideal hyperplane as a reference surface to guide the individual to search the Pareto front, which is established from the extremum of each dimension of the objective space. Secondly, a parallel p -norm mating selection strategy is proposed to improve convergence. In addition, two factors are considered in this strategy: 1) different p -norm are used to measure different spatial scales;2) individual selection uncertainty is defined by incorporating a probabilistic perturbation mechanism. Thirdly, the improved shift-based density estimation strategy is used as the evaluation criterion for environmental selection to improve the convergence and diversity of solution sets and enhance selection pressure. To verify the effectiveness of the proposed algorithm, MAOEA-IH is compared with seven excellent algorithms in three benchmark sets (DTLZ, WFG and MaF). The results show that the proposed MAOEA-IH is highly competitive in solving MaOPs. © 2022, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Extended $T$T: Learning With Mixed Closed-Set and Open-Set Noisy labels

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2022年第3期45卷 3047-3058页

作者： Xiaobo Xia Bo Han Nannan Wang Jiankang Deng Jiatong Li Yinian Mao Tongliang Liu Trustworthy Machine Learning Lab School of Computer Science Faculty of Engineering University of Sydney Camperdown NSW Australia Department of Computer Science Hong Kong Baptist University Hong Kong State Key Laboratory of Integrated Services Networks School of Telecommunications Engineering Xidian University Xi'an Shaanxi China Department of Computing Imperial College London London U.K. Meituan Beijing China

The noise transition matrix $T$ , reflecting the probabilities that true labels flip into noisy ones, is of vital importance to model label noise and build statistically consistent classifiers. The traditional transition matrix is limited to model closed-set label noise, where noisy training data have true class labels within the noisy label set. It is unfitted to employ such a transition matrix to model open-set label noise, where some true class labels are outside the noisy label set. Therefore, when considering a more realistic situation, i.e., both closed-set and open-set label noises occur, prior works will give unbelievable solutions. Besides, the traditional transition matrix is mostly limited to model instance-independent label noise, which may not perform well in practice. In this paper, we focus on learning with the mixed closed-set and open-set noisy labels. We address the aforementioned issues by extending the traditional transition matrix to be able to model mixed label noise, and further to the cluster-dependent transition matrix to better combat the instance-dependent label noise in real-world applications. We term the proposed transition matrix as the cluster-dependent extended transition matrix. An unbiased estimator (i.e., extended $T$ -estimator) has been designed to estimate the cluster-dependent extended transition matrix by only exploiting the noisy data. Comprehensive experiments validate that our method can better cope with realistic label noise, following its more robust performance than the prior state-of-the-art label-noise learning methods.

关键词： Noise measurement Training Training data Data models Search engines Face recognition computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：