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

Surface-PMSM Sensorless Control Strategy Based on Reduced-Order Linear Kalman Filter Cooperating with Prediction Error Rolling Compensation

引用

IEEE Transactions on Power Electronics 2025年第8期40卷 10804-10815页

作者： Xu, Sang Shen, Anwen Tang, Qipeng Wang, Miaomiao Luo, Pan Luo, Xin Xu, Jinbang National Key Laboratory of Science and Technology on Multispectral Information Processing Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Wuhan430074 China Science and Technology on Reactor System Design Technology Laboratory Chengdu China

Kalman filter (KF) is increasingly attracted for sensorless control of surface permanent magnet synchronous motors (SPMSMs) due to its strong robustness against measurement and system noise. However, conventional method suffers from poor position and speed estimation accuracy under dynamic conditions, and high computational cost. In order to solve these problems, an enhanced sensorless control strategy based on reduced-order linear Kalman filter (RLKF) cooperating with prediction error rolling compensation is introduced in this paper. Differing from conventional method, a reduced-order linear state equation encompassing rotor position, speed and torque disturbance is constructed. Then, by obtaining the prediction error of system output using the motor current equation in the predictive reference frame, the optimal estimation of rotor position and speed in KF algorithm is achieved based on the reduced-order model. This not only simplifies the calculation process, but also enhances the position and speed estimation accuracy under dynamic conditions. Meanwhile, a prediction error rolling compensation algorithm is developed to minimize the estimation deviations caused by motor parameters variations. Additionally, the system's dynamic performance is further improved with an adopted speed controller based on torque disturbance feedforward and acceleration feedback. Finally, experimental results verify the effectiveness and feasibility of the proposed strategy.1 © 1986-2012 IEEE.

关键词： Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

From First-Order to Second-Order Rationality: Advancing Game Convergence with Dynamic Weighted Fictitious Play 21st

From First-Order to Second-Order Rationality: Advancing Gam...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Ju, Qi Hei, Falin Liu, Yuxuan Fang, Zhemei Luo, Yunfeng Huazhong University of Science and Technology Wuhan China National Key Laboratory of Science and Technology on Multispectral Information Processing Wuhan China

ISBN: (纸本)9789819601271

Constructing effective algorithms to converge to Nash Equilibrium (NE) is a important problem in algorithmic game theory. Prior research generally posits that the upper bound on the convergence rate for games is OT-1/2. This paper introduces a novel perspective, positing that the key to accelerating convergence in game theory is "rationality". Based on this concept, we propose a Dynamic Weighted Fictitious Play (DW-FP) algorithm. We demonstrate that this algorithm can converge to a NE and exhibits a convergence rate of O(T-1) in experimental evaluations. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-distilled Dual-Network with Pixel Screening Loss for Blind Image Deblurring 27th

Self-distilled Dual-Network with Pixel Screening Loss for ...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Li, Tianyi Tian, Ming Gao, Changxin Sang, Nong National Key Laboratory of Multispectral Information Intelligent Processing Technology School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9783031781247

In the field of image processing, blind image deblurring aims to restore sharp details in images blurred by an unknown convolution kernel. Recent advancements have shown that deep networks can act as effective image generative priors (DIP) for restoring clear images without requiring external datasets. However, the inherent non-uniqueness of solutions in blind image deblurring often leads DIP-based methods to converge on local optima, resulting in over- or under-deblurred images. To overcome this limitation, we propose a novel deblurring framework featuring dual image generators. These generators mutually constrain each other during training, guiding the model towards the optimal solution. Building on our network structure, we employ a self-ensemble and self-distillation strategy to guide network training, further enhancing performance. Additionally, we introduce a novel loss function based on a pixel screening method, which focuses on the important pixels. This loss enables the network to model the blur kernel more accurately and facilitates the restoration of image details. Our experiments demonstrate that our deblurring approach outperforms most existing methods both qualitatively and quantitatively. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

GPS: graph contrastive learning via multi-scale augmented views from adversarial pooling

引用

science China(information sciences) 2025年第1期68卷 145-158页

作者： Wei JU Yiyang GU Zhengyang MAO Ziyue QIAO Yifang QIN Xiao LUO Hui XIONG Ming ZHANG School of Computer Science National Key Laboratory for Multimedia Information ProcessingPeking University Artificial Intelligence Thrust The Hong Kong University of Science and Technology Department of Computer Science University of California

Self-supervised graph representation learning has recently shown considerable promise in a range of fields, including bioinformatics and social networks. A large number of graph contrastive learning approaches have shown promising performance for representation learning on graphs, which train models by maximizing agreement between original graphs and their augmented views(i.e., positive views). Unfortunately, these methods usually involve pre-defined augmentation strategies based on the knowledge of human experts. Moreover, these strategies may fail to generate challenging positive views to provide sufficient supervision signals. In this paper, we present a novel approach named graph pooling contrast(GPS) to address these *** by the fact that graph pooling can adaptively coarsen the graph with the removal of redundancy, we rethink graph pooling and leverage it to automatically generate multi-scale positive views with varying emphasis on providing challenging positives and preserving semantics, i.e., strongly-augmented view and weakly-augmented view. Then, we incorporate both views into a joint contrastive learning framework with similarity learning and consistency learning, where our pooling module is adversarially trained with respect to the encoder for adversarial robustness. Experiments on twelve datasets on both graph classification and transfer learning tasks verify the superiority of the proposed method over its counterparts.

