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

IEEE International Conference on Real-time Computing and Robotics (RCAR)

作者： Hanyang Zhuang Xingyuan Chen Jianglin Lan Ying Wang Zhaoxuan Lu Chunxiang Wang Ming Yang University of Michigan - Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai China James Watt School of Engineering University of Glasgow Glasgow United Kingdom School of Mechanical Engineering Shanghai Jiao Tong University Shanghai China Shanghai Intelligent and Connected Vehicle R&D Center Co. LTD Shanghai China Department of Automation Shanghai Jiao Tong University Shanghai Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China

ISBN: (数字)9798350372601

ISBN: (纸本)9798350372618

Multi-camera vehicle tracking (MCVT) system is a key technology to build an intelligent city and intelligent transportation system. The MCVT system utilizes roadside monitoring devices and computing platforms to achieve city-level road traffic perception at a finer scale by tracking each vehicle on the road to obtain the trajectory. The existing MCVT system mainly focuses on dealing with the algorithm modules separately, without studying the real-time performance and system architecture of the entire pipeline. However, in real-world applications, many of the tricks in improving evaluation metrics are not applicable since there is endless traffic flow running all the time. Therefore, this paper proposes a real-time framework of the MCVT system to streamline all the algorithm modules with proper data flow. Firstly, a multi-threaded multi-vehicle tracking (MVT) module is developed to detect vehicles in each camera. Re-identification is implemented during MVT to provide the feature for tracking in the same camera and across different cameras. Then, after the vehicle leaves the camera field of view, the feature of vehicle trajectory is calculated by averaging the feature at each frame. Meanwhile, a background thread runs continuously to match the incoming feature of vehicle trajectory with past features by conducting a topology searching method. In the end, the vehicle trajectories with well-matched features are considered to be the same vehicle. The entire pipeline has been validated on two different datasets, the precision is 0.64 in the CityFlow dataset which uses 6 cameras simultaneously. In the customized dataset, the same method can still reach real-time when using 16 cameras at the same time with smaller network modules.

关键词： Visualization Target tracking Roads Human-machine systems Pipelines Urban areas Cameras

来源：评论

学校读者我要写书评

暂无评论

Fault detection of lithium-ion batteries subject to probabilistic parametric uncertainties 11

Fault detection of lithium-ion batteries subject to probabil...

引用

11th CAA Symposium on Fault Detection, Supervision, and Safety for Technical Processes, SAFEPROCESS 2019

作者： Liu, Yuhao Wan, Yiming Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China

ISBN: (纸本)9781728106816

The fault detection task in lithium-ion battery management system (BMS) is critical to the safety and reliability of rechargeable and hybrid electric vehicles. To explicitly account for inevitable errors of battery model parameters, a robust fault detection method is proposed in this paper. The residual generator is established by exploiting an equivalent circuit model. The effect of uncertainties on the residual is parametrized as polynomial dependence on probabilistic uncertain parameters and noises. Then Gaussian mixtures are adopted to derive the residual distribution. To account for residual uncertainties in the detection decision, the weighted sum of distances from the generated residual to each Gaussian component of the residual distribution is proposed. Simulation results illustrate that our proposed method outperforms the conventional approach that does not consider parametric uncertainties. © 2019 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Independent dimensional phase transition on a two-dimensional Kuramoto model with matrix coupling

arXiv

引用

arXiv 2021年

作者： Wang, Chongzhi Shao, Haibin Li, Dewei Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China

