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

IEEE Conference on Decision and control

作者： Juan Qian Xiaoling Wang Daniele Astolfi Housheng Su Guo-Ping Jiang College of Automation and the College of Artificial Intelligence Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Engineering Center for IOT Intelligent Robots(IOTRobot) Nanjing China CNRS LAGEPP UMR 5007 43 boulevard du 11 novembre 1918 Université Claude Bernard Lyon 1 Villeurbanne France Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai China School of Artificial Intelligence and Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Luoyu Road 1037 Wuhan China

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper addresses the global consensus problem for multi-input multi-output saturated systems within a sampled-data framework, aiming to advance global consensus, manage heterogeneous actuator saturation across components, and preserve distributed characteristics by using sampled-data feedback. We propose a distributed control algorithm that incorporates a redesigned saturation function, represented as decentralized dynamic saturation levels. These levels for each agent’s dimensions are autonomously updated through an adaptive strategy, which mitigates heterogeneous saturation by carefully selecting constant and time-varying saturation parameters in it. Lyapunov analysis proves that global consensus can be achieved under the proposed control law, provided the sampling periods of all agents remain below a calculated threshold. An example is given to demonstrate the effectiveness of this approach.

关键词： Actuators Upper bound Heuristic algorithms Decentralized control Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Wasserstein distance based deep adversarial transfer learning for intelligent fault diagnosis with unlabeled or insufficient labeled data

引用

NEUROCOMPUTING 2020年 409卷 35-45页

作者： Cheng, Cheng Zhou, Beitong Ma, Guijun Wu, Dongrui Yuan, Ye Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat MOE Key Lab Intelligent Control & Image Proc Wuhan 430074 Peoples R China State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Mech Sci & Engn Wuhan 430074 Peoples R China

intelligent fault diagnosis is one critical topic of maintenance solution for mechanical systems. Deep learning models, such as convolutional neural networks (CNNs), have been successfully applied to fault diagnosis tasks and achieved promising results. However, one is that two datasets (in source and target domains) of similar tasks are with different feature distributions because of different operational conditions;another one is that insufficient or unlabeled data in real industry applications (target domains) limit the adaptability of the source domain well-defined models. To solve the above problems, the concept of transfer learning should be adopted for domain adaptation, in the meantime, a network performs both supervised and unsupervised learning is required. Inspired by Wasserstein distance of optimal transport, in this paper, we propose a novel Wasserstein Distance-based Deep Transfer Learning (WD-DTL) network for both supervised and unsupervised fault diagnosis tasks. WD-DTL learns domain feature representations (generated by a CNN based feature extractor) and minimizes distributions between the source and target domains through an adversarial training process. The effectiveness of the proposed WD-DTL is verified through 16 different transfer tasks. Results show that WD-DTL achieves the highest diagnostic accuracies when compared to the existing Maximum Mean Discrepancy and CNN networks in almost all transfer tasks. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Transfer learning Domain adaptation Wasserstein distance Convolutional neural networks intelligent fault diagnosis

来源：评论

学校读者我要写书评

暂无评论

Hilbert words as arrays generated with P systems

引用

JOURNAL OF MEMBRANE COMPUTING 2021年第3期3卷 163-169页

作者： Ceterchi, Rodica Zhang, Luping Subramanian, K. G. Zhang, Gexiang Univ Bucharest Fac Math & Comp Sci Acad St 14 Bucharest 010014 Romania Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Minist China Key Lab Image Informat Proc & Intelligent Control Wuhan 430074 Peoples R China Liverpool Hope Univ Fac Sci Hope Pk Liverpool L16 9JD Merseyside England Chengdu Univ Informat Technol Sch Control Engn Chengdu 610225 Peoples R China

Construction of finite grammars to generate languages of digitized picture patterns, considered as arrays of symbols, has been a problem of interest in two-dimensional formal languages. On the other hand, in the area of membrane computing, P systems were developed for handling the problem of picture array generation, with the rewriting involved being sequential or parallel. We introduce in this paper the array representation for the Hilbert words, the finite approximations of the Hilbert space-filling curve, and we generate them with array-rewriting rules in P systems. The array rewriting is done in parallel, with the P system serving as a control mechanism. A main contribution is the proof of correctness which is done using a linearization procedure. In addition, the advantage of the P system used is that the number of membranes involved is small (only one or two).

关键词： Membrane computing Parallel rewriting Array grammars Chain code words Hilbert's space-filling curve

来源：评论

学校读者我要写书评

暂无评论

An advanced actor-critic algorithm for training video game ai 1st

An advanced actor-critic algorithm for training video game a...

引用

1st International Conference on Neural Computing for Advanced Applications, NCAA 2020

作者： Zha, Zhong Yi Tang, Xue Song Wang, Bo Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Artificial Intelligence and Automation School Huazhong University of Science and Technology Wuhan430074 China College of Information and Science Donghua University Shanghai China

ISBN: (纸本)9789811576690