关键词： graph representation learning graph neural networks graph contrastive learning graph augmentations graph pooling

来源：评论

学校读者我要写书评

暂无评论

Complementary Dual-Branch Network for Space-Time Video Super-Resolution 27th

Complementary Dual-Branch Network for Space-Time Video Supe...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Tian, Ming Li, Tianyi Luo, RongSheng Gao, Changxin Sang, Nong National Key Laboratory of Multispectral Information Intelligent Processing Technology School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783031781247

Space-time video super-resolution aims to simultaneously increase the space-time resolution of low-resolution and low frame-rate videos. Existing deep learning-based methods have made notable strides, predominantly achieving space-time video super-resolution through the relatively simple integration of modules for video super-resolution and video frame interpolation sub-tasks. However, these methods typically do not fully exploit the inherent relationships between the two sub-tasks. To address this limitation, we propose a Complementary Dual-Branch Network designed to better explore the interdependence of the two sub-tasks. Specifically, our dual-branch architecture facilitates mutual enhancement between video super-resolution and video frame interpolation sub-tasks within each branch and provides mutual guidance between the two branches. Additionally, we introduce a simple yet effective strategy for the rough estimation of optical flow, incorporating Flow-Guided Deformable Alignment into space-time video super-resolution to achieve precise motion estimation. In addition, we use an RNN-based Backward and Forward Recurrent module to ensure that all frames can utilize the information of the whole sequence. It is more efficient and memory saving compared to the currently popular bidirectional LSTM module. Experimental results on several datasets show that our method achieves superior accuracy and requires fewer parameters compared to state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Neighborhood Structure Consistency for Point Cloud Registration With Severe Outliers

引用

IEEE Sensors Journal 2025年第11期25卷 20209-20223页

作者： Ding, Junfeng An, Pei Xu, Yunbiao Ma, Jie Huazhong University of Science and Technology National Key Laboratory of Science and Technology on Multispectral Information Processing School of Artificial Intelligence and Automation Wuhan430074 China Huazhong University of Science and Technology School of Electronic Information and Communication Wuhan430074 China

Point cloud registration is a fundamental task in 3D sensor technology and computer vision, aiming to estimate the rigid pose between two point clouds and align them. Correspondence-based methods generate and verify hypothetical poses by sampling consistent correspondences. However, the presence of severe outliers in feature correspondences poses substantial challenges during the sampling process. It may result in misjudgment of inlier consistency relationships, leading to incorrect sampling and causing point cloud registration failure. In this paper, we introduce the Neighborhood Structure Consistency (NSC) metric to guide consensus excavation. It incorporates tighter global consistency constraints rather than local consistency, yielding a more distinct inlier cluster and significantly mitigating the impact of outliers. After that, we propose a Neighborhood Structure Consistency based-Graph guided Sampling Consensus (NSC-GSAC) algorithm, which performs the sampling process on a consistency graph based on the NSC metric. This graph provides a dense representation of connections among inlier correspondences, narrowing the search space and facilitating cleaner consensus subsets sampling, thus improving the registration robustness and efficiency. Additionally, to further improve efficiency, we introduce a Pruning Redundancy Hypothesis Selection (PRHS) strategy to prioritize highly promising representative hypothetical poses, thus accelerating the registration process. Extensive experiments on real-world indoor and outdoor datasets demonstrate that our method achieves superior registration accuracy and efficiency compared to state-of-the-art methods, including both traditional and learning-based methods. Furthermore, experimental results also indicate that our method exhibits more robust performance in the presence of severe outliers, outperforming all other methods. © 2001-2012 IEEE.

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

Multi-view User Preference Modeling for Personalized Text-to-Image Generation

引用

IEEE Transactions on Multimedia 2025年 27卷 3082-3091页

作者： Zhang, Huaiwen Wu, Tianci Wei, Yinwei Inner Mongolia University College of Computer Science China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Mongolian Information Processing Technology Hohhot010021 China Shandong University School of Software Jinan China

Personalized text-to-image generation aims to synthesize images tailored to individual user preferences. Existing methods primarily generate customized content using a few reference images, which often struggle to mine user preferences from historical records, and thus fail to synthesize truly personalized content. In addition, it is difficult to directly incorporate the extracted feature of user preferences into the feature space of the generation model, since there exists a considerable gap between them. In this paper, we propose a novel multi-view personalized text-to-image generation method based on the diffusion model, named MVP-Diffusion, which learns instance- and user-level preferences from historical records and integrates them into the generation model. For instance-level user preference modeling, we employ a chain-of-thought prompting strategy to deduce preference keywords and integrate them into input prompts with the aid of a large language model. For user-level preference modeling, we construct a learnable embedding for each user to capture more comprehensive preferences by analyzing their historical records. An adaptive user preference fusion module is proposed to inject user preferences into the generation model via a set of learnable parameters. Experimental results demonstrate that the proposed method significantly enhances the personalization of the generated images compared to the other personalized text-to-image generation methods. © 1999-2012 IEEE.

