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

Text2Earth: Unlocking Text-driven Remote Sensing Image Generation with a Global-Scale Dataset and a Foundation Model

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Chenyang Chen, Keyan Zhao, Rui Zou, Zhengxia Shi, Zhenwei The Department of Aerospace Intelligent Science and Technology School of Astronautics The State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing100191 China The Key Laboratory of Spacecraft Design Optimization and Dynamic Simulation Technologies Ministry of Education China Shanghai Artificial Intelligence Laboratory Shanghai200232 China Shen Yuan Honors College of Beihang University Beijing100191 China The Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

Recently, generative foundation models have significantly advanced large-scale text-driven natural image generation and have become a prominent research trend across various vertical domains. However, in the remote sensing field, there is still a lack of research on large-scale text-to-image (text2image) generation technology. Existing remote sensing image-text datasets are small in scale and confined to specific geographic areas and scene types. Besides, existing text2image methods have struggled to achieve global-scale, multi-resolution controllable, and unbounded image generation. To address these challenges, this paper presents two key contributions: the Git-10M dataset and the Text2Earth foundation model. Git-10M is a global-scale image-text dataset comprising 10.5 million image-text pairs, 5 times larger than the previous largest one. The dataset contains essential resolution information and covers a wide range of geographic scenes and contains essential geospatial metadata, significantly surpassing existing datasets in both size and diversity. Building on Git-10M, we propose Text2Earth, a 1.3 billion parameter generative foundation model based on the diffusion framework to model global-scale remote sensing scenes. Text2Earth integrates a resolution guidance mechanism, enabling users to specify image resolutions. A dynamic condition adaptation strategy is proposed for training and inference to improve image generation quality. Text2Earth not only excels in zero-shot text2image generation but also demonstrates robust generalization and flexibility across multiple tasks, including unbounded scene construction, image editing, and cross-modal image generation. This robust capability surpasses previous models restricted to the basic fixed size and limited scene types. On the previous text2image benchmark dataset, Text2Earth outperfoms previous models with a significant improvement of +26.23 FID and +20.95% Zero-shot Cls-OA metric. Our project page is https://chen-y

关键词： Optical remote sensing

Diff-Reg v2: Diffusion-Based Matching Matrix Estimation for Image Matching and 3D Registration

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wu, Qianliang Jiang, Haobo Ding, Yaqing Luo, Lei Xie, Jin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China School of Computer Science and Engineering Nanjing University of Science and Technology China Nanyang Technological University Singapore Visual Recognition Group Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Intelligence Science and Technology Nanjing University Suzhou China

Establishing reliable correspondences is crucial for all registration tasks, including 2D image registration, 3D point cloud registration, and 2D-3D image-to-point cloud registration. However, these tasks are often complicated by challenges such as scale inconsistencies, symmetry, and large deformations, which can lead to ambiguous matches. Previous feature-based and correspondence-based methods typically rely on geometric or semantic features to generate or polish initial potential correspondences. Some methods typically leverage specific geometric priors, such as topological preservation, to devise diverse and innovative strategies tailored to a given enhancement goal, which cannot be exhaustively enumerated. Additionally, many previous approaches rely on a single-step prediction head, which can struggle with local minima in complex matching scenarios. To address these challenges, we introduce an innovative paradigm that leverages a diffusion model in matrix space for robust matching matrix estimation. Our model treats correspondence estimation as a denoising diffusion process in the matching matrix space, gradually refining the intermediate matching matrix to the optimal one. Specifically, we apply the diffusion model in the doubly stochastic matrix space for 3D-3D and 2D-3D registration tasks. In the 2D image registration task, we deploy the diffusion model in a matrix sub-space, where dual-softmax projection regularization is applied. For all three registration tasks, we provide adaptive matching matrix embedding implementations tailored to the specific characteristics of each task while maintaining a consistent"match-to-warp" encoding pattern. Furthermore, we adopt a lightweight design for the denoising module. In inference, once points or image features are extracted and fixed, this module performs multi-step denoising predictions through reverse sampling. Evaluations on both 2D and 3D registration tasks demonstrate the effectiveness of our approach. Copyrigh

关键词： Stochastic systems