This paper presents an improved deep reinforcement learning (DRL) algorithm, namely Advanced Actor Critic (AAC), which is based on Actor Critic (AC) algorithm, to the video game Artificial intelligence (AI) training. The advantage distribution estimator, Normal Constraint (NC) function and exploration based on confidence are introduced to improve the AC algorithm, in order to achieve accurate value estimate, select continuous spatial action correctly, and explorate effectively. The aim is to improve the performance of conventional AC algorithm in a complex environment. A case study of video game StarCraft II mini-game AI training is employed. The results verify that the improved algorithm effectively improves the performance in terms of the convergence rate, maximum reward, average reward in every 100 episode, and time to reach a specific reward, etc. The analysis on how these modifications improve the performance is also given through interpretation of the feature layers in the mini-games. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A simple no-equilibrium chaotic system with only one signum function for generating multidirectional variable hidden attractors and its hardware implementation

引用

CHAOS 2020年第5期30卷 053129页

作者： Zhang, Sen Wang, Xiaoping Zeng, Zhigang Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Educ Minist China Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

This paper proposes a simple no-equilibrium chaotic system with only one signum function as compared with the existing no-equilibrium chaotic ones with at least one quadratic or higher nonlinearity. The system has the offset boosting of three variables through adjusting the corresponding controlled constants. The resulting hidden attractors can be distributed in a 1D line, a 2D lattice, a 3D grid, and even in an arbitrary location of the phase space. Particularly, a hidden chaotic bursting oscillation is also observed in this system, which is an uncommon phenomenon. In addition, complex hidden dynamics is investigated via phase portraits, time series, Kaplan-Yorke dimensions, bifurcation diagrams, Lyapunov exponents, and two-parameter bifurcation diagrams. Then, a very simple hardware circuit without any multiplier is fabricated, and the experimental results are presented to demonstrate theoretical analyses and numerical simulations. Furthermore, the randomness test of the chaotic pseudo-random sequence generated by the system is tested by the National Institute of Standards and Technology test suite. The tested results show that the proposed system has good randomness, thus being suitable for chaos-based applications such as secure communication and image encryption.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MADNet: A Fast and Lightweight Network for Single-image Super Resolution

引用

IEEE TRANSACTIONS ON CYBERNETICS 2021年第3期51卷 1443-1453页

作者： Lan, Rushi Sun, Long Liu, Zhenbing Lu, Huimin Pang, Cheng Luo, Xiaonan Guilin Univ Elect Technol Guangxi Key Lab Image & Graph Intelligent Proc Guilin 541004 Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Kyushu Inst Technol Dept Mech & Control Engn Kitakyushu Fukuoka 8048550 Japan Guilin Univ Elect Technol Natl Local Joint Engn Res Ctr Satellite Nav & Loc Guilin 541004 Peoples R China

Recently, deep convolutional neural networks (CNNs) have been successfully applied to the single-image super-resolution (SISR) task with great improvement in terms of both peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). However, most of the existing CNN-based SR models require high computing power, which considerably limits their real-world applications. In addition, most CNN-based methods rarely explore the intermediate features that are helpful for final image recovery. To address these issues, in this article, we propose a dense lightweight network, called MADNet, for stronger multiscale feature expression and feature correlation learning. Specifically, a residual multiscale module with an attention mechanism (RMAM) is developed to enhance the informative multiscale feature representation ability. Furthermore, we present a dual residual-path block (DRPB) that utilizes the hierarchical features from original low-resolution images. To take advantage of the multilevel features, dense connections are employed among blocks. The comparative results demonstrate the superior performance of our MADNet model while employing considerably fewer multiadds and parameters.

关键词： Feature extraction Computational modeling image reconstruction image resolution Task analysis Computer architecture Cybernetics Channel attention dense connections image super resolution lightweight multiscale mechanism

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis of Nonconvex Distributed Stochastic Zeroth-order Coordinate Method 60

Convergence Analysis of Nonconvex Distributed Stochastic Zer...

引用

60th IEEE Conference on Decision and control (CDC)

作者： Zhang, Shengjun Dong, Yunlong Xie, Dong Yao, Lisha Bailey, Colleen P. Fu, Shengli Univ North Texas Dept Elect Engn OSCAR Lab Denton TX 76207 USA Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat MOE Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China Univ North Texas Dept Elect Engn Denton TX 76207 USA

ISBN: (纸本)9781665436595

This paper investigates the stochastic distributed nonconvex optimization problem of minimizing a global cost function formed by the summation of n local cost functions. We solve such a problem by involving zeroth-order (ZO) information exchange. In this paper, we propose a ZO distributed primal-dual coordinate method (ZODIAC) to solve the stochastic optimization problem. Agents approximate their own local stochastic ZO oracle along with coordinates under an adaptive smoothing parameter. We show that the proposed algorithm achieves the convergence rate of O(root p/root T) for general nonconvex cost functions. We demonstrate the efficiency of proposed algorithms through a numerical example in comparison with the existing state-of-the-art centralized and distributed ZO algorithms.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Recent Few-Shot Object Detection Algorithms: A Survey with Performance Comparison

arXiv

引用

arXiv 2022年

