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

Robust fault tolerant control on distributed networked control systems with quantized states

学校读者我要写书评

暂无评论

Robust fault tolerant control on distributed networked contr...

World Congress on Intelligent Control and Automation (WCICA)

作者： Yang Ge Jingcheng Wang Yi Zhang Kang Li Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Shanghai China Shanghai Urban-Rural Construction and Transportation Development Research Institute Shanghai China Electrical Engineering and Computer Science Queen's University Belfast Belfast UK

The distributed networked control systems are considered in this paper. Several sub-systems which are connected with each other through a communication network make up the whole system. Each sub-system has its own quantizer so that any information which needs be transmitted to other sub-systems will be quantized due to limited bandwidth. Meanwhile, the actuator faults, including outage, loss of effectiveness and stuck are also considered in our research. A mode-based state feedback controller is given in this paper to stable such NCSs and to meet the robust H-inf performance. A simulation example is proposed to illustrate the effectiveness of our method finally.

关键词： Quantization (signal) Networked control systems State feedback Closed loop systems Communication networks Actuators Fault tolerance

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

学校读者我要写书评

暂无评论

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

Randomized consensus based distributed kalman filtering over wireless sensor networks

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Qin, Jiahu Wang, Jie Shi, Ling Kang, Yu Department of Automation University of Science and Technology of China Hefei230027 China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong Department of Automation State Key Laboratory of Fire Science Institute of Advanced Technology University of Science and Technology of China Hefei230027 China Key Laboratory of Technology in Geo-Spatial Information Processing and Application System Chinese Academy of Sciences Beijing100190 China

This paper is concerned with developing a novel distributed Kalman filtering algorithm over wireless sensor networks based on randomized consensus strategy. Compared with centralized algorithm, distributed filtering techniques require less computation per sensor and lead to more robust estimation since they simply use the information from the neighboring nodes in the network. However, poor local sensor estimation caused by limited observability and network topology changes which interfere the global consensus are challenging issues. Motivated by this observation, we propose a novel randomized gossip based distributed Kalman filtering algorithm. Information exchange and computation in the proposed algorithm can be carried out in an arbitrarily connected network of nodes. In addition, the computational burden can be distributed for a sensor which communicates with a stochastically selected neighbor at each clock step under schemes of gossip algorithm. In this case, the error covariance matrix changes stochastically at every clock step, thus the convergence is considered in a probabilistic sense. We provide the mean square convergence analysis of the proposed algorithm. Under a sufficient condition, we show that the proposed algorithm is quite appealing as it achieves better mean square error performance theoretically than the noncooperative decentralized Kalman filtering algorithm. Besides, considering the limited computation, communication and energy resources in the wireless sensor networks, we propose an optimization problem which minimizes the average expected state estimation error based on the proposed algorithm. To solve the proposed problem efficiently, we transform it into a convex optimization problem. And a sub-optimal solution is attained. Examples and simulations are provided to illustrate the theoretical results. Copyright © 2018, The Authors. All rights reserved.

关键词： Kalman filters

Temporal Logics and Model Checking Algorithms for ZIAs

学校读者我要写书评

暂无评论

Temporal Logics and Model Checking Algorithms for ZIAs

The 2nd International Conference on Software Engineering and Data Mining(IEEE 第二届国际软件工程和数据挖掘学术大会 SEDM 2010)

作者： Zining Ca0 National Key Laboratory of Science and Technology on Avionics System Integration Shanghai 200233. P. R. China Department of Computer Science and Technology Nanjing University of Aero. & Astro.Nanjing 210016 P. R. China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006. P. R. China

ISBN: (纸本)9781424473243;9788988678220;9788988678213

In this paper, we first propose a specification ap-proach combining interface automata and Z language. This approach can be used to describe temporal properties and data properties of software components. A branching time logic for ZIAs is presented. We then give an algorithm for model checking this logic on ZIAs with finite domain. Furthermore, we present a mu-calculus logic for ZIAs, and give a model checking algorithm for this logic.

关键词： model checking interface automata Z notation temporal logic

SliceProp: A Slice-Wise Bidirectional Propagation Model for Interactive 3D Medical Image Segmentation

学校读者我要写书评

暂无评论

SliceProp: A Slice-Wise Bidirectional Propagation Model for ...

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xin Xu Wenjing Lu Jiahao Lei Peng Qiu Hong-Bin Shen Yang Yang Department of Computer Science and Engineering Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University Shanghai China Department of Vascular Surgery Shanghai Ninth People's Hospital Shanghai Jiao Tong University School of Medicine Institute of Image Processing and Pattern Recognition and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Jiao Tong University Shanghai China

Interactive medical image segmentation methods have become increasingly popular in recent years. These methods combine manual labeling and automatic segmentation, reducing the workload of annotation while maintaining high accuracy. However, most current interactive segmentation frameworks are limited to 2D image data, and are not suitable for 3D image data due to the large size and high complexity of 3D data, as well as the challenges posed by information asymmetry and sparse annotation. In this paper, we propose SliceProp, an interactive segmentation framework that implements slice-wise Label Bidirectional Propagation (LBP) for 3D medical image segmentation. SliceProp extends the interactive 2D image segmentation algorithm to 3D image segmentation, and can handle 3D data with large size and high complexity. Moreover, equipped with a Backtracking Feedback Check (BFC) module, SliceProp effectively addresses the issues of information asymmetry and spatial sparse annotation in 3D medical image segmentation. Additionally, we adopt an uncertainty-based criterion to pri-oritize the slices to be refined interactively, which enhances the efficiency of the interaction process by enabling the model to focus on the regions with the most unreliable predictions. SliceProp is evaluated on two datasets and achieves promising results compared to state-of-the-art methods.