Dexterous Manipulation through Imitation Learning: A Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： An, Shan Meng, Ziyu Tang, Chao Zhou, Yuning Liu, Tengyu Ding, Fangqiang Zhang, Shufang Mu, Yao Song, Ran Zhang, Wei Hou, Zeng-Guang Zhang, Hong School of Electrical and Information Engineering Tianjin University Tianjin300072 China School of Control Science and Engineering Shandong University Jinan250061 China State Key Laboratory of General Artificial Intelligence Beijing100086 China Department of Mechanical and Process Engineering ETH Zurich Zurich8092 Switzerland Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen518055 China School of Informatics University of Edinburgh EH8 9AB United Kingdom Department of Computer Science University of Hong Kong 999077 Hong Kong State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China CASIA-MUST Joint Laboratory of Intelligence Science and Technology Institute of Systems Engineering Macau University of Science and Technology 999078 China

Dexterous manipulation, which refers to the ability of a robotic hand or multi-fingered end-effector to skillfully control, reorient, and manipulate objects through precise, coordinated finger movements and adaptive force modulation, enables complex interactions similar to human hand dexterity. With recent advances in robotics and machine learning, there is a growing demand for these systems to operate in complex and unstructured environments. Traditional model-based approaches struggle to generalize across tasks and object variations due to the high-dimensionality and complex contact dynamics of dexterous manipulation. Although model-free methods such as reinforcement learning (RL) show promise, they require extensive training, large-scale interaction data, and carefully designed rewards for stability and effectiveness. Imitation learning (IL) offers an alternative by allowing robots to acquire dexterous manipulation skills directly from expert demonstrations, capturing fine-grained coordination and contact dynamics while bypassing the need for explicit modeling and large-scale trial-and-error. This survey provides an overview of dexterous manipulation methods based on imitation learning (IL), details recent advances, and addresses key challenges in the field. Additionally, it explores potential research directions to enhance IL-driven dexterous manipulation. Our goal is to offer researchers and practitioners a comprehensive introduction to this rapidly evolving domain. Copyright © 2025, The Authors. All rights reserved.

关键词： Grippers

Sensing With Random Communication Signals

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lu, Shihang Liu, Fan Xiong, Yifeng Du, Zhen Cui, Yuanhao Li, Shuangyang Yuan, Weijie Yang, Jie Jin, Shi National Mobile Communications Research Laboratory Southeast University Nanjing210096 China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China School of Electronic and Information Engineering Nanjing University of Information Science and Technology Nanjing210044 China Faculty of Electrical Engineering and Computer Science Technical University of Berlin Berlin10587 Germany Southern University of Science and Technology Shenzhen518055 China Frontiers Science Center for Mobile Information Communication and Security and also The Key Laboratory of Measurement and Control of Complex Systems of Engineering Southeast University Nanjing211189 China

Communication-centric Integrated Sensing and Communication (ISAC) has been recognized as a promising methodology to implement wireless sensing functionality over existing network architectures, due to its cost-effectiveness and backward compatibility to legacy cellular systems. However, the inherent randomness of the communication signal may incur huge fluctuations in sensing capabilities, leading to unfavorable detection and estimation performance. To address this issue, we elaborate on random ISAC signal processing methods in this article, aiming at improving the sensing performance without unduly deteriorating the communication functionality. Specifically, we commence by discussing the fundamentals of sensing with random communication signals, including the performance metrics and optimal ranging waveforms. Building on these concepts, we then present a general framework for random ISAC signal transmission, followed by an in-depth exploration of time-domain pulse shaping, frequency-domain constellation shaping, and spatial-domain precoding methods. We provide a comprehensive overview of each of these topics, including models, results, and design guidelines. Finally, we conclude this article by identifying several promising research directions for random ISAC signal transmission. © 2025, CC BY-SA.

关键词： Signaling

Prox-DBRO-VR: A Unified Analysis on Byzantine-Resilient Decentralized Stochastic Composite Optimization With Variance Reduction and Nonasymptotic Convergence Rates

学校读者我要写书评

暂无评论

IEEE Transactions on systems, Man, and Cybernetics: systems 2025年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Guo, Xiaoyu Ran, Liang Huang, Tingwen Central South University School of Automation Hunan Changsha 410083 China City University of Hong Kong Department of Mechanical Engineering Hong Kong University of New South Wales School of Electrical Engineering and Telecommunications Sydney 2052 NSW Australia Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Chongqing 400715 China Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen 518055 China

