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

arXiv 2024年

作者： Bian, Yuan Liu, Min Wang, Xueping Ma, Yunfeng Wang, Yaonan The College of Electrical and Information Engineering Hunan University National Engineering Research Center of Robot Visual Perception and Control Technology Hunan Changsha China The College of Information Science and Engineering Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Changsha China

Deep learning-based person re-identification (re-id) models are widely employed in surveillance systems and inevitably inherit the vulnerability of deep networks to adversarial attacks. Existing attacks merely consider cross-dataset and cross-model transferability, ignoring the cross-test capability to perturb models trained in different domains. To powerfully examine the robustness of real-world re-id models, the Meta Transferable Generative Attack (MTGA) method is proposed, which adopts meta-learning optimization to promote the generative attacker producing highly transferable adversarial examples by learning comprehensively simulated transfer-based cross-model&dataset&test black-box meta attack tasks. Specifically, cross-model&dataset black-box attack tasks are first mimicked by selecting different re-id models and datasets for meta-train and meta-test attack processes. As different models may focus on different feature regions, the Perturbation Random Erasing module is further devised to prevent the attacker from learning to only corrupt model-specific features. To boost the attacker learning to possess cross-test transferability, the Normalization Mix strategy is introduced to imitate diverse feature embedding spaces by mixing multi-domain statistics of target models. Extensive experiments show the superiority of MTGA, especially in cross-model&dataset and cross-model&dataset&test attacks, our MTGA outperforms the SOTA methods by 21.5% and 11.3% on mean mAP drop rate, respectively. The code of MTGA will be released after the paper is accepted. Copyright © 2024, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning-based Fault-Tolerant control for Unmanned Aerial Vehicles

Reinforcement Learning-based Fault-Tolerant Control for Unma...

引用

Youth Academic Annual Conference of Chinese Association of Automation (YAC)

作者： Guoqi Wang Xudong Wang Yang Li Ziwei Gao Zhaoke Ning National Engineering Research Center of Robot Visual Perception and Control Technology School of Robotics Hunan University Changsha China State Key Laboratory of Advanced Design and Manufacturing Technology for Vehicle College of Mechanical and Vehicle Engineering Hunan University Changsha China School of Aeronautics and Astronautics Sichuan University Chengdu China

ISBN: (数字)9798350379228

ISBN: (纸本)9798350390780

This paper focuses on the fault-tolerant control (FTC) problem for unmanned aerial vehicles (UAVs) subject to possible multiple actuator failures, which is a tough problem to solve with traditional FTC methods since they usually require accurate mathematical models. To address the limitation of traditional FTC methods, a model-free FTC approach is proposed based on reinforcement learning (RL). Subsequently, the proposed approach is applied to construct fault-tolerant controller for UAVs without any knowledge of the quadrotor dynamic information. Then, an end-to-end control policy that can tolerant actuator failures is obtained, which can map the state of the UAVs directly to the control commands of the four rotors after learning. Finally, the effectiveness of the proposed fault-tolerant approach is demonstrated by using the flexible modular quadrotor simulator.

关键词： Fault tolerance Actuators Trajectory tracking Fault tolerant systems Autonomous aerial vehicles Stability analysis Mathematical models

来源：评论

学校读者我要写书评

暂无评论

AdaptiveClick: Clicks-aware Transformer with Adaptive Focal Loss for Interactive Image Segmentation

arXiv

引用

arXiv 2023年

作者： Lin, Jiacheng Chen, Jiajun Yang, Kailun Roitberg, Alina Li, Siyu Li, Zhiyong Li, Shutao The College of Computer Science and Electronic Engineering Hunan University Changsha410082 China The School of Robotics The National Engineering Research Center of Robot Visual Perception and Control Technology Hunan University Changsha410082 China The Institute for Artificial Intelligence The University of Stuttgart Stuttgart70569 Germany The College of Electrical and Information Engineering The Key Laboratory of Visual Perception and Artificial Intelligence of Hunan Province Hunan University Changsha410082 China