The high-dimensional generalization of the one-dimensional Kuramoto paradigm has been an essential step in bringing about a more faithful depiction of the dynamics of real-world systems. Despite the multi-dimensional nature of the oscillators in these generalized models, the interacting schemes so far have been dominated by a scalar factor unanimously between any pair of oscillators that leads eventually to synchronization on all dimensions. As a natural extension of the scalar coupling befitting for the one-dimensional case, we take a tentative step in studying numerically and theoretically the coupling mechanism of 2 × 2 real matrices on two-dimensional Kuramoto oscillators. One of the features stemmed from this new mechanism is that the matrix coupling enables the two dimensions of the oscillators to separate their transitions to either synchronization or desynchronization which has not been seen in other high-dimensional generalizations. Under various matrix configurations, the synchronization and desynchronization of the two dimensions combine into four qualitatively distinct modes of position and motion of the system. We demonstrate that as one matrix is morphed into another in a specific manner, the system mode also switches correspondingly either through continuous or explosive transitions of the order parameters, thus mimicking a range of behaviors in information science and biology. Copyright © 2021, The Authors. All rights reserved.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Distributed Stabilization of Signed Networks via Self-loop Compensation

arXiv

引用

arXiv 2021年

作者： Shao, Haibin Pan, Lulu The Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China

This paper examines the stability and distributed stabilization of signed multi-agent networks. Here, positive semidefiniteness is not inherent for signed Laplacians, which renders the stability and consensus of this category of networks intricate. First, we examine the stability of signed networks by introducing a novel graph-theoretic objective negative cut set, which implies that manipulating negative edge weights cannot change a unstable network into a stable one. Then, inspired by the diagonal dominance and stability of matrices, a local state damping mechanism is introduced using self-loop compensation. The self-loop compensation is only active for those agents who are incident to negative edges and can stabilize signed networks in a fully distributed manner. Quantitative connections between selfloop compensation and the stability of the compensated signed network are established for a tradeoff between compensation efforts and network stability. Necessary and/or sufficient conditions for predictable cluster consensus of compensated signed networks are provided. The optimality of self-loop compensation is discussed. Furthermore, we extend our results to directed signed networks where the symmetry of signed Laplacian is not free. The correlation between the stability of the compensated dynamics obtained by self-loop compensation and eventually positivity is further discussed. Novel insights into the stability of multi-agent systems on signed networks in terms of self-loop compensation are offered. Simulation examples are provided to demonstrate the theoretical results. Copyright © 2021, The Authors. All rights reserved.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

Topology Inference for Network Systems: Causality Perspective and Non-asymptotic Performance

arXiv

引用

arXiv 2021年

作者： Li, Yushan He, Jianping Chen, Cailian Guan, Xinping Dept. of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China

Topology inference for network systems (NSs) plays a crucial role in many areas. This paper advocates a causality-based method based on noisy observations from a single trajectory of a NS, which is represented by the state-space model with general directed topology. Specifically, we first prove its close relationships with the ideal Granger estimator for multiple trajectories and the traditional ordinary least squares (OLS) estimator for a single trajectory. Along with this line, we analyze the non-asymptotic inference performance of the proposed method by taking the OLS estimator as a reference, covering both asymptotically and marginally stable systems. The derived convergence rates and accuracy results suggest the proposed method has better performance in addressing potentially correlated observations and achieves zero inference error asymptotically. Besides, an online/recursive version of our method is established for efficient computation or time-varying cases. Extensions on NSs with nonlinear dynamics are also discussed. Comprehensive tests corroborate the theoretical findings and comparisons with other algorithms highlight the superiority of the proposed method. Copyright © 2021, The Authors. All rights reserved.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Size-invariance matters: rethinking metrics and losses for imbalanced multi-object salient object detection 24

Size-invariance matters: rethinking metrics and losses for i...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Feiran Li Qianqian Xu Shilong Bao Zhiyong Yang Runmin Cong Xiaochun Cao Qingming Huang Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China and School of Control Science and Engineering Shandong University Jinan China and Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Decentralized Federated Learning for Collaborative Fault Diagnosis of PV Stations

arXiv

引用

arXiv 2022年

作者： Liu, Qi Yang, Bo Wang, Zhaojian Zhu, Dafeng Wang, Xinyi Ma, Kai Guan, Xinping The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China School of Electrical Engineering Yanshan University Qinhuangdao066004 China

