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

IEEE Conference on Decision and control

作者： Haoyu Wei Lulu Pan Haibin Shao Dewei Li Wenbin Yu Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China and Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper examines the cluster consensus problem of higher-order interaction networks on switching networks. The matrix-valued inter-agent coupling mechanism is employed to capture the higher-order interactions amongst neighboring agents. Specifically, for a higher-order interaction network with both positive definite and positive semi-definite coupling matrices, we examine the scenario in which the nullspace of positive semi-definite coupling matrices is constructed by a set of orthogonal basis vectors. From the perspective of the lower-order component graph -the projection of network structure onto the direction of each orthogonal basis–results on the explicit characterization of cluster consensus of higher-order interaction networks are provided. Moreover, for time-varying higher-order interaction networks, necessary and sufficient conditions are provided to ensure that a time-varying network shares the same steady-state values as the integral time-invariant network. Simulation results are provided to demonstrate the theory.

关键词： Couplings Sufficient conditions Network topology Simulation Switches Vectors Topology Steady-state Matrix decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

Mixture-of-Experts for Open Set Domain Adaptation: A Dual-Space Detection Approach

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Du, Zhenbang An, Jiayu Tu, Yunlu Hong, Jiahao Wu, Dongrui Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

Open Set Domain Adaptation (OSDA) copes with the distribution and label shifts between the source and target domains simultaneously, performing accurate classification for known classes while identifying unknown class samples in the target domain. Most existing OSDA approaches, depending on the final image feature space of deep models, require manually-tuned thresholds, and may easily misclassify unknown samples as known classes. Mixture-of-Experts (MoE) could be a remedy. Within an MoE, different experts handle distinct input features, producing unique expert routing patterns for various classes in a routing feature space. As a result, unknown class samples may display different expert routing patterns to known classes. This paper proposes Dual-Space Detection, which exploits the inconsistencies between the image feature space and the routing feature space to detect unknown class samples without any threshold. A Graph Router is further introduced to better make use of the spatial information among the image patches. Experiments on three datasets validated the effectiveness and superiority of our approach. © 2020 IEEE.

关键词： Mixture-of-Experts Open Set Domain Adaptation Routing Feature

来源：评论

学校读者我要写书评

暂无评论

Fog images Generation about Unmanned Surface Vessels with Improved Generative Adversarial Network

Fog Images Generation about Unmanned Surface Vessels with Im...

引用

第42届中国控制会议

作者： Yifeng Tang Zhihui Huang Chuancong Tang Chuanshang Luo Yifan Xu Bin Liu Hai-Tao Zhang School of Artificial Intelligence and Automation the Engineering Research Center of Autonomous Intelligent Unmanned Systems the Key Laboratory of Image Processing and Intelligent Control and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology

This paper proposes a fog weather data augmentation method for the unmanned surface vessels(USVs) via improved Generative Adversarial Network(GAN) model. First, a generator scheme for GAN is proposed with the guided generation of the atmospheric scattering model in this paper. A Laplacian Pyramid Based Depth Residuals model is added to the generator which reduces the difficulty of generating fog images caused by the degradation of water surface image and improves the quality of generated images. Finally, fog images are generated from sunny weather images collected with HUST-12C by LPBDR-GAN model and experiments show that generated images are very close to real fog images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Spatial Registration Algorithm for Sensors on Multiple Mobile Platforms

引用

Journal of Shanghai Jiaotong university(Science) 2022年第5期27卷 638-648页

作者： LÜRunyan PENG Na WU Yi CAI Yunze Department of Automation Key Laboratory of System Control and Information Processing of Ministry of EducationKey Laboratory of Marine Intelligent Equipment and System of Ministry of EducationShanghai Jiao Tong UniversityShanghai200240China Shanghai Aerospace Electronic Technology Institute Shanghai Academy of Spaceflight TechnologyShanghai201109China Alibaba(China)Co. Ltd.Hangzhou311121China

