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

Current-Constrained Finite-Time Control Scheme for Speed Regulation of PMSM Systems With Unmatched Disturbances

IEEE Transactions on Automation Science and Engineering 2025年 22卷 16877-16887页

作者： Huiming Wang Zhize Zhang Yingjie Luo Junxiao Wang Jiankun Sun Yunda Yan Xianlun Tang Chongqing Key Laboratory of Complex Systems and Autonomous Control Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China College of Information Engineering Zhejiang University of Technology Hangzhou China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan China Department of Computer Science University College London London U.K.

The article investigates the speed regulation of permanent magnet synchronous motor (PMSM) systems. Existing control methods of the non-cascade structure suffer from the drawbacks of unsatisfactory anti-disturbance performance and slow convergence rate when the system is affected by disturbances, especially unmatched disturbances. Meanwhile, the requirements of current constraint and fast dynamics cannot be effectively balanced in the single-loop structure of speed and current using traditional control methods such as the PID controller. Because large transient currents induced by fast dynamics may damage the hardware of the system. Therefore, a current-constrained finite-time control approach is proposed. Specifically, a robust finite-time control scheme is developed with the assistance of the improved finite-time observer technique. The proposed method is capable of actively suppressing both matched and unmatched disturbances in non-cascade control systems. Simultaneously, an effective penalty mechanism is established to incorporate a specific gain function into the designed controller. This approach restricts the q-axis current to a predefined safe range without solving an optimization problem. Finally, comparative experiment results indicate that the newly proposed finite-time control method outperforms the baseline control methods in terms of disturbance rejection, convergence rate, and current constraint. Note to Practitioners—This paper addresses practical challenges in controlling permanent magnet synchronous motor (PMSM) systems, such as ensuring robust disturbance rejection while limiting transient currents to protect the hardware. Traditional methods often fail to balance fast dynamics with current constraints, leading to inefficiencies and potential damage. To tackle these issues, the proposed finite-time control approach introduces a practical solution that achieves robust disturbance rejection while ensuring that transient currents remain within safe o

关键词： Convergence Observers Control systems Automation Transient analysis Asymptotic stability Stability analysis Regulation Permanent magnet motors Optimization

来源：评论

学校读者我要写书评

暂无评论

Modified model of lane capacity at signalised intersections with waiting areas

Advances in Transportation Studies

引用

Advances in Transportation Studies 2021年 55卷 19-34页

作者： Wang, F. Han, N. Sun, Z.D. Shao, C.F. Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing Jiaotong University No.3 Shangyuan Road Haidian Beijing100044 China Laboratory of Intelligent Transportation-Henan Police College No. 1 East Road Jinshui Zhengzhou450046 China

Left-tum conflicts impact considerably the security and capacity of intersections. There are many practices to decrease conflicts and improve the efficiency of intersections, such as continuous flow intersection (CFI), contraflow left-tum lane, U-tum etc., however, the method of installing waiting areas (WAs) is common in China and it is easier to be accepted by Chinese drivers. Many studies have shown either theoretically or via simulation that WAs improve the traffic capacity greatly. However, few have considered how the vehicle startup process and red clearance interval differ for lanes with and without WAs. Comparing the start-up lost time of intersections with and without WAs, This work explores the difference of clearance interval between intersections with and without WAs by conflict method, then establishes a modified capacity model about lanes with WAs. Finally, through field investigation of an intersection with left-tum WAs in Zhengzhou, the parameters needed for the modified model are determined. It is shown that the capacity of a lane with a 29-m WA and 18-s green time is increased by only 8.9%. © 2021, Aracne Editrice. All rights reserved.

关键词： Capacity Model Signalised intersection Waiting area

来源：评论

学校读者我要写书评

暂无评论

A comprehensive survey on shadow removal from document images: datasets, methods, and opportunities

引用

Vicinagearth 2025年第1期2卷 1-18页

作者： Wang, Bingshu Li, Changping Zou, Wenbin Zhang, Yongjun Chen, Xuhang Chen, C.L. Philip School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing & Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen University Shenzhen China Yongjun Zhang is with the State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China School of Computer Science and Engineering Huizhou University Huizhou China School of Computer Science and Engineering South China University of Technology and Pazhou Lab Guangzhou China

With the rapid development of document digitization, people have become accustomed to capturing and processing documents using electronic devices such as smartphones. However, the captured document images often suffer from issues like shadows and noise due to environmental factors, which can affect their readability. To improve the quality of captured document images, researchers have proposed a series of models or frameworks and applied them in distinct scenarios such as image enhancement, and document information extraction. In this paper, we primarily focus on shadow removal methods and open-source datasets. We concentrate on recent advancements in this area, first organizing and analyzing nine available datasets. Then, the methods are categorized into conventional methods and neural network-based methods. Conventional methods use manually designed features and include shadow map-based approaches and illumination-based approaches. Neural network-based methods automatically generate features from data and are divided into single-stage approaches and multi-stage approaches. We detail representative algorithms and briefly describe some typical techniques. Finally, we analyze and discuss experimental results, identifying the limitations of datasets and methods. Future research directions are discussed, and nine suggestions for shadow removal from document images are proposed. To our knowledge, this is the first survey of shadow removal methods and related datasets from document images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Feature Decoupled of Deep Mutual Information Maximization

