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

arXiv 2023年

作者： Zhou, Da-Wei Zhang, Yuanhan Wang, Yan Ning, Jingyi Ye, Han-Jia Zhan, De-Chuan Liu, Ziwei School of Artificial Intelligence Nanjing University National Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China S-Lab College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

Class-Incremental Learning (CIL) or continual learning is a desired capability in the real world, which requires a learning system to adapt to new tasks without forgetting former ones. While traditional CIL methods focus on visual information to grasp core features, recent advances in Vision-Language Models (VLM) have shown promising capabilities in learning generalizable representations with the aid of textual information. However, when continually trained with new classes, VLMs often suffer from catastrophic forgetting of former knowledge. Applying VLMs to CIL poses two major challenges: 1) how to adapt the model without forgetting;and 2) how to make full use of the multi-modal information. To this end, we propose PROjectiOn Fusion (PROOF) that enables VLMs to learn without forgetting. To handle the first challenge, we propose training task-specific projections based on the frozen image/text encoders. When facing new tasks, new projections are expanded, and former projections are fixed, alleviating the forgetting of old concepts. For the second challenge, we propose the fusion module to better utilize the cross-modality information. By jointly adjusting visual and textual features, the model can capture better task-specific semantic information that facilitates recognition. Extensive experiments on nine benchmark datasets with various continual learning scenarios and various VLMs validate that PROOF achieves state-of-the-art performance. Code is available at https://***/zhoudw-zdw/PROOF. Copyright © 2023, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Random Route Mutation Mechanism for Moving Target Defense in SDN 6

Dynamic Random Route Mutation Mechanism for Moving Target De...

引用

6th International Symposium on Computer and Information Processing technology, ISCIPT 2021

作者： Zhang, Bofeng Han, Li Sun, Shimin Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology National Engineering Laboratory for Computer Virus Prevention and Control Technology Tianjin China Tiangong University Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Computer Science and Technology Tianjin China

ISBN: (纸本)9781665441377

Moving Target Defense (MTD) is commonly used in changing the asymmetric situation between attack and defense in cyberspace. Route mutation is a vital branch of MTD. Current route mutation methods still have some limitations on unpredictability of mutating routing paths and time overhead. In this paper, we propose a Dynamic Random Route Mutation (DRRM) mechanism in order to maximize the unpredictability of mutation and reduce the time overhead. First, we adopt Jaccard distance matrix and temporal constraint to improve mutation space. Mutation space can be dynamically shifted to enhance the unpredictability. Then, we weaken attackers' capabilities of launching effective eavesdropping at a certain node by using route weight. Finally, we construct a pre-distribution strategy to reduce the transmission latency caused by route mutation. Simulation results show that DRRM not only raises the difficulty of network eavesdropping, but also ensures low mutation time overhead. © 2021 IEEE.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Learning domain-aware detection head with prompt tuning 23

Learning domain-aware detection head with prompt tuning

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Haochen Li Rui Zhang Hantao Yao Xinkai Song Yifan Hao Yongwei Zhao Ling Li Yunji Chen Intelligent Software Research Center Institute of Software CAS Beijing China and University of Chinese Academy of Sciences Beijing China State Key Lab of Processors Institute of Computing Technology CAS Beijing China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation CAS Beijing China State Key Lab of Processors Institute of Computing Technology CAS Beijing China and University of Chinese Academy of Sciences Beijing China

Domain adaptive object detection (DAOD) aims to generalize detectors trained on an annotated source domain to an unlabelled target domain. However, existing methods focus on reducing the domain bias of the detection backbone by inferring a discriminative visual encoder, while ignoring the domain bias in the detection head. Inspired by the high generalization of vision-language models (VLMs), applying a VLM as the robust detection backbone following a domain-aware detection head is a reasonable way to learn the discriminative detector for each domain, rather than reducing the domain bias in traditional methods. To achieve the above issue, we thus propose a novel DAOD framework named Domain-Aware detection head with Prompt tuning (DA-Pro), which applies the learnable domain-adaptive prompt to generate the dynamic detection head for each domain. Formally, the domain-adaptive prompt consists of the domain-invariant tokens, domain-specific tokens, and the domain-related textual description along with the class label. Furthermore, two constraints between the source and target domains are applied to ensure that the domain-adaptive prompt can capture the domains-shared and domain-specific knowledge. A prompt ensemble strategy is also proposed to reduce the effect of prompt disturbance. Comprehensive experiments over multiple cross-domain adaptation tasks demonstrate that using the domain-adaptive prompt can produce an effectively domain-related detection head for boosting domain-adaptive object detection. Our code is available at https://***/Therock90421/DA-Pro.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Detailed Human Shape Estimation from Multi-view Color Images 11th

Unsupervised Detailed Human Shape Estimation from Multi-view...

引用

11th International Conference on Image and Graphics, ICIG 2021

作者： Zheng, Huayu Wang, Kangkan Li, Wei Yang, Jian Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing China Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China State Key Lab for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9783030873578

