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

Data-driven output regulation control for constrained linear systems

Science China(information Sciences) 2025年第3期68卷 338-353页

作者： Chaoyu XIA Yi DONG Chaoli WANG Shengyuan XU Shanghai Research Institute for Intelligent Autonomous Systems Tongji University College of Electronic and Information Engineering Shanghai Research Institute for Intelligent Autonomous SystemsTongji University Department of Control Science and Engineering School of Optical-Electrical and Computer EngineeringUniversity of Shanghai for Science and Technology Department of Automation Nanjing University of Science and Technology

This study introduces a data-driven approach for state and output feedback control addressing the constrained output regulation problem in unknown linear discrete-time systems. Our method ensures effective tracking performance while satisfying the state and input constraints, even when system matrices are not available. We first establish a sufficient condition necessary for the existence of a solution pair to the regulator equation and propose a data-based approach to obtain the feedforward and feedback control gains for state feedback control using linear programming. Furthermore, we design a refined Luenberger observer to accurately estimate the system state, while keeping the estimation error within a predefined set. By combining output regulation theory, we develop an output feedback control strategy. The stability of the closed-loop system is rigorously proved to be asymptotically stable by further leveraging the concept of λ-contractive sets.

关键词： output regulation constrained system data-driven.

来源：评论

学校读者我要写书评

暂无评论

Scheduling Bi-Objective Lot-Streaming Hybrid Flow Shops with Consistent Sublots via an Enhanced Artificial Bee Colony Algorithm

引用

Complex System Modeling and Simulation 2025年第1期5卷 46-67页

作者： Lu, Benxue Gao, Kaizhou Duan, Peiyong Slowik, Adam School of Computer Science Liaocheng University Liaocheng252000 China Macau Institute of Systems Engineering Macau University of Science and Technology Macau999078 China School of Information and Automation Engineering Qilu University of Technology Jinan250353 China Koszalin University of Technology Department of Electronics and Computer Science Koszalin75-453 Poland

This work addresses bi-objective hybrid flow shop scheduling problems considering consistent sublots (Bi-HFSP_CS). The objectives are to minimize the makespan and total energy consumption. First, the Bi-HFSP_CS is formalized, followed by the establishment of a mathematical model. Second, enhanced version of the artificial bee colony (ABC) algorithms is proposed for tackling the Bi-HFSP_CS. Then, fourteen local search operators are employed to search for better solutions. Two different O-learning tactics are developed to embed into the ABC algorithm to guide the selection of operators throughout the iteration process. Finally, the proposed tactics are assessed for their efficacy through a comparison of the ABC algorithm, its three variants, and three effective algorithms in resolving 95 instances of 35 different problems. The experimental results and analysis showcase that the enhanced ABC algorithm combined with O-learning (QABC1) demonstrates as the top performer for solving concerned problems. This study introduces a novel approach to solve the Bi-HFSP_CS and illustrates its efficacy and superior competitive strength, offering beneficial perspectives for exploration and research in relevant domains. © 2021 TUP.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimized Task Offloading for Dependent Applications in Collaborative Edge and Cloud Computing

引用

IEEE Internet of Things Journal 2025年第9期12卷 12975-12988页

作者： Yuan, Haitao Hu, Qinglong Wang, Shen Bi, Jing Buyya, Rajkumar Lu, Jinhu Yang, Jinhong Zhang, Jia Zhou, MengChu Beihang University School of Automation Science and Electrical Engineering Beijing100191 China City University of Hong Kong Department of Computer Science Kowloon Tong Hong Kong Beijing University of Technology School of Software Engineering Faculty of Information Technology Beijing100124 China Laboratory School of Computing and Information Systems MelbourneVIC3010 Australia CSSC Systems Engineering Research Institute Beijing100036 China Southern Methodist University Lyle School of Engineering Department of Computer Science DallasTX75205 United States New Jersey Institute of Technology Department of Electrical and Computer Engineering NewarkNJ07102 United States

