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

arXiv 2023年

作者： Song, Liang Wang, Guangming Liu, Jiuming Fu, Zhenyang Miao, Yanzi Wang, Hesheng Engineering Research Center of Intelligent Control for Underground Space Ministry of Education School of Information and Control Engineering Advanced Robotics Research Center China University of Mining and Technology Xuzhou221116 China 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

In recent studies, the generalization of neural radiance fields for novel view synthesis task has been widely explored. However, existing methods are limited to objects and indoor scenes. In this work, we extend the generalization task to outdoor scenes, trained only on object-level datasets. This approach presents two challenges. Firstly, the significant distributional shift between training and testing scenes leads to black artifacts in rendering results. Secondly, viewpoint changes in outdoor scenes cause ghosting or missing regions in rendered images. To address these challenges, we propose a geometric correction module and an appearance correction module based on multi-head attention mechanisms. We normalize rendered depth and combine it with light direction as query in the attention mechanism. Our network effectively corrects varying scene structures and geometric features in outdoor scenes, generalizing well from object-level to unseen outdoor scenes. Additionally, we use appearance correction module to correct appearance features, preventing rendering artifacts like blank borders and ghosting due to viewpoint changes. By combining these modules, our approach successfully tackles the challenges of outdoor scene generalization, producing high-quality rendering results. When evaluated on four datasets (Blender, DTU, LLFF, Spaces), our network outperforms previous methods. Notably, compared to MVSNeRF, our network improves average PSNR from 19.369 to 25.989, SSIM from 0.838 to 0.889, and reduces LPIPS from 0.265 to 0.224 on Spaces outdoor scenes. © 2023, CC BY.

关键词： Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Optimizing Binary Sequence Excitation Signals for Rapid Impedance Spectrum Measurement in Proton Exchange Membrane Fuel Cells

Optimizing Binary Sequence Excitation Signals for Rapid Impe...

引用

第43届中国控制会议

作者： Jingzhi Lei Chuang Sheng Jingjing Wang Liansong Yu Xi Li School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education MinistryHuazhong University of Science and Technology State Grid Electric Power Research Institute Wuhan Nanrui Limited Liability Company Shenzhen Huazhong University of Science and Technology Research Institute

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

With the increasing demand for efficient and reliable renewable energy sources,Proton Exchange Membrane Fuel Cells(PEMFCs) have emerged as a promising *** experiments demonstrate that Electrochemical Impedance Spectroscopy(EIS) effectively differentiates various states of *** broadband signals as testing excitations significantly reduces EIS measurement time,facilitating real-time monitoring of PEMFCs' health under dynamic *** signal design requires maintaining adequate amplitude across frequency components for noise resistance while minimizing signal peak value to reduce operational *** paper introduces an EIS simulation environment,leveraging PEMFCs' impedance and electrochemical noise *** focuses on optimizing the excitation signal's amplitude-frequency distribution using discrete interval binary *** results indicate that our method achieves minimal perturbation amplitude while preserving measurement accuracy in amplitude-frequency signal design.

关键词： Proton exchange membrane fuel cell Electrochemical impedance spectroscopy Electrochemical noise Excitation signal optimization

来源：评论

学校读者我要写书评

暂无评论

Wind Speed Prediction Based on Combined Deep Learning Model Woa-Vmd-Gru-Tcn

SSRN

引用

SSRN 2024年

作者： Zeng, Chuxi Xia, Zhipnig Wang, Zhuo Zhou, Yihuan Zeng, Linghong Yin, Zishan Li, Xi Huang, Haizhou Qi, Xiaolan Deng, Zhonghua School of Artificial Intelligence and Automation Key Laboratory of Image Processing Intelligent Control of Education Ministry Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518055 China Huazhong University of Science and Technology China

Accurate wind speed prediction is essential for the integration of wind turbines into microgrids. This paper proposes a combined prediction model, firstly, the key parameters of the variational modal decomposition (VMD) is optimized by whale optimization algorithm (WOA), and the original wind speed sequence is decomposed by using the WOA-VMD to obtain the intrinsic mode functions (IMFs) with different frequencies;secondly, the Pearson correlation coefficient is performed between IMFs and the original wind speed sequence, classifying the IMFs into two groups according to their correlation coefficients, the IMFs with strong correlation are predicted using the temporal convolutional network (TCN), and the IMFs with weak correlation are predicted using the gate recurrent unit (GRU);finally, the prediction results of each component are superimposed to obtain the final prediction results. The combined model is applied to real data from six wind farms in China with different climatic conditions and geographic locations, and different comparison models are established for validation. The experimental results show that the combined WOA-VMD-GRU-TCN prediction model can significantly improve the prediction accuracy, reduce the wind speed sequence error, and have better robustness than other methods. © 2024, The Authors. All rights reserved.