Due to the different losses caused by various photovoltaic (PV) array faults, accurate diagnosis of fault types is becoming increasingly important. Compared with a single one, multiple PV stations collect sufficient fault samples, but their data is not allowed to be shared directly due to potential conflicts of interest. Therefore, federated learning can be exploited to train a collaborative fault diagnosis model. However, the modeling efficiency is seriously affected by the model update mechanism since each PV station has a different computing capability and amount of data. Moreover, for the safe and stable operation of the PV system, the robustness of collaborative modeling must be guaranteed rather than simply being processed on a central server. To address these challenges, a novel asynchronous decentralized federated learning (ADFL) framework is proposed. Each PV station not only trains its local model but also participates in collaborative fault diagnosis by exchanging model parameters to improve the generalization without losing accuracy. The global model is aggregated distributedly to avoid central node failure. By designing the asynchronous update scheme, the communication overhead and training time are greatly reduced. Both the experiments and numerical simulations are carried out to verify the effectiveness of the proposed method. © 2022, CC BY.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information 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 China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Utility-Oriented Underwater image Quality Assessment Based on Transfer Learning

arXiv

引用

arXiv 2022年

作者： Chen, Weiling Lin, Rongfu Liao, Honggang Zhao, Tiesong Gu, Ke Le Callet, Patrick Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information Fuzhou University Fuzhou350108 China Peng Cheng Laboratory Shenzhen518000 China The Faculty of Information Technology Beijing University of Technology Engineering Research Center of Intelligent Perception and Autonomous Control Ministry of Education Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Équipe Image Perception et Interaction Laboratoire des Sciences du Numérique de Nantes Université de Nantes France

The widespread image applications have greatly promoted the vision-based tasks, in which the image Quality Assessment (IQA) technique has become an increasingly significant issue. For user enjoyment in multimedia systems, the IQA exploits image fidelity and aesthetics to characterize user experience;while for other tasks such as popular object recognition, there exists a low correlation between utilities and perceptions. In such cases, the fidelity-based and aesthetics-based IQA methods cannot be directly applied. To address this issue, this paper proposes a utility-oriented IQA in object recognition. In particular, we initialize our research in the scenario of underwater fish detection, which is a critical task that has not yet been perfectly addressed. Based on this task, we build an Underwater image Utility Database (UIUD) and a learning-based Underwater image Utility Measure (UIUM). Inspired by the top-down design of fidelity-based IQA, we exploit the deep models of object recognition and transfer their features to our UIUM. Experiments validate that the proposed transfer-learning-based UIUM achieves promising performance in the recognition task. We envision our research provides insights to bridge the researches of IQA and computer vision. Copyright © 2022, The Authors. All rights reserved.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Towards Collision Detection, Localization and Force Estimation for a Soft Cable-driven Robot Manipulator

Towards Collision Detection, Localization and Force Estimati...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Yuxin Wang Hesheng Wang Fan Xu Junzhi Yu Weidong Chen Yun-Hui Liu Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Institute 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 China College of Engineering Peking University Beijing China The Chinese University of Hong Kong Hong Kong

Soft robots have been applied widely to various constrained scenarios due to the advantages over traditional rigid manipulators such as softness, deformability and adaptability to constrained surroundings. To make full use of this merit, this paper proposes a method that integrates collision detection, localization and force estimation for a cable-driven soft manipulator without any prior geometrical knowledge of its surroundings. First of all, a collision detection algorithm is presented based upon Cosserat-rod statics by a threshold method through using the cable tension and the shape information, which are obtained by the load cells and the Vicon system, respectively. Secondly, a collision localization and force estimation method is proposed through optimizing the discrepancy between the actual and the theoretical shapes. Finally, experiments are carried out to validate these algorithms. The experimental results demonstrate that the site, the magnitude as well as the direction can be estimated.

关键词： Location awareness Shape Conferences Force Estimation Soft robotics Manipulators

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：