A collaborative system that includes mobile devices (MDs), edge nodes (ENs), and the cloud is needed where ENs at the network edge can run offloaded tasks of MDs with limited resources and energy for timely processing for latency-sensitive applications. Unlike existing studies, we formulate a total cost minimization problem for the system for applications, which can be divided into several interdependent subtasks. Each subtask can be executed in MDs, ENs, and the cloud. This work formulates a mixed-integer nonlinear program to minimize the total system cost. To address it, a novel meta-heuristic optimization algorithm called Genetic Simulated-annealing-based Particle swarm optimization with Auto-Encoder (GSPAE) is proposed, which innovatively combines feature extraction of deep learning and global search of meta-heuristic optimization. Genetic operations provide diverse solutions, the Metropolis acceptance of annealing offers a robust global search, and autoencoders (AEs) extract distribution characteristics of particles toward high-quality regions for fast convergence. Thus, GSPAE optimizes the associations between ENs and MDs and the scheduling of subtasks among MDs, ENs, and the cloud. Experiments with large-scale Google cluster datasets show that compared to state-of-the-art benchmark methods, GSPAE reduces the total cost by at least 17% while strictly meeting limits of application latency, available energy, computing, and communication resources of ENs and MDs. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

DocHFormer: Document Image Dewarping via Harmonized Modeling of Hierarchical Priors 27th

DocHFormer: Document Image Dewarping via Harmonized Modelin...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhou, Xinyue Li, Guanting Jiang, Nanfeng Wang, Da-Han Zhang, Xu-Yao Zhu, ShunZhi School of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China Fujian Key Laboratory of Pattern Recognition and Image Understanding Xiamen361024 China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031781186

Document Image Dewarping (DID) task aims to address the issue of geometry distortion and improve image quality. In this paper, we propose a simple but effective method, named DocHFormer, that can take hierarchical priors features of images, including document image mask and coordinate positions, as additional information to realize accurate representation. To better exploit these fused information for dewarping, we take them into a harmonized space random shuffle operation, which can stochastically rearrange the pixels across spatial space and further use inverse operation to recover the original order. This way can adapt to allocate each feature pixel with equal probability and thus make full use of multi-type features. Furthermore, we introduce this mechanism into local self-attention to use linear complexity to input resolution and also design a new feed-forward network with structural modeling to boost representation. With the help of the above components, our proposed DocHFormer can achieve competitive performance with lower complexity and also outperform the existing state-of-the-art on several popular datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Dynamic Sparse Graph Learning Jointly With Projective Graph Embedding for Image Feature Extraction

引用

IEEE Sensors Journal 2025年第9期25卷 16455-16467页

作者： Hu, Liangchen Dai, Zhenlei Chen, Zhenghua Zhang, Wensheng Hu, Peng Du, Tongchun Luo, Yonglong Anhui Normal University School of Computer and Information Wuhu241002 China Anhui Provincial Key Laboratory of Industrial Intelligence Data Security Wuhu241002 China Fusionopolis 138632 Singapore Institute of Automation Chinese Academy of Sciences State Key Laboratory of Multimodel Artificial Intelligence Systems Beijing100190 China University of Chinese Academy of Sciences School of Artificial Intelligence Beijing100049 China

In the context of advancing industrial automation, sensor-generated image data often exhibit high dimensionality and complexity, presenting challenges for effective feature extraction. Especially when sensors are deployed in complex and dynamic environments, image data can be affected by various factors, leading to increased noise and thus impacting the performance of feature extraction. To tackle these issues, this article introduces a method combining dynamic sparse graph learning jointly with projective graph embedding for feature extraction from sensor images. Initially, sparse representation learning constructs similarity graphs among the data, pruning unnecessary connections to retain the most pertinent features. Then, projective graph embedding maps the image data into a lower dimensional space, achieving a more concise and discriminative feature representation. These two primary modules in our model form an optimized closed loop, achieving overall optimality. The integrated approach effectively reveals the local manifold structure within the data. Experimental results indicate significant performance enhancements compared to several state-of-the-art methods across multiple benchmark datasets. © 2001-2012 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Document Image Shadow Removal via Frequency information-Oriented Network 27th