Interactive Image Segmentation (IIS) has emerged as a promising technique for decreasing annotation time. Substantial progress has been made in pre- and post-processing for IIS, but the critical issue of interaction ambiguity, notably hindering segmentation quality, has been under-researched. To address this, we introduce ADAPTIVECLICK – a click-aware transformer incorporating an adaptive focal loss that tackles annotation inconsistencies with tools for mask- and pixel-level ambiguity resolution. To the best of our knowledge, AdaptiveClick is the first transformer-based, mask-adaptive segmentation framework for IIS. The key ingredient of our method is the Click-Aware Mask-adaptive transformer Decoder (CAMD), which enhances the interaction between click and image features. Additionally, AdaptiveClick enables pixel-adaptive differentiation of hard and easy samples in the decision space, independent of their varying distributions. This is primarily achieved by optimizing a generalized Adaptive Focal Loss (AFL) with a theoretical guarantee, where two adaptive coefficients control the ratio of gradient values for hard and easy pixels. Our analysis reveals that the commonly used Focal and BCE losses can be considered special cases of the proposed AFL. With a plain ViT backbone, extensive experimental results on nine datasets demonstrate the superiority of AdaptiveClick compared to state-of-the-art methods. The source code is publicly available at https://***/lab206/AdaptiveClick. Copyright © 2023, The Authors. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Model-free design of stochastic lqr controller from reinforcement learning and primal-dual optimization perspective

arXiv

引用

arXiv 2021年

作者： Li, Man Qin, Jiahu Zheng, Wei Xing Wang, Yaonan Kang, Yu Department of Automation University of Science and Technology of China Hefei230027 China School of Computing Engineering and Mathematics Western Sydney University SydneyNSW2751 Australia College of Electrical and Information Engineering Hunan University Changsha410082 China National Engineering Laboratory for Robot Visual Perception and Control Technology Changsha410082 China

To further understand the underlying mechanism of various reinforcement learning (RL) algorithms and also to better use the optimization theory to make further progress in RL, many researchers begin to revisit the linear-quadratic regulator (LQR) problem, whose setting is simple and yet captures the characteristics of RL. Inspired by this, this work is concerned with the model-free design of stochastic LQR controller for linear systems subject to Gaussian noises, from the perspective of both RL and primal-dual optimization. From the RL perspective, we first develop a new model-free off-policy policy iteration (MF-OPPI) algorithm, in which the sampled data is repeatedly used for updating the policy to alleviate the data-hungry problem to some extent. We then provide a rigorous analysis for algorithm convergence by showing that the involved iterations are equivalent to the iterations in the classical policy iteration (PI) algorithm. From the perspective of optimization, we first reformulate the stochastic LQR problem at hand as a constrained non-convex optimization problem, which is shown to have strong duality. Then, to solve this non-convex optimization problem, we propose a model-based primal-dual (MBPD) algorithm based on the properties of the resulting Karush-Kuhn-Tucker (KKT) conditions. We also give a model-free implementation for the MB-PD algorithm by solving a transformed dual feasibility condition. More importantly, we show that the dual and primal update steps in the MB-PD algorithm can be interpreted as the policy evaluation and policy improvement steps in the PI algorithm, respectively. Finally, we provide one simulation example to show the performance of the proposed algorithms. Copyright © 2021, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Domain Adaptation in visual Reinforcement Learning via Self-Expert Imitation with Purifying Latent Feature

Domain Adaptation in Visual Reinforcement Learning via Self-...

引用

IEEE/RSJ International Conference on Intelligent robots and Systems (IROS)

作者： Lin Chen Jianan Huang Zhen Zhou Yaonan Wang Yang Mo Zhiqiang Miao Kai Zeng Mingtao Feng Danwei Wang School of Electrical and Information Engineering Hunan University Changsha China National Engineering Research Center for Robot Visual Perception and Control Technology Changsha China School of Computer Science and Technology Xidian University Xian China School of Electrical and Electrical Engineering Nanyang Technological University Singapore

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

Generalizing visual reinforcement learning is fundamental to robot visual navigation, involving the acquisition of a policy from interactions with source environments to facilitate adaptation to analogous, yet unfamiliar target environments. Recent advancements capitalize on data augmentation techniques, self-supervised learning methods, and the generative adversarial network framework to train policy neural networks with enhanced generalizability. However, current methods, upon extracting domain-general latent features, further utilize these features to train the reinforcement learning policy, resulting in a decline in the performance of the learned policy guiding the agent to accomplish tasks. To tackle these challenges, a framework of self-expert imitation with purifying latent features was devised, empowering the policy to achieve robust and stable zero-shot generalization performance in visually similar domains previously unseen, without diminishing the performance of guiding the agent to accomplish tasks. The extraction method of domain-general latent features is proposed to enhance their quality based on the variational autoencoder. Extensive experiments have shown that our policy, compared with state-of-the-art counterparts, does not diminish the performance of the policy guiding the agent to accomplish tasks after generalization.