关键词： Intrinsic mode functions

来源：评论

学校读者我要写书评

暂无评论

InferEM: Inferring the Speaker’s Intention for Empathetic Dialogue Generation

arXiv

引用

arXiv 2022年

作者： Lv, Guoqing Li, Jiang Wang, Xiaoping Zeng, Zhigang The School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China The Hubei Key Laboratory of Brain-inspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China

Current approaches to empathetic response generation typically encode the entire dialogue history directly and put the output into a decoder to generate friendly feedback. These methods focus on modelling contextual information but neglect capturing the direct intention of the speaker. We argue that the last utterance in the dialogue empirically conveys the intention of the speaker. Consequently, we propose a novel model named InferEM for empathetic response generation. We separately encode the last utterance and fuse it with the entire dialogue through the multi-head attention based intention fusion module to capture the speaker’s intention. Besides, we utilize previous utterances to predict the last utterance, which simulates human’s psychology to guess what the interlocutor may speak in advance. To balance the optimizing rates of the utterance prediction and response generation, a multitask learning strategy is designed for InferEM. Experimental results demonstrate the plausibility and validity of InferEM in improving empathetic expression. Copyright © 2022, The Authors. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Robust flocking for non-identical second-order nonlinear multi-agent systems

引用

Autonomous intelligent Systems 2021年第1期1卷 81-90页

作者： Xiuxian Li Housheng Su Li Li Department of Control Science and Engineering College of Electronics and Information Engineeringand Shanghai Research Institute for Intelligent Autonomous SystemsTongji UniversityShanghai 200092China Institute for Advanced Study Tongji UniversityShanghai 200092China School of Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of ChinaHuazhong University of Science and TechnologyLuoyu Road 1037Wuhan 430074China

This paper investigates the robust flocking problem for second-order nonlinear systems with a leader and external *** contrast with most of second-order systems in the literature,the intrinsic dynamics here are nonlinear and non-identical that depend not only on the velocity but also on the position,which is more ***,the interaction topology is undirected and *** that the leader’s velocity may be constant or time-varying,two distributed flocking control laws have been proposed for two cases to make the differences of the velocities between all followers and the leader approach to zero *** proposed distributed flocking control laws are both model-independent which results in the effectiveness of the controllers to cope with the different intrinsic dynamics of the followers and the leader under some assumptions on boundedness of several *** example is given to illustrate the validity of the theoretical results.

关键词： Flocking Multi-agent systems Second-order nonlinear systems Non-identical dynamics

来源：评论

学校读者我要写书评

暂无评论

ColorDynamic: Generalizable, Scalable, Real-time, End-to-end Local Planner for Unstructured and Dynamic Environments

arXiv

引用

arXiv 2025年

作者： Xin, Jinghao Liang, Zhichao Zhang, Zihuan Wang, Peng Li, Ning Department of Automation Shanghai Jiao Tong University Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

Deep Reinforcement Learning (DRL) has demonstrated potential in addressing robotic local planning problems, yet its efficacy remains constrained in highly unstructured and dynamic environments. To address these challenges, this study proposes the ColorDynamic framework. First, an end-to-end DRL formulation is established, which maps raw sensor data directly to control commands, thereby ensuring compatibility with unstructured environments. Under this formulation, a novel network, Transqer, is introduced. The Transqer enables online DRL learning from temporal transitions, substantially enhancing decision-making in dynamic scenarios. To facilitate scalable training of Transqer with diverse data, an efficient simulation platform E-Sparrow, along with a data augmentation technique leveraging symmetric invariance, are developed. Comparative evaluations against state-of-the-art methods, alongside assessments of generalizability, scalability, and real-time performance, were conducted to validate the effectiveness of ColorDynamic. Results indicate that our approach achieves a success rate exceeding 90% while exhibiting real-time capacity (1.2–1.3 ms per planning). Additionally, ablation studies were performed to corroborate the contributions of individual components. Building on this, the OkayPlan-ColorDynamic (OPCD) navigation system is presented, with simulated and real-world experiments demonstrating its superiority and applicability in complex scenarios. The codebase and experimental demonstrations have been open-sourced on our website1 to facilitate reproducibility and further research. Copyright © 2025, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

A Parallel Read-Write Circuit With Fast Amplitude-Adaptive Matching Scheme to Memristor Crossbar Array

引用

IEEE Transactions on Circuits and Systems I: Regular Papers 2025年