Document Image Shadow Removal via Frequency Information-Ori...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Yang, Fan Zhou, Xinyue Jiang, Nanfeng Wang, Da-Han Zhang, Xu-Yao Li, Guantin Man, Wang Wu, Yun School of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China Fujian Key Laboratory of Pattern Recognition and Image Understanding Xiamen361024 China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031781186

Removing shadows from document images can significantly improve the Quality of Experience (QoE) and boost the performance of the downstream document analysis and recognition tasks. However, existing methods still have limited generalization ability on complex document images and are prone to disrupt the image details. To address this issue, we consider the different shadow types that impact the image content on different frequency sub-bands. This motivates us to exploit frequency-domain information and further design a Frequency information-oriented Deshadow Network (FID-Net). The proposed FID-Net mainly uses two elaborated modules, named Frequency Feature Extractor (FFE) and a Frequency Feature Refinement (FFR). FFE can generate low/high-frequency features through adaptively decomposing spectra of the shadow image. After that, FFR further refines both frequency features with mutual information operations. With the proposed key designs, extensive experimental results on the commonly used benchmarks demonstrate that the proposed method can learn discriminative shadows and achieve favorable performance against state-of-the-art approaches. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Learning Explicit Radical Representations for Zero-Shot Chinese Character Recognition 27th

Learning Explicit Radical Representations for Zero-Shot Chin...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Pan, Song-Liang Wang, Da-Han Jiang, Nanfeng Zhang, Xu-Yao Zhu, Shunzhi School of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China Fujian Key Laboratory of Pattern Recognition and Image Understanding Xiamen361024 China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation of Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9783031781186

Zero-shot Chinese character recognition (ZSCCR) aims to recognize unseen Chinese characters by learning the semantic knowledge of seen characters. Radical-based methods treat Chinese characters as combinations of radicals, recognizing characters by predicting the radicals in the images. Existing radical-based methods have a closed radical parsing process that cannot be intervened in mid-course, relying only on semantic labels for constraints. However, semantic embedding vectors are usually manually designed and lack alignment with visual features, making it extremely difficult for the model to learn and locate discriminative radical representations from visual features. This paper proposes a ZSCCR network called Learning Explicit Radical Representations (LERRNet). LERRNet introduces learnable attribute hint vectors to guide the model in locating discriminative radicals and learning explicit representations of images. Specifically, we introduce a Radical Relevance Enhanced Encoder (RREE) to enhance the correlation of local radicals by augmenting the relationships between grid regions in visual features. Guided by attribute hint vectors, LERRNet employs a Radical Representation Decoder (RRD) to locate the most relevant regions of each radical in the given image and learn explicit radical representations. Extensive experiments demonstrate that LERRNet outperforms state-of-the-art radical/stroke-based methods across three ZSCCR benchmarks. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Linear Convergent Distributed Nash Equilibrium Seeking With Compression

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 3316-3323页

作者： Chen, Xiaomeng Wu, Yuchi Yi, Xinlei Huang, Minyi Shi, Ling Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Shanghai University School of Mechatronic Engineering and Automation Shanghai200444 China College of Electronics and Information Engineering Tongji University Department of Control Science and Engineering Shanghai201804 China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Carleton University School of Mathematics and Statistics OttawaONK1S 5B6 Canada