作者： Liu, Tianying Zhang, Lu Wang, Yang Guan, Jihong Fu, Yanwei Zhao, Jiajia Zhou, Shuigeng Department of Computer Science and Technology Tongji University Shanghai201804 China The Project Management Office of China National Scientific Seafloor Observatory Tongji University Shanghai200092 China Shanghai Key Lab of Intelligent Information Processing The School of Computer Science Fudan University Shanghai200438 China Shanghai Key Lab of Intelligent Information Processing The School of Data Science Fudan University Shanghai200433 China Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory Beijing100074 China

The generic object detection (GOD) task has been successfully tackled by recent deep neural networks, trained by an avalanche of annotated training samples from some common classes. However, it is still non-trivial to generalize these object detectors to the novel long-tailed object classes, which have only few labeled training samples. To this end, the Few-Shot Object Detection (FSOD) has been topical recently, as it mimics the humans' ability of learning to learn, and intelligently transfers the learned generic object knowledge from the common heavy-tailed, to the novel long-tailed object classes. Especially, the research in this emerging field has been flourishing in recent years with various benchmarks, backbones, and methodologies proposed. To review these FSOD works, there are several insightful FSOD survey articles [58, 59, 74, 78] that systematically study and compare them as the groups of fine-tuning/transfer learning, and meta-learning methods. In contrast, we review the existing FSOD algorithms from a new perspective under a new taxonomy based on their contributions, i.e., data-oriented, model-oriented, and algorithm-oriented. Thus, a comprehensive survey with performance comparison is conducted on recent achievements of FSOD. Furthermore, we also analyze the technical challenges, the merits and demerits of these methods, and envision the future directions of FSOD. Specifically, we give an overview of FSOD, including the problem definition, common datasets, and evaluation protocols. The taxonomy is then proposed that groups FSOD methods into three types. Following this taxonomy, we provide a systematic review of the advances in FSOD. Finally, further discussions on performance, challenges, and future directions are presented. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Parameter Identification of Memristor-Based Chaotic Systems via the Drive-Response Synchronization Method

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2021年第6期68卷 2082-2086页

作者： Liu, Hui Chi, Jun Li, Zengyang Zeng, Zhigang Lu, Jinhu Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Educ Minist China Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China Cent China Normal Univ Sch Comp Sci Wuhan 430079 Peoples R China Beihang Univ Sch Automat Sci & Elect Engn Beijing 100191 Peoples R China Beihang Univ State Key Lab Software Dev Environm Beijing 100191 Peoples R China

Memristor-based chaotic systems have been received great attention from researchers in the last decade. This brief investigates parameter identification of a memristor-based chaotic system (proposed by Muthuswamy in 2010). Uncertain parameter identification has not been studied yet for memristor-based chaotic systems. Using the Lyapunov stability theory and Barbalat lemma, two theorems are established to identify uncertain parameters of the system under the following two cases: i) the memductance is unknown;ii) capacitances and inductances are unknown. Finally, numerical simulations are carried out and the results show that the proposed parameter identification methods are effective.

关键词： Synchronization Memristors Inductors Circuits and systems Numerical simulation Mathematical model Lyapunov methods Memristor chaotic system synchronization parameter identification

来源：评论

学校读者我要写书评

暂无评论

Maize tassels detection: a benchmark of the state of the art

引用

PLANT METHODS 2020年第1期16卷 1-15页

作者： Zou, Hongwei Lu, Hao Li, Yanan Liu, Liang Cao, Zhiguo Huazhong Univ Sci & Technol Key Lab Image Proc & Intelligent Control Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Wuhan Inst Technol Sch Engn & Comp Sci Wuhan 430205 Peoples R China

Background: The population of plants is a crucial indicator in plant phenotyping and agricultural production, such as growth status monitoring, yield estimation, and grain depot management. To enhance the production efficiency and liberate labor force, many automated counting methods have been proposed, in which computer vision-based approaches show great potentials due to the feasibility of high-throughput processing and low cost. In particular, with the success of deep learning, more and more deeper learning-based approaches are introduced to deal with agriculture automation. Since different detection- and regression-based counting models have distinct characteristics, how to choose an appropriate model given the target task at hand remains unexplored and is important for practitioners. Results: Targeting in-field maize tassels as a representative case study, the goal of this work is to present a comprehensive benchmark of state-of-the-art object detection and object counting methods, including Faster R-CNN, YOLOv3, FaceBoxes, RetinaNet, and the leading counting model of maize tassels-TasselNet. We create a Maize Tassel Detection Counting (MTDC) dataset by supplementing bounding box annotations to the Maize Tassels Counting (MTC) dataset to allow the training of detection models. We investigate key factors effecting the practical applications of the models, such as convergence behavior, scale robustness, speed-accuracy trade-off, as well as parameter sensitivity. Based on our benchmark, we summarise the advantages and limitations of each method and suggest several possible directions to improve current detection- and regression-based counting approaches to benefit next-generation intelligent agriculture. Conclusions: Current state-of-the-art detection- and regression-based counting approaches can all achieve a relatively high degree of accuracy when dealing with in-field maize tassels, with at least 0.85 R-2 values and 28.2% rRMSE error. While detection-based meth

关键词： Maize tassels Object detection Object counting Computer Vision Deep learning Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：