This paper presents a novel framework to estimate detailed human body shape from color images in an unsupervised manner. It is a challenging task due to factors such as variations in human shapes, occlusion, and cloth details. The existing methods are mainly supervised and require a large number of ground truth real training data which is usually hard to obtain. To solve this problem, we propose an unsupervised detailed human shape estimation method from multi-view color images. Specifically, we first predict the depth map for the source view through robust photometric consistency with different views. Then, we predict the initial SMPL model from the color image and refine it by an iterative error feedback regressor based on point clouds of the predicted depth map. Finally, the refined SMPL model is deformed to fit the details (i.e., clothes and faces) on the point clouds to recover the detailed human shapes which are represented by adding a set of offsets to the SMPL model. The experimental results on different dataset demonstrate that our method outperforms the state-of-the-art methods and achieves higher reconstruction accuracy. © 2021, Springer Nature Switzerland AG.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

SGNet: Salient Geometric Network for Point Cloud Registration

SGNet: Salient Geometric Network for Point Cloud Registratio...

引用

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

作者： Qianliang Wu Yaqing Ding Lei Luo Haobo Jiang Shuo Gu Chuanwei Zhou Jin Xie Jian Yang PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Visual Recognition Group Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Intelligence Science and Technology Nanjing University Suzhou China

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

Point Cloud Registration (PCR) is a critical and challenging task in computer vision and robotics. One of the primary difficulties in PCR is identifying salient and meaningful points that exhibit consistent semantic and geometric properties across different scans. Previous methods have encountered challenges with ambiguous matching due to the similarity among patch blocks throughout the entire point cloud and the lack of consideration for efficient global geometric consistency. To address these issues, we propose a new framework that includes several novel techniques. Firstly, we introduce a semantic-aware geometric encoder that combines object-level and patch-level semantic information. This encoder significantly improves registration recall by reducing ambiguity in patch-level superpoint matching. Additionally, we incorporate a prior knowledge approach that utilizes an intrinsic shape signature to identify salient points. This enables us to extract the most salient super points and meaningful dense points in the scene. Secondly, we introduce an innovative transformer that encodes High-Order (HO) geometric features. These features are crucial for identifying salient points within initial overlap regions while considering global high-order geometric consistency. We introduce an anchor node selection strategy to optimize this high-order transformer further. By encoding inter-frame triangle or polyhedron consistency features based on these anchor nodes, we can effectively learn high-order geometric features of salient super points. These high-order features are then propagated to dense points and utilized by a Sinkhorn matching module to identify critical correspondences for successful registration. The experiments conducted on the 3DMatch/3DLoMatch and KITTI datasets demonstrate the effectiveness of our method.

关键词： Point cloud compression Computer vision Accuracy Shape Semantics Transformers Feature extraction Encoding intelligent robots

来源：评论

学校读者我要写书评

暂无评论

BPMN++: Comprehensive Business Process Modeling for Industrial Internet Application

BPMN++: Comprehensive Business Process Modeling for Industri...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Hangyu Cheng Guosheng Kang Jianxun Liu Yiping Wen Buqing Cao Zhen Wang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

Business process management is the end-to-end business process modeling, analysis, and optimization to achieve business goals. Business Process Modeling Notation (BPMN) is usually used to represent business process models. However, BPMN cannot support the intuitive modeling for some typical tasks in complex business scenarios of the Industrial Internet context, increasing the communication cost between modelers and business personnel. The current solutions try to extend the attributes of BPMN elements with annotations, but a large number of annotations makes business process models complex and cumbersome. This paper proposes to extend new business process modeling elements for Industrial Internet application scenarios based on BPMN extension mechanism, generating an extended business process modeling language, namely BPMN++. And an extended process modeling tool is implemented, which is available online. A case study over a real-world Industrial Internet process validates the usefulness of this extension mechanism and the well understandability of business process models.

关键词： Industries Process modeling Annotations Internet Personnel Task analysis Optimization

来源：评论

学校读者我要写书评

暂无评论

New Method of Traffic Flow Forecasting Based on QPSO Strategy for Internet of Vehicles 4

New Method of Traffic Flow Forecasting Based on QPSO Strateg...

引用

4th IEEE International Conference on Smart Internet of Things, SmartIoT 2020

作者： Zhang, De-Gan Du, Jing-Yu Zhang, Ting Fan, Hong-Rui Tianjin University of Technology Tianjin Key Lab of Intelligent Computing Novel Software Technology Tianjin300384 China Tianjin University of Technology Ministry of Education Key Laboratory of Computer Vision and System Tianjin China

ISBN: (纸本)9781728165141

We propose a new method of traffic flow forecasting based on quantum particle swarm optimization strategy (QPSO) for Internet of Vehicles (IOV). Establish a corresponding model based on the characteristics of the traffic flow data. The genetic simulated annealing method is applied to the quantum particle swarm method to obtain the optimized initial cluster center, and is applied to the parameter optimization of the radial basis neural network prediction model. The function approximation of radial basis neural network can be used to obtain the required data. In addition, in order to compare the performance of the methods, a comparison study with other related methods such as QPSO-RBF is also performed. Our method can reduce prediction errors and get better and more stable prediction results. © 2020 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