Feature Decoupled of Deep Mutual Information Maximization

引用

Automation, robotics and Computer Engineering (ICARCE), International Conference on

作者： Xing He Changgen Peng Lin Wang Weijie Tan Zifan Wang State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China Guizhou Big Data Academy Guizhou University Guiyang China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China Institute of Guizhou Aerospace Measuring and Testing Technology Guiyang China

In deep learning, supervised learning techniques usually require a large amount of expensive labeled data to train the network, and the feature representations extracted by the model usually mix multiple attributes, resulting in feature representations that are difficult to decouple and are non-interpretable, which restricts the application and development of deep learning techniques, and for this reason, it is particularly important to study decoupled feature representation methods for unsupervised learning. Although the Learning deep representations by mutual information estimation and maximization (DIM) method achieves excellent results in unsupervised learning, the feature representations learned by the DIM method still suffer from the problem of difficult decoupling. decoupling problem. To address this problem, we minimize the mutual information between the intermediate layer feature representations learned by the hidden layer of the encoder during the encoder training process, so that the features learned by each filter are as uncorrelated as possible, thus realizing feature decoupling, and our method is called FP-DIM. Finally, the effectiveness of the FP-DIM method is verified on the CIFAR-10, STL-10, and Fashion-MNIST datasets. The experiments show that our proposed FP-DIM method is more significant for the learned decouplable middle layer feature representation. Finally, we also propose a reflection of future research for the FP-DIM method, aiming to provide a research idea and direction for solving unsupervised interpretable machine learning and to lay a solid theoretical and application foundation for machine learning fields such as image classification and migration learning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning 24

Towards High-resolution 3D Anomaly Detection via Group-Level...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Cross Self-Attention Feature Fusion Module for Robust 2d Multiple Human Pose Estimation

SSRN

引用

SSRN 2023年

作者： Zhan, Jin Yue, Zhenmeng Tian, Weili Zhao, Huimin Xie, Guiyuan Hu, Bo Lei, Fangyuan Liang, Guozhu Department of Computer Science Guangdong Polytechnic Normal University Guangzhou China College of Big Data and Computer Guangdong Baiyun University Guangzhou China Guangdong Provincial Key Laboratory of Intellectual Property & Big Data Guangdong Polytechnic Normal University Guangzhou China Guangzhou Intelligent Building Equipment Information Integration and Control Key Laboratory Guangzhou China

The existing attention mechanism-based human pose estimation methods detect joints by modeling the global context of key points and their surrounding pixels. However, due to high computational complexity, these methods are difficult to keep key semantic information for multi-scale features. In this paper, we propose a new cross self-attention module for semantic preservation, which models the context information in both channel and spatial dimensions to obtain richer structural correlations between multiple human joints. Both the channel self-attention block and the spatial self-attention block adopt a dual branch structure to avoid the high computational complexity and reduce the loss of semantic information. The proposed module is generic and can be easily integrated into various feature extraction architectures. We validate our cross self-attention module based on HRNet through extensive experiments on CrowdPose and MS COCO datasets for multiple human pose estimation. The experiments show that the proposed method is proved to be robust to the occlusion, deformation and other complex scenes in pose estimation, achieving favorable performance on the CrowdPose datasets and the COCO datasets. © 2023, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

FGPrompt: fine-grained goal prompting for image-goal navigation 23

FGPrompt: fine-grained goal prompting for image-goal navigat...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Xinyu Sun Peihao Chen Jugang Fan Thomas H. Li Jian Chen Mingkui Tan South China University of Technology and Information Technology R&D Innovation Center of Peking University South China University of Technology Peking University Shenzhen Graduate School South China University of Technology and Pazhou Laboratory and Key Laboratory of Big Data and Intelligent Robot Ministry of Education