关键词： Training visualization Navigation Semantic segmentation Autoencoders Neural networks Reinforcement learning Self-supervised learning Feature extraction Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Real time backbone for semantic segmentation

arXiv

引用

arXiv 2019年

作者： Yang, Zhengeng Yu, Hongshan Fu, Qiang Sun, Wei Jia, Wenyan Sun, Mingui Mao, Zhi-Hong National Engineering Laboratory for Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan University Lushan South Rd. Yuelu Dist. Changsha410082 China University of Pittsburgh University of Pittsburgh PittsburghPA United States Department of Electrical and Computer Engineering Department of Neurosurgery

The rapid development of autonomous driving in recent years presents lots of challenges for scene understanding. As an essential step towards scene understanding, semantic segmentation thus received lots of attention in past few years. Although deep learning based state-of-the-arts have achieved great success in improving the segmentation accuracy, most of them suffer from an inefficiency problem and can hardly applied to practical applications. In this paper, we systematically analyze the computation cost of Convolutional Neural Network(CNN) and found that the inefficiency of CNN is mainly caused by its wide structure rather than the deep structure. In addition, the success of pruning based model compression methods proved that there are many redundant channels in CNN. Thus, we designed a very narrow while deep backbone network to improve the efficiency of semantic segmentation. By casting our network to FCN32 segmentation architecture, the basic structure of most segmentation methods, we achieved 60.6% mIoU on Cityscape val dataset with 54 frame per seconds(FPS) on 1024 × 2048 inputs, which already outperforms one of the earliest real time deep learning based segmentation methods: ENet. Copyright © 2019, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Memory-augment convolutional Autoencoder for unsupervised pavement crack classification

Memory-augment convolutional Autoencoder for unsupervised pa...

引用

Chinese Automation Congress (CAC)

作者： Tianyue Wu Hui Zhang Jiaxuan Liu Yurong Chen Junfei Yi Zouquan Zhang School of Electrical and Information Engineering Changsha University of Science and Technology Changsha China School of Robotics also with Visual Perception and Control Technology National Engineering Laboratory Hunan University Changsha China School of Electrical and Information Engineering Hunan University Changsha China

ISBN: (纸本)9781665426480

In urban construction, transportation system is an important part. However, the pavement cracks will occur because of using in long time and some external force collision, which has impacts on the safety and reliability of the whole transportation system. Therefore, it is necessary to detect the pavement cracks. The formation of pavement cracks is slow, and it is not concentrated on one place, so it is difficult to obtain enough images containing cracks to train. We propose a new pre-training method based on self-supervision study, which can obtain features closer to the target task from normal pavement images. In addition, we combine a memory-augment convolutional autoencoder and a hard-threshold module to improve the accuracy of the crack classification. Experiments conducted on the Mendeley Concrete crack dataset and Deep-Crack dataset demonstrate the good performance in pavement crack classification task.

关键词： Image segmentation Force Transportation Memory modules Safety Reliability Labeling

来源：评论

学校读者我要写书评

暂无评论

A Muti-stage Selection Filter Based on Wavelet Packet and 2DCNN for Fault Diagnosis of Rotating Machinery

A Muti-stage Selection Filter Based on Wavelet Packet and 2D...

引用

Chinese control Conference (CCC)

作者： Wenbin He Jianxu Mao Li Liu Zhe Li Miao Yang Yaonan Wang College of Electrical and Information Engineering Hunan University Changsha China National Engineering Research Center of Robot Visual Perception and Control Technology Hunan University Changsha China State Grid Hunan Electric Power Company Limited Research Institute Changsha China