This paper focuses on the spatial registration algorithm under the earth-center earth-fixed(ECEF)coordinate system for multiple mobile *** sensor measurement biases are discussed with the attitude information of the platform into ***,the biased measurement model is ***,the maximum likelihood registration(MLR)algorithm is discussed to simultaneously estimate the measurement biases and the target ***,an improved online MLR(IMLR)algorithm is proposed through a sliding window of adaptive *** results demonstrate that the proposed IMLR algorithm effectively improves the realtime ability of the system and can approach similar estimation accuracy to the conventional MLR algorithm.

关键词： spatial registration 3D sensors improved online maximum likelihood registration(IMLR)

来源：评论

学校读者我要写书评

暂无评论

Holmes-VAU: Towards Long-term Video Anomaly Understanding at Any Granularity

arXiv

引用

arXiv 2024年

作者： Zhang, Huaxin Xu, Xiaohao Wang, Xiang Zuo, Jialong Huang, Xiaonan Gao, Changxin Zhang, Shanjun Yu, Li Sang, Nong Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China University of Michigan Ann Arbor United States Kanagawa University Japan

How can we enable models to comprehend video anomalies occurring over varying temporal scales and contexts? Traditional Video Anomaly Understanding (VAU) methods focus on frame-level anomaly prediction, often missing the interpretability of complex and diverse real-world anomalies. Recent multimodal approaches leverage visual and textual data but lack hierarchical annotations that capture both short-term and long-term anomalies. To address this challenge, we introduce HIVAU-70k, a large-scale benchmark for hierarchical video anomaly understanding across any granularity. We develop a semi-automated annotation engine that efficiently scales high-quality annotations by combining manual video segmentation with recursive free-text annotation using large language models (LLMs). This results in over 70,000 multi-granular annotations organized at clip-level, event-level, and video-level segments. For efficient anomaly detection in long videos, we propose the Anomaly-focused Temporal Sampler (ATS). ATS integrates an anomaly scorer with a density-aware sampler to adaptively select frames based on anomaly scores, ensuring that the multimodal LLM concentrates on anomaly-rich regions, which significantly enhances both efficiency and accuracy. Extensive experiments demonstrate that our hierarchical instruction data markedly improves anomaly comprehension. The integrated ATS and visual-language model outperform traditional methods in processing long videos. Our benchmark and model are publicly available at https: //***/pipixin321/HolmesVAU. Copyright © 2024, The Authors. All rights reserved.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Koopman Operator Learning control of the Piezoelectric Actuator

Koopman Operator Learning Control of the Piezoelectric Actua...

引用

第42届中国控制会议

作者： Xiang Huang Hai-Tao Zhang School of Artificial Intelligence and Automation the Engineering Research Center of Autonomous Intelligent Unmanned Systems the Key Laboratory of Image Processing and Intelligent Control and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology

The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this challenging issue, this work develops a Koopman model predict control(Koopman-MPC) framework for the piezoelectric actuator. Specifically, the Koopman operator theory is adapted for modeling the piezoelectric actuator dynamics. A simple yet powerful linear model spanned in a high-dimensional space is thus constructed to characterize the hysteresis dynamics. Subsequently, upon the established Koopman model, an MPC scheme is put forward for tracking control of piezoelectric actuators. Therein, by sustained optimizing a cost function containing future outputs and control increments, the control input is obtained. Moreover, extensive tracking simulations are carried out on a simulated piezoelectric actuator for verifying the feasibility and effectiveness of the Koopman-MPC scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

USV Path Planning Based on ACO-SA Algorithm

USV Path Planning Based on ACO-SA Algorithm

引用

第42届中国控制会议

作者： Chuanshang Luo Yifeng Tang Zhihui Huang Yifan Xu Bin Liu Hai-Tao Zhang School of Artificial Intelligence and Automation the Engineering Research Center of Autonomous Intelligent Unmanned Systems the Key Laboratory of Image Processing and Intelligent Control and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology

This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization ***, this paper uses the ways of multi-objective optimization to model the USV path planning problem. An improved ant colony algorithm named ACO-SA is put forward afterwards to effectively solve the problem. The algorithm is a combination of ACO algorithm(ant colony algorithm) and SA algorithm(simulated annealing algorithm), which has three improments: change the initial distribution of pheromone to guide the search when the algorithm has just started running;change the heuristic function and state transition probability taking three factors into consideration;change the pheromone update rule and make the ants compete for the right to update pheromone by simulated annealing algorithm, and update the best solution by the same ***, simulation experiment and field experiment are conducted to check the validity of ACO-SA algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Pythagorean Fuzzy Distance Method with Application in the Selection of Renewable Energy Source via MCDA