关键词：

RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation

学校读者我要写书评

暂无评论

RLSAC: Reinforcement Learning enhanced Sample Consensus for ...

International Conference on computer Vision (ICCV)

作者： Chang Nie Guangming Wang Zhe Liu Luca Cavalli Marc Pollefeys Hesheng Wang Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai Jiao Tong University Department of Computer Science ETH Zürich MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Microsoft Mixed Reality and AI Zürich Lab

Robust estimation is a crucial and still challenging task, which involves estimating model parameters in noisy environments. Although conventional sampling consensus-based algorithms sample several times to achieve robustness, these algorithms cannot use data features and historical information effectively. In this paper, we propose RLSAC, a novel Reinforcement Learning enhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC employs a graph neural network to utilize both data and memory features to guide exploring directions for sampling the next minimum set. The feedback of downstream tasks serves as the reward for unsupervised training. Therefore, RL-SAC can avoid differentiating to learn the features and the feedback of downstream tasks for end-to-end robust estimation. In addition, RLSAC integrates a state transition module that encodes both data and memory features. Our experimental results demonstrate that RLSAC can learn from features to gradually explore a better hypothesis. Through analysis, it is apparent that RLSAC can be easily transferred to other sampling consensus-based robust estimation tasks. To the best of our knowledge, RLSAC is also the first method that uses reinforcement learning to sample consensus for end-to-end robust estimation. We release our codes at https://***/IRMVLab/RLSAC.

关键词：

Identify Influential Nodes in Complex Networks: A K-Orders Entropy-Based Method

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Wu, Yali Dong, Ang Ren, Yuanguang Jiang, Qiaoyong Department of Information and Control Engineering Xi’an University of Technology Xi’an710048 China Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi’an University of Technology Xi’an710048 China The School of Computer Science and Engineering Xi’an University of Technology Xi’an710048 China

Identifying influential nodes is a recognized challenge for the tremendous number of nodes in complex networks. Most of proposed methods detect the influential nodes based on their degree or topological location, which only consider the local or global information of the network causing inaccuracy. In this paper, we propose a k-orders entropy-based method to identify influential nodes. The influence of node is determined by its entropy with local and global information. The entropy reflecting local information is measured by the different order neighbors' information of nodes while the entropy reflecting global information by the betweenness centrality. The experiments conducted on real-world networks demonstrate the proposed method is more accurate than other methods. © 2023, The Authors. All rights reserved.

关键词： Complex networks

A registration-aided domain adaptation network for 3D Point cloud based place recognition

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Qiao, Zhijian Hu, Hanjiang Shi, Weiang Chen, Siyuan Liu, Zhe Wang, Hesheng Department of Automation Insititue of Medical Robotics Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Jiao Tong University Shanghai200240 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology China Department of Mechanical Engineering Carnegie Mellon University United States Department of Computer Science and Technology University of Cambridge United Kingdom

In the field of large-scale SLAM for autonomous driving and mobile robotics, 3D point cloud based place recognition has aroused significant research interest due to its robustness to changing environments with drastic daytime and weather variance. However, it is time-consuming and effort-costly to obtain high-quality point cloud data for place recognition model training and ground truth for registration in the real world. To this end, a novel registration-aided 3D domain adaptation network for point cloud based place recognition is proposed. A structure-aware registration network is introduced to help to learn features with geometric information and a 6-DoFs pose between two point clouds with partial overlap can be estimated. The model is trained through a synthetic virtual LiDAR dataset through GTA-V with diverse weather and daytime conditions and domain adaptation is implemented to the real-world domain by aligning the global features. Our results outperform state-of-the-art 3D place recognition baselines or achieve comparable on the real-world Oxford RobotCar dataset with the visualization of registration on the virtual dataset. Copyright © 2020, The Authors. All rights reserved.

关键词： Three dimensional computer graphics

Efficient 3D Deep LiDAR Odometry

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Guangming Wu, Xinrui Jiang, Shuyang Liu, Zhe Wang, Hesheng Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China The Key Laboratory of Artificial Intelligence of Ministry of Education Shanghai Jiao Tong University Shanghai200240 China

An efficient 3D point cloud learning architecture, named EfficientLO-Net, for LiDAR odometry is first proposed in this paper. In this architecture, the projection-aware representation of the 3D point cloud is proposed to organize the raw 3D point cloud into an ordered data form to achieve efficiency. The Pyramid, Warping, and Cost volume (PWC) structure for the LiDAR odometry task is built to estimate and refine the pose in a coarse-to-fine approach. A projection-aware attentive cost volume is built to directly associate two discrete point clouds and obtain embedding motion patterns. Then, a trainable embedding mask is proposed to weigh the local motion patterns to regress the overall pose and filter outlier points. The trainable pose warp-refinement module is iteratively used with embedding mask optimized hierarchically to make the pose estimation more robust for outliers. The entire architecture is holistically optimized end-to-end to achieve adaptive learning of cost volume and mask, and all operations involving point cloud sampling and grouping are accelerated by projection-aware 3D feature learning methods. The superior performance and effectiveness of our LiDAR odometry architecture are demonstrated on KITTI, M2DGR, and Argoverse datasets. Our method outperforms all recent learning-based methods and even the geometry-based approach, LOAM with mapping optimization, on most sequences of KITTI odometry dataset. We open sourced our codes at: https://***/IRMVLab/EfficientLO-Net. Copyright © 2021, The Authors. All rights reserved.

关键词： Iterative methods