ASRNet: Adversarial Segmentation and Registration Networks for Multispectral Fundus Images

引用

Computer Systems Science & Engineering 2021年第3期36卷 537-549页

作者： Yanyun Jiang Yuanjie Zheng Xiaodan Sui Wanzhen Jiao Yunlong He Weikuan Jia School of Information Science and Engineering Shandong Normal UniversityJinan250358China Key Laboratory of Intelligent Computing&Information Security in Universities of Shandong Shandong Provincial Key Laboratory for Novel Distributed Computer Software TechnologyInstitute of Biomedical SciencesShandong Normal UniversityJinan250358China Shandong Provincial Hospital Affiliated to Shandong University Jinan250021China INSA Lyon University of LyonCNRSInsermVilleurbanne69621CedexFrance

Multispectral imaging (MSI) technique is often used to capture imagesof the fundus by illuminating it with different wavelengths of light. However,these images are taken at different points in time such that eyeball movementscan cause misalignment between consecutive images. The multispectral imagesequence reveals important information in the form of retinal and choroidal bloodvessel maps, which can help ophthalmologists to analyze the morphology of theseblood vessels in detail. This in turn can lead to a high diagnostic accuracy of several diseases. In this paper, we propose a novel semi-supervised end-to-end deeplearning framework called “Adversarial Segmentation and Registration Nets”(ASRNet) for the simultaneous estimation of the blood vessel segmentation andthe registration of multispectral images via an adversarial learning process. ASRNet consists of two subnetworks: (i) A segmentation module S that fulfills theblood vessel segmentation task, and (ii) A registration module R that estimatesthe spatial correspondence of an image pair. Based on the segmention-drivenregistration network, we train the segmentation network using a semi-supervisedadversarial learning strategy. Our experimental results show that the proposedASRNet can achieve state-of-the-art accuracy in segmentation and registrationtasks performed with real MSI datasets.

关键词： Deep learning deformable image registration image segmentation multispectral imaging(MSI)

来源：评论

学校读者我要写书评

暂无评论

Validating SMT Solvers via Skeleton Enumeration Empowered by Historical Bug-Triggering Inputs

Validating SMT Solvers via Skeleton Enumeration Empowered by...

引用

International Conference on software Engineering (ICSE)

作者： Maolin Sun Yibiao Yang Ming Wen Yongcong Wang Yuming Zhou Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security National Engineering Research Center for Big Data Technology and System State Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science and Technology Huazhong University of Science and Technology China

SMT solvers check the satisfiability of logic formulas over first-order theories, which have been utilized in a rich number of critical applications, such as software verification, test case generation, and program synthesis. Bugs hidden in SMT solvers would severely mislead those applications and further cause severe consequences. Therefore, ensuring the reliability and robustness of SMT solvers is of critical importance. Although many approaches have been proposed to test SMT solvers, it is still a challenge to discover bugs effectively. To tackle such a challenge, we conduct an empirical study on the historical bug-triggering formulas in SMT solvers' bug tracking systems. We observe that the historical bug-triggering formulas contain valuable skeletons (i.e., core structures of formulas) as well as associated atomic formulas which can cast significant impacts on formulas' ability in triggering bugs. Therefore, we propose a novel approach that utilizes the skeletons extracted from the historical bug-triggering formulas and enumerates atomic formulas under the guidance of association rules derived from historical formulas. In this study, we realized our approach as a practical fuzzing tool HistFuzz and conducted extensive testing on the well-known SMT solvers Z3 and cvc5. To date, HistFuzz has found 111 confirmed new bugs for Z3 and cvc5, of which 108 have been fixed by the developers. More notably, out of the confirmed bugs, 23 are soundness bugs and invalid model bugs found in the solvers' default mode, which are essential for SMT solvers. In addition, our experiments also demonstrate that HistFuzz outperforms the state-of-the-art SMT solver fuzzers in terms of achieved code coverage and effectiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A New Approach on Task Offloading Scheduling for Application of Mobile Edge computing

A New Approach on Task Offloading Scheduling for Application...

引用

IEEE Conference on Wireless Communications and Networking

作者： Yuya Cui Degan Zhang Ting Zhang Peng Yang Haoli Zhu Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin China

In mobile edge computing(MEC), application partitioning can split the executions into local and edge server parts. Optimal partitioning will allow mobile devices to obtain the highest benefit from Mobile Edge computing (MEC). In this paper, a new approach on task offloading scheduling for application of mobile edge computing is proposed. We divide the computing task into several subtasks. Then, we analyze the overhead of the system, and propose a fine-grained strategy for task scheduling and offloading in a multi-user MEC system. For reducing the energy consumption and delay, the computation offloading is considered as a constrained multi-objective optimization problem (CMOP), which can be solved by an improved NSGA-II algorithm. The experimental results show that the proposed algorithm can find a large number of optimal solutions to adjust the corresponding offloading decision according to the real-world situation.

关键词： Energy consumption Processor scheduling Parallel processing Scheduling Mobile handsets Delays Servers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：