Fault information of rotating machinery is often drowned in strong noise signals, so it is crucial to accurately identify faults from high-intensity noise signals. In this article, an end-to-end fault diagnosis model is developed, which consists of a multi-stage selection filter based on wavelet packet and 2D-CNN. First, the original measured mechanical signals were processed by the three-level wavelet packet decomposition to obtain eight sub-bands with coefficient matrices. Second, the signal is reconstructed using different numbers of sub-bands, where the number is increased by one at a time to obtain eight different multi-stage reconstructed signals. Third, the reconstructed signals are reorganized into 2D signal maps; and a parallel training network is constructed using signal maps and 2D-CNN to achieve fault classification. Then, guided by the training results, eight parallel classification results are compared, so as to train the best fault diagnosis model. Finally, the simulation experiment based on a bearing data set illustrates the proposed multi-stage selection filter is effective and feasible in application.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TransKD: Transformer Knowledge Distillation for Efficient Semantic Segmentation

arXiv

引用

arXiv 2022年

作者： Liu, Ruiping Yang, Kailun Roitberg, Alina Zhang, Jiaming Peng, Kunyu Liu, Huayao Wang, Yaonan Stiefelhagen, Rainer The Institute for Anthropomatics and Robotics Karlsruhe Institute of Technology Karlsruhe76131 Germany The School of Robotics The National Engineering Laboratory of Robot Visual Perception and Control Technology Hunan University Changsha410082 China The Institute for Artificial Intelligence The University of Stuttgart Stuttgart70569 Germany The Institute for Visual Computing ETH Zurich Zurich8092 Switzerland NIO Shanghai201804 China

Semantic segmentation benchmarks in the realm of autonomous driving are dominated by large pre-trained transformers, yet their widespread adoption is impeded by substantial computational costs and prolonged training durations. To lift this constraint, we look at efficient semantic segmentation from a perspective of comprehensive knowledge distillation and aim to bridge the gap between multi-source knowledge extractions and transformer-specific patch embeddings. We put forward the Transformer-based Knowledge Distillation (TransKD) framework which learns compact student transformers by distilling both feature maps and patch embeddings of large teacher transformers, bypassing the long pre-training process and reducing the FLOPs by >85.0%. Specifically, we propose two fundamental modules to realize feature map distillation and patch embedding distillation, respectively: (1) Cross Selective Fusion (CSF) enables knowledge transfer between cross-stage features via channel attention and feature map distillation within hierarchical transformers;(2) Patch Embedding Alignment (PEA) performs dimensional transformation within the patchifying process to facilitate the patch embedding distillation. Furthermore, we introduce two optimization modules to enhance the patch embedding distillation from different perspectives: (1) Global-Local Context Mixer (GL-Mixer) extracts both global and local information of a representative embedding;(2) Embedding Assistant (EA) acts as an embedding method to seamlessly bridge teacher and student models with the teacher’s number of channels. Experiments on Cityscapes, ACDC, NYUv2, and Pascal VOC2012 datasets show that TransKD outperforms state-of-the-art distillation frameworks and rivals the time-consuming pre-training method. The source code is publicly available at https://***/RuipingL/TransKD. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Domain-invariant Prototypes for Semantic Segmentation

arXiv

引用

arXiv 2022年

作者： Yang, Zhengeng Yu, Hongshan Sun, Wei Li-Cheng Mian, Ajmal The National Engineering Laboratory for Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan University Lushan South Rd. Yuelu410082 China The Department of Electrical and Computer Engineering University of Alberta EdmontonAB Canada The Department of Computer Science The University of Western Australia PerthWA6009 Australia

Deep Learning has greatly advanced the performance of semantic segmentation, however, its success relies on the availability of large amounts of annotated data for training. Hence, many efforts have been devoted to domain adaptive semantic segmentation that focuses on transferring semantic knowledge from a labeled source domain to an unlabeled target domain. Existing self-training methods typically require multiple rounds of training, while another popular framework based on adversarial training is known to be sensitive to hyper-parameters. In this paper, we present an easy-to-train framework that learns domain-invariant prototypes for domain adaptive semantic segmentation. In particular, we show that domain adaptation shares a common character with few-shot learning in that both aim to recognize some types of unseen data with knowledge learned from large amounts of seen data. Thus, we propose a unified framework for domain adaptation and few-shot learning. The core idea is to use the class prototypes extracted from few-shot annotated target images to classify pixels of both source images and target images. Our method involves only one-stage training and does not need to be trained on large-scale un-annotated target images. Moreover, our method can be extended to variants of both domain adaptation and few-shot learning. Experiments on adapting GTA5-to-Cityscapes and SYNTHIA-to-Cityscapes show that our method achieves competitive performance to state-of-the-art. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：