Decentralized stochastic gradient algorithms efficiently solve large-scale finite-sum optimization problems when all agents in the network are reliable. However, most of these algorithms are not resilient to adverse conditions, such as malfunctioning agents, software bugs, and cyber attacks. This article aims to handle a class of general composite optimization problems over multiagent systems (MASs) in the presence of an unknown number of Byzantine agents. Building on a resilient aggregation mechanism and the proximal-gradient mapping method, a Byzantine-resilient decentralized stochastic proximal-gradient algorithmic framework is proposed, dubbed Prox-DBRO-VR, which achieves an optimization and control goal using only local computations and communications. To asymptotically reduce the noise variance arising from local gradient estimation and accelerate the convergence, we incorporate two localized variance-reduced (VR) techniques (SAGA and LSVRG) into Prox-DBRO-VR to design Prox-DBRO-SAGA and Prox-DBRO-LSVRG. By analyzing the contraction relationships among the gradient-learning error, resilient consensus condition, and convergence error in a unified theoretical framework, it is proved that both Prox-DBRO-SAGA and Prox-DBRO-LSVRG, with a well-designed constant (resp., decaying) step-size, converge linearly (resp., sublinearly) inside an error ball around the optimal solution to the original problem under standard assumptions. A tradeoff between convergence accuracy and Byzantine resilience in both linear and sublinear cases is also characterized. In numerical experiments, the effectiveness and practicability of the proposed algorithms are manifested via resolving a decentralized sparse machine learning problem under various Byzantine attacks. © 2013 IEEE.

关键词： Byzantine-resilient algorithms composite optimization decentralized stochastic optimization system security variance reduction

Denoising Reuse: Exploiting Inter-frame Motion Consistency for Efficient Video Generation

学校读者我要写书评

暂无评论

IEEE Transactions on Circuits and systems for Video Technology 2025年

作者： Wang, Chenyu Yan, Shuo Chen, Yixuan Wang, Xianwei Wang, Yujiang Dong, Mingzhi Yang, Xiaochen Li, Dongsheng Zhu, Rui Clifton, David A. Dick, Robert P. Lv, Qin Yang, Fan Lu, Tun Gu, Ning Shang, Li Fudan University School of Computer Science Shanghai China Fudan University Shanghai Key Laboratory of Data Science Shanghai China Shanghai Institute of Intelligent Electronics & Systems Shanghai China Oxford Suzhou Centre for Advanced Research Suzhou China University of Bath Bath United Kingdom University of Glasgow School of Mathematics and Statistics United Kingdom Microsoft Research Asia Shanghai China University of London Bayes Business School City United Kingdom University of Oxford Department of Engineering Science Oxford United Kingdom University of Michigan Department of Electrical Engineering and Computer Science College of Engineering Ann ArborMI United States University of Colorado Boulder BoulderCO United States

Denoising-based diffusion models have attained impressive image synthesis;however, their applications on videos can lead to unaffordable computational costs due to the per-frame denoising operations. In pursuit of efficient video generation, we present a Diffusion Reuse MOtion (Dr. Mo) network to accelerate the video-based denoising process. Our crucial observation is that the latent representations in early denoising steps between adjacent video frames exhibit high consistencies with motion clues. Inspired by the discovery, we propose to accelerate the video denoising process by incorporating lightweight, learnable motion features. Specifically, Dr. Mo will only compute all denoising steps for base frames. For a non-based frame, Dr. Mo will propagate the pre-computed based latents of a particular step with interframe motions to obtain a fast estimation of its coarse-grained latent representation, from which the denoising will continue to obtain more sensitive and fine-grained representations. On top of this, Dr. Mo employs a meta-network named Denoising Step Selector (DSS) to dynamically determine the step to perform motion-based propagations for each frame, ensuring the correct transformation of multi-granularity visual features. Extensive evaluations on video generation and editing tasks indicate that Dr. Mo delivers widely applicable acceleration for diffusion-based video generations while effectively retaining the visual quality and style. Video generation and visualization results can be found at https://***. © 1991-2012 IEEE.

关键词： HTTP

Reconfigurable control system design for fault diagnosis and accommodation.

学校读者我要写书评

暂无评论

International journal of neural systems 2002年第6期12卷 497-520页

作者： Ho, Liang-Wei Yen, Gary G Intelligent Systems and Control Laboratory School of Electrical and Computer Engineering Oklahoma State University United States