information compression techniques are majorly employed to reduce communication cost over peer-to-peer links. In this article, we investigate distributed Nash equilibrium (NE) seeking problems in a class of noncooperative games over directed graphs with information compression. To improve communication efficiency, a compressed distributed NE seeking (C-DNES) algorithm is proposed to obtain an NE for games, where the differences between decision vectors and their estimates are compressed. The proposed algorithm is compatible with a general class of compressors, including both unbiased and biased compressors. Moreover, our approach only requires the adjacency matrix of the directed graph to be row-stochastic, in contrast to past works that relied on balancedness or specific global network parameters. It is shown that C-DNES not only inherits the advantages of conventional distributed NE algorithms, achieving linear convergence rate for games with restricted strongly monotone mappings, but also saves communication costs in terms of transmitted bits. Finally, numerical simulations illustrate the advantages of C-DNES in saving communication cost by an order of magnitude under different compressors. © 1963-2012 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Brain-Conditional Multimodal Synthesis: A Survey and Taxonomy

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1080-1099页

作者： Mai, Weijian Zhang, Jian Fang, Pengfei Zhang, Zhijun South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Southeast University School of Computer Science and Engineering Nanjing210096 China South China University of Technology Key Library of Autonomous Systems and Network Control Ministry of Education The School of Automation Science and Engineering Guangzhou510640 China Institute for Super Robotics Huangpu Guangzhou510555 China Nanchang University Jiangxi Thousand Talents Plan Nanchang330031 China Jishou University College of Computer Science and Engineering Jishou416000 China Guangdong Artificial Intelligence and Digital Economy Laboratory Pazhou Lab Guangzhou510335 China Shaanxi University of Technology Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Hanzhong723001 China Changsha Normal University School of Information Science and Engineering Changsha410100 China Guangdong University of Petrochemical Technology School of Automation Science and Engineering Institute of Artificial Intelligence and Automation Maoming525000 China

In the era of artificial intelligence generated content (AIGC), conditional multimodal synthesis technologies (e.g., text-to-image) are dynamically reshaping the natural content. Brain signals, serving as potential reflections of how the brain interprets external information, exhibit a distinctive one-to-many correspondence with various external modalities. This correspondence makes brain signals emerge as a promising guiding condition for multimodal synthesis (e.g., image, text, and audio), which is crucial for developing practical brain–computer interface systems and unraveling complex mechanisms underlying human perception. This survey comprehensively examines the emerging field of brain-conditional multimodal synthesis, termed AIGC-brain, to delineate the current landscape and future directions. To begin, related neuroimaging datasets and generative models are introduced as the foundation of AIGC-brain decoding and analysis. Next, we present a comprehensive taxonomy according to AIGC-brain methodologies, followed by task-specific representative work and implementation details to facilitate in-depth comparison and analysis. Quality assessments are then introduced for both qualitative and quantitative evaluation. Finally, this survey explores insights gained, outlining current challenges and prospects of AIGC-brain. As a pioneering survey, this article paves the way for future advances in AIGC-brain research. © 2020 IEEE.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

SANS: Spatial-Aware Neural Solver for Plane Geometry Problem 27th

SANS: Spatial-Aware Neural Solver for Plane Geometry Proble...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Lin, Zi-Hao Xiao, Shun-Xin Chen, Zi-Rong Li, Jian-Min Wang, Da-Han Zhang, Xu-Yao School of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China Fujian Key Laboratory of Pattern Recognition and Image Understanding Xiamen361024 China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation of Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9783031781186

Geometry problem solving (GPS) is an important research direction in artificial intelligence. Previous studies have demonstrated the effectiveness of neural solvers in GPS. However, they are deficiencies in accurately representing spatial relationships of geometric primitives within visually rich geometric diagrams. This paper presents a novel neural solver termed spatial-aware neural solver (SANS) that can perceive spatial relationships between geometric primitives. SANS includes two new modules: multimodal dual-branch spatial awareness pre-trained language module and point-primitive spatial-aware attention module. The pre-training module employs a dual-branch visual-textual point-matching strategy to align visual and textual points, and utilizes semantic structure pre-training to model global relationships. Additionally, the point-primitive spatial awareness attention module enhances the model’s ability to perceive spatial relationships between geometric primitives by accounting for the relative positions of points. Experiments show that SANS achieves 81.5 and 74.1 of accuracy on the Geometry3K and PGPS9K datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：