作者： Jiang, Ningye Jiang, Mingxuan Huang, Haoen Yang, Le Huang, Yi Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430074 China Wuhan Institute of Technology School of Electrical and Information Engineering Wuhan430205 China University of Massachusetts Amherst Department of Electrical and Computer Engineering AmherstMA01003 United States

Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in long writing times. To address these issues, we propose a parallel R-W circuit with a fast amplitude-adaptive matching (AAM) scheme. The fast AAM scheme is designed to accelerate time of writing memristors in MCA by adaptively adjusting the writing voltage to match an optimal amplitude. The architecture of parallel R-W circuit are outlined with the implementation of R-W processes. The design principles of parallel R-W unit, fast AAM unit, and associated control logic are described for analyzing their functions within the circuit. By integrating the parallel R-W circuit with MCA, a computing block is leveraged in a neural network for classification tasks. The experimental results demonstrate that the neural network with multiple computing blocks maintains high accuracy across various datasets (over 80%). Furthermore, the proposed AAM scheme achieves an average 54% reduction in writing time compared to that one without AAM scheme. Compared to the pulse-width scheme, the parallel R-W circuit exhibits an average 3.05× speedup in adjusting a 5×5 MCA, and the speedup efficiency is higher as the increases of MCA size. © 2025 IEEE.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

A Point Cloud Segmentation Method Based on Ground Point Cloud Removal and Multi-Scale Twin Range image

A Point Cloud Segmentation Method Based on Ground Point Clou...

引用

Chinese control Conference (CCC)

作者： Yicheng Zhou Gang Peng Hangqi Duan Zhangang Wu Xukang Zhu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan China Shantui Construction Machinery Co. Ltd. Jining China

Aiming at the shortcomings of traditional point cloud segmentation algorithms, this paper proposes a 3D lidar point cloud segmentation method combining ground filtering and multi-scale twin range image construction. This method fully considers the geometric space distribution characteristics of the point cloud and the randomness of the positions between objects. Based on the assumption of multi plane model, the point cloud is divided into sectors. The ground points are removed through region ground plane fitting and growth, and then the multi-scale twin range image is constructed according to non-ground points. On the basis of the twin range image, the Breadth First Search algorithm is improved, the depth-breadth joint search strategy is proposed, all the points to be clustered are traversed, and the adaptive clustering threshold is used for point cloud clustering, which realizes a point cloud segmentation method with higher accuracy and robustness. Through the experimental analysis of KITTI dataset and collected campus outdoor scene dataset, compared with the traditional point cloud segmentation algorithm, the method proposed in this paper can effectively improve the point cloud segmentation accuracy and robustness of mobile robots in complex environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Class-Agnostic Motion Prediction with Pseudo Label Regeneration and BEVMix

arXiv

引用

arXiv 2023年

作者： Wang, Kewei Wu, Yizheng Pan, Zhiyu Li, Xingyi Xian, Ke Wang, Zhe Cao, Zhiguo Lin, Guosheng S-Lab Nanyang Technological University Singapore Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China SenseTime Research Hong Kong

Class-agnostic motion prediction methods aim to comprehend motion within open-world scenarios, holding significance for autonomous driving systems. However, training a high-performance model in a fully-supervised manner always requires substantial amounts of manually annotated data, which can be both expensive and time-consuming to obtain. To address this challenge, our study explores the potential of semi-supervised learning (SSL) for class-agnostic motion prediction. Our SSL framework adopts a consistency-based self-training paradigm, enabling the model to learn from unlabeled data by generating pseudo labels through test-time inference. To improve the quality of pseudo labels, we propose a novel motion selection and re-generation module. This module effectively selects reliable pseudo labels and regenerates unreliable ones. Furthermore, we propose two data augmentation strategies: temporal sampling and BEVMix. These strategies facilitate consistency regularization in SSL. Experiments conducted on nuScenes demonstrate that our SSL method can surpass the self-supervised approach by a large margin by utilizing only a tiny fraction of labeled data. Furthermore, our method exhibits comparable performance to weakly and some fully supervised methods. These results highlight the ability of our method to strike a favorable balance between annotation costs and performance. Code will be available at https://***/kwwcv/SSMP. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Distributed Neighbor Selection on Matrix-weighted Networks

Distributed Neighbor Selection on Matrix-weighted Networks

引用

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

作者： Haoyu Wei Lulu Pan Haibin Shao Dewei Li Department of Automation 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 Jiao Tong University Shanghai China

This paper explores distributed neighbor selection in matrix-weighted networks, where a matrix-valued weight captures the interdependencies among agents’ states. We demonstrate the feasibility of preserving and, in certain cases, improving the convergence rate of matrix-weighted networks by having agents exclusively engage with a subset of their neighbors. Leveraging the inherent monotonicity of Laplacian matrix eigenvectors, we introduce a novel neighbor selection criterion that reduces network connections while enhancing convergence rates. Existing neighbor selection strategies often require acquiring information from all nodes before making decisions. In order to propose a distributed neighbor selection strategy for matrix-weighted networks, we establish a numerical relationship between Laplacian eigenvectors and a locally measurable metric. In essence, this paper extends prior findings from scalar-weighted networks to matrix-weighted networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：