The growing demand in system reliability and survivability under failures has urged ever-increasing research effort on the development of fault diagnosis and accommodation. In this paper, the on-line fault tolerant control problem for dynamic systems under unanticipated failures is investigated from a realistic point of view without any specific assumption on the type of system dynamical structure or failure scenarios. The sufficient conditions for system on-line stability under catastrophic failures have been derived using the discrete-time Lyapunov stability theory. Based upon the existing control theory and the modern computational intelligence techniques, an on-line fault accommodation control strategy is proposed to deal with the desired trajectory-tracking problems for systems suffering from various unknown and unanticipated catastrophic component failures. Theoretical analysis indicates that the control problem of interest can be solved on-line without a complete realization of the unknown failure dynamics provided an on-line estimator satisfies certain conditions. Through the on-line estimator, effective control signals to accommodate the dynamic failures can be computed using only the partially available information of the faults. Several on-line simulation studies have been presented to demonstrate the effectiveness of the proposed strategy. To investigate the feasibility of using the developed technique for unanticipated fault accommodation in hardware under the real-time environment, an on-line fault tolerant control test bed has been constructed to validate the proposed technology. Both on-line simulations and the real-time experiment show encouraging results and promising futures of on-line real-time fault tolerant control based solely upon insufficient information of the system dynamics and the failure dynamics.

关键词： Fault tolerant control reconfigurable control fault diagnosis Lyapunov stability fault accommodation

Hierarchical genetic algorithm for near optimal feedforward neural network design.

学校读者我要写书评

暂无评论

International journal of neural systems 2002年第1期12卷 31-43页

作者： Yen, Gary Lu, Haiming Intelligent Systems and Control Laboratory School of Electrical and Computer Engineering Stillwater 74078 OK United States

In this paper, we propose a genetic algorithm based design procedure for a multi layer feed forward neural network. A hierarchical genetic algorithm is used to evolve both the neural networks topology and weighting parameters. Compared with traditional genetic algorithm based designs for neural networks, the hierarchical approach addresses several deficiencies, including a feasibility check highlighted in literature. A multi objective cost function is used herein to optimize the performance and topology of the evolved neural network simultaneously. In the prediction of Mackey Glass chaotic time series, the networks designed by the proposed approach prove to be competitive, or even superior, to traditional learning algorithms for the multi layer Perceptron networks and radial basis function networks. Based upon the chosen cost function, a linear weight combination decision making approach has been applied to derive an approximated Pareto optimal solution set. Therefore, designing a set of neural networks can be considered as solving a two objective optimization problem.

关键词：

Asynchronous Tag-based Physical-Layer Authentication in Wireless Communications

学校读者我要写书评

暂无评论

IEEE Transactions on Wireless Communications 2025年

作者： Tan, Haijun Xu, Yuntao Du, Jiewei Xie, Ning Li, Hongbin Peng Cheng Laboratory Control and Network Foundation Laboratory Frontier Research Center Shenzhen518107 China Shenzhen University State Key Laboratory of Radio Frequency Heterogeneous Integration The Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen518060 China Beijing Jiaotong University School of Electronic and Information Engineering Beijing100044 China National Innovation Center of High Speed Train Qingdao266111 China Stevens Institute of Technology Department of Electrical and Computer Engineering HobokenNJ07030 United States

Tag-based physical-layer authentication (PLA) has gained significant research interest due to its high security and low complexity compared to traditional upper-layer authentication mechanisms. However, conventional tag-based PLA schemes often require strict synchronization between the tag and the source message before transmission, which may limit their practicality and effectiveness. To address this limitation, we propose an asynchronous tag-based PLA scheme, where the tag and the source message are transmitted asynchronously with an intentional time delay introduced at the transmitter. The proposed scheme enhances both compatibility and security without compromising robustness. We provide a theoretical analysis of the proposed scheme, and derive closed-form expressions to characterize its performance. Furthermore, theoretical comparisons with existing methods yield insightful conclusions regarding the advantages of the proposed approach. The scheme is implemented and extensively evaluated through simulations, where the theoretical results exhibit strong agreement with the simulation outcomes, thereby validating its effectiveness. © 2025 IEEE.

关键词： asynchronous closed form intentional timing delay Physical-layer authentication tag-based