An Enhanced Pythagorean Fuzzy Distance Method with Applicati...

引用

New Trends in Computational Intelligence (NTCI), International Conference on

作者： Anum Manasseh Terna Paul Augustine Ejegwa Yuming Feng Department of Mathematics Joseph Sarwuan Tarka University Makurdi Nigeria Key Laboratory of Intelligent Information Processing and Control Chongqing Three Gorges University Wanzhou Chongqing China

ISBN: (数字)9798331517021

ISBN: (纸本)9798331517038

Many complex decision-making processes have been prosecuted with the aid of Pythagorean fuzzy distance methods. This is because the theory of Pythagorean fuzzy sets has the ability to handle the vagueness and imprecision in decision-making. Various Pythagorean fuzzy distance methods have been constructed and applied to multiple criteria decision-making. Recently, Thakur et al. developed a Pythagorean fuzzy distance method based on Euler's number by considering an incomplete number of the parameters of Pythagorean fuzzy sets. This exclusion could render the result of the distance method unreliable in real-life applications. In this work, we augment the Thakur et al:'s Pythagorean fuzzy distance method by the inclusion of the complete parameters of Pythagorean fuzzy sets for an effective interpretation. The properties of the enhanced Pythagorean fuzzy distance method are described and the method satisfies the conditions of distance function. In addition, the new method is used to discuss the selection of renewable energy source based on multiple criteria decision-making approach. Furthermore, the enhanced method is compared with other existing Pythagorean fuzzy distance methods via multiple criteria decision-making approach to show the superiority of the augmented method.

关键词： Renewable energy sources Fuzzy sets Sensitivity analysis Decision making Market research MCDM Hamming distances Decision analysis Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

Contour Extraction via Contextual Modulation

引用

Chinese Journal of Electronics 2023年第2期18卷 329-331页

作者： Wentao Huang Licheng Jiao Yuelei Xu Ye Sun Jianhua Jia Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Institute of Intelligent Information Processing Xidian University Xi'an China Department of Avionics Engineering Engineering College of Air Force Engineering University Xi'an China

Contour extraction is an important task in image processing and computer vision. The contextual modulation is a universal phenomenon in the primary visual cortex (V1). A biologically motivated computational model is presented for contour extraction in this paper. Two mechanisms of contextual modulation, surround suppression and collinear facilitation, are integrated in this model. We obtain good results via this model to extract contours from images with noise and texture backgrounds. This work provides a biologically motivated approach with great potential for computer vision.

关键词： Visualization Computer vision Computational modeling Biological system modeling image processing Modulation Organizations

来源：评论

学校读者我要写书评

暂无评论

Dynamic Graph Dismantling with Reinforcement Supervised Learning

Dynamic Graph Dismantling with Reinforcement Supervised Lear...

引用

第42届中国控制会议

作者： Yumei Wang Chuancong Tang Hai-Tao Zhang School of Artificial Intelligence and Automation the Engineering Research Center of Autonomous Intelligent Unmanned Systemsthe Key Laboratory of Image Processing and Intelligent Controland the State Key Laboratory of Digital Manufacturing Equipment and TechnologyHuazhong University of Science and Technology

There are always some "key" nodes in a big complex network,which can joint the most connected *** to identify these nodes,finding a minimum set of nodes to attack for reducing the size of residual network's Largest Connected Component(LCC) to break up the original network,has become a research ***,a method for determining the"key" nodes based on reinforcement learning framework and supervised learning model is *** algorithm can not only utilize the dynamic exploration ability of reinforcement learning to collect a rich training dataset,but also take advantage of the characteristics that supervised learning is adaptive and has strong generalization ability to possess high efficiency and strong *** order to further improve the algorithm's performance,-greedy mechanism is used to explore more network *** experiment results show that given the same fraction of removed nodes,our algorithm can make the residual LCC smaller in various networks which is superior to the state-of-the-art algorithms in terms of effectiveness and generalization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：