关键词： Adaptation models User preference Text to image Large language models Training Analytical models Image synthesis Feature extraction Diffusion models Symbols

来源：评论

学校读者我要写书评

暂无评论

Joint state-sharing and truncation BCJR for power-efficient coherent optical interconnections utilizing symbol-rate sampling DSP over a hollow-core fiber

引用

Optics Letters 2025年第10期50卷 3461-3464页

作者： Wang, Chenchen Li, Zhipei Dong, Ze Gao, Ran Song, Junyuan Mai, Tianle Guo, Dong Chang, Huan Pan, Xiaolong Zhu, Lei Xin, Xiangjun School of Information and Electronics Beijing Institute of Technology Beijing100081 China National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing100081 China School of Integrated Circuits Beijing University of Posts and Telecommunications Beijing100876 China

Power-efficient digital signal processing (DSP) architectures are indispensable for enabling the sustainable scalability of optical networks in next-generation data center interconnects (DCIs). This paper introduces a minimalist symbol-rate sampling (SRS) DSP framework for coherent optical systems, seamlessly integrated with a hollow-core fiber (HCF) to enable ultra-low-complexity signal processing. The core of this framework is the joint state-sharing and truncation Bahl–Cocke–Jelinek–Raviv (JSST-BCJR) algorithm, which enhances hardware efficiency by eliminating up to 91% of state-space computations, significantly reducing computational complexity while maintaining negligible performance degradation. Experimental validation confirms the feasibility of the proposed minimalist SRS-DSP framework through the successful transmission of a 100-Gbaud 16QAM signal over 20.6 km of HCF. This work underscores the viability of SRS-DSP in power-constrained DCIs and highlights the synergistic integration of low-complexity DSP and HCF, offering a pathway toward power-efficient, high-throughput optical networks. © 2025 Optica Publishing Group. All rights are reserved.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Label Semantic Dynamic Guidance Network for Remote Sensing Image Scene Classification

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Chai, Borui Zhao, Tianming Yang, Runou Zhang, Nan Tian, Tian Tian, Jinwen Huazhong University of Science and Technology National Key Laboratory of Multispectral Information Intelligent Processing Technology School of Artificial Intelligence and Automation Wuhan430074 China

The remote sensing image scene classification continues to face significant challenges due to high intraclass diversity and interclass similarity. Existing methods mainly use semantic associations between images to establish deep semantic associations between classes, ignoring the rich high-level semantic knowledge contained in the label text. This high-level information are especially valuable for distinguishing between confusing categories, as it enables the model to capture both similarity and distinctive features effectively. In this article, we introduce a novel approach that incorporates label semantic information and proposes a plug-and-play framework to guide classification model learning of intraclass and interclass relationships. Specifically, our framework includes a dynamic soft label module (DSLM), which uses textual semantics to facilitate classification model learning of interclass relationships via soft labels at the target level. In addition, we design a coarse-to-fine contrastive module (CFCM) to integrate textual semantics into contrastive learning, guiding the model in capturing intraclass and interclass relationships at the feature level. Our framework is compatible with both convolutional neural network (CNN)-based and vision transformer (ViT)-based classification architectures and is employed solely during training to minimize computational overhead. Experimental results on four datasets validate the effectiveness of our approach. © 2025 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Federated Stochastic Primal-Dual Learning for Internet of Vehicles

引用

IEEE Internet of Things Journal 2025年第11期12卷 17034-17050页

作者： Li, Yiwei Wang, Shuai Chang, Tsung-Hui Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China The Chinese University of Hong Kong Shenzhen School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

Federated learning (FL) has the potential to empower Internet-of-Vehicles (IoV) networks by enabling smart vehicles (SVs) to participate in the learning process under the orchestration of a vehicular service provider while keeping data locally. In this paper, we propose a novel federated stochastic primal-dual algorithm with differential privacy (FedSPD-DP) to ensure robust privacy protection for FL based IoV (FL-IoV) systems. The FedSPD-DP algorithm leverages multiple steps of local stochastic gradient descent (SGD) and partial client participation (PCP) to improve communication efficiency while incorporating differential privacy (DP) to ensure privacy protection. Our theoretical analysis explores the impact of these strategies on learning performance. Specifically, we demonstrate that the data sampling strategy and PCP enhance data privacy, while a larger number of local SGD steps may increase privacy leakage, revealing a non-trivial tradeoff between communication efficiency and privacy protection. Extensive experiments on real-world data validate the effectiveness of the proposed algorithm, showing superior performance compared to state-of-the-art FL algorithms, and confirming the analytical results and properties. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：