Learning to navigate to an image-specified goal is an important but challenging task for autonomous systems. The agent is required to reason the goal location from where a picture is shot. Existing methods try to solve this problem by learning a navigation policy, which captures semantic features of the goal image and observation image independently and lastly fuses them for predicting a sequence of navigation actions. However, these methods suffer from two major limitations. 1) They may miss detailed information in the goal image, and thus fail to reason the goal location. 2) More critically, it is hard to focus on the goal-relevant regions in the observation image, because they attempt to understand observation without goal conditioning. In this paper, we aim to overcome these limitations by designing a Fine-grained Goal Prompting (FGPrompt) method for image-goal navigation. In particular, we leverage fine-grained and high-resolution feature maps in the goal image as prompts to perform conditioned embedding, which preserves detailed information in the goal image and guides the observation encoder to pay attention to goal-relevant regions. Compared with existing methods on the image-goal navigation benchmark, our method brings significant performance improvement on 3 benchmark datasets (i.e., Gibson, MP3D, and HM3D). Especially on Gibson, we surpass the state-of-the-art success rate by 8% with only 1/50 model size.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Azimuth Ambiguity Suppression for Sparse SAR Imaging Based on Unfolded Deep Network 15

Azimuth Ambiguity Suppression for Sparse SAR Imaging Based o...

引用

15th European Conference on Synthetic Aperture Radar, EUSAR 2024

作者： Wu, Yuwei Zhang, Zhe Song, Ruizhen Qiu, Xiaolan Yu, Weidong Department of Space Microwave Remote Sensing System Beijing100090 China Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China Key Laboratory of Intelligent Aerospace Big Data Application Technology Suzhou215123 China Suzhou Aerospace Information Research Institute Suzhou215123 China School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9783800762873

Sparse synthetic aperture radar (SAR) imaging allows for a reduction in the azimuth sampling rate based on compressive sensing theory. However, it relies on the sparsity of scenes, which can lead to significant azimuth ambiguity. To address this issue, we introduce a novel network designed to suppress azimuth ambiguity for sparse SAR imaging. Our proposed deep unfolded network is based on the Iterative Thresholding Algorithm Learned (LISTA). We replace the observation matrix with Matched Filter (MF) operators to reduce computational complexity. Experiments with real SAR scene data demonstrate the effectiveness and superiority of our approach in suppressing azimuth ambiguity. © VDE VERLAG GMBH ∙ Berlin ∙ Offenbach.

关键词： Matched filters

来源：评论

学校读者我要写书评

暂无评论

A Multi-Step Speed Prediction Method for Traffic Networks Based on MAF-GCN-Seq2Seq Model 2

A Multi-Step Speed Prediction Method for Traffic Networks Ba...

引用

2nd International Conference on Electronic Information Technology and Smart Agriculture, ICEITSA 2022

作者： Long, Yi Xiao, Hongbo Xiao, Jianhua Peng, Xiaoning School of Computer Science and Engineering Huaihua University Hunan Huaihua418000 China Intelligent Processing and Application in Hunan Province Universities Key Laboratory of Wuling-Mountain Health Big Data Hunan Huaihua418000 China Key Lab. of Intelligent Contr. Technol. for Wuling-Mountain Ecological Agriculture in Hunan Province Hunan Huaihua418000 China

ISBN: (纸本)9781665464017

Accurately predicting the future trend of traffic flow is of great significance to the planning of urban traffic. The great challenge of predicting traffic flow stems from the complexity and uncertainty of traffic flow. To address the complexity of traffic flow, this paper proposes a MAF-GCN 2 Seq model. The model uses a moving average filter to filter the time series data, extracts the spatial features between each node through a graph convolutional neural network, and forms a time series matrix for input into the encoder (GRU), and introduces a self-attention mechanism to mine the spatial features. time-domain features for multi-step traffic speed prediction. In order to verify the advanced nature of the model, this paper uses the traffic flow data set in Shenzhen to predict the traffic flow. Through the comparison experiments, it can be seen that the prediction accuracy of the MAF-GCN 2 Seq model reaches 90%, which has obvious advantages compared with other models. © 2022 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Multi-modal Multi-objective Algorithm Based on Dynamic Niche Updating 11th

Two-Stage Multi-modal Multi-objective Algorithm Based on Dy...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Ji, Haonian Chen, Hongmei Mi, Yong Institute of Artificial Intelligence School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Engering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China

ISBN: (纸本)9783031927409

In solving multi-modal multi-objective optimization problems (MMOPs), objective and decision space changes need to be considered. However, many multi-modal multi-objective evolutionary algorithms (MMOEAs) tend to prioritize diversity in the objective space during the optimization process, often leading to suboptimal diversity and distribution in the decision space. This study proposes the Dynamic-Niche-Based Two-Stage Evolution (DNTE) approach to address this issue. DNTE employs differential evolutionary strategies in two stages, utilizing dynamic niche to enhance solution viability and optimize decision space distribution at different phases. In the first stage, the dynamic niche is used to restrict the dominance range of Pareto domination. In contrast, in the second stage, it is integrated with differential evolution to refine the distribution of the decision space. Combining DNTE with DN-NSGA-II enhances the capability of solving MMOPs and demonstrates superior performance compared to other evolutionary algorithms on MMF and MMMOP benchmark functions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：