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

Decomposition method-based global Mittag-Leffler synchronization for fractional-order Clifford-valued neural networks with transmission delays and impulses

引用

Neural Networks 2025年 189卷 107564页

作者： Sriraman, R. Manoj, N. Pratap, Anbalagan Department of Mathematics College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur603203 India College of Mechatronics and Control Engineering Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

This study examines the global Mittag-Leffler synchronization (GMLS) problem for fractional-order Clifford-valued neural networks (FOCLVNNs) including transmission delays and impulses. Firstly, a novel kind of FOCLVNNs is developed that incorporates impulses and transmission delays, which can be useful for better understanding of Clifford-valued neural networks (CLVNNs) dynamics more precisely. Then, because of the non-commutative multiplication feature of the Clifford algebra, the systems of FOCLVNNs can be decomposed into multi-dimensions real-valued neural networks (RVNNs), that avoid the difficulties associated with Clifford number multiplication. By using Lyapunov functions and inequality techniques, several novel solid conditions for the GMLS of FOCLVNNs under the state feedback controller that has been formulated. In addition, this paper presents novel results that are easy to solve and new insights into GMLS of FOCLVNNs. Then, a numerical verification is given along with graphical analysis to validate the applicability of the obtained theories. Based on the considered master–slave FOCLVNNs, an image encryption algorithm for color images is provided. In addition, simulation and performance analysis are stated to prove the validity of the given algorithms. © 2025 Elsevier Ltd

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

Distill & Contrast: A New Graph Self-Supervised Method With Approximating Nature Data Relationships

引用

IEEE Transactions on Knowledge and Data engineering 2025年第6期37卷 3284-3297页

作者： He, Dongxiao Zhao, Jitao Guo, Rui Feng, Zhiyong Huo, Cuiying Jin, Di Pedrycz, Witold Zhang, Weixiong Tianjin University College of Intelligence and Computing Tianjin300350 China Department of Measurement and Control Systems Gliwice44-100 Poland University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Hong Kong Polytechnic University Department of Data Science and Ai Hong Kong

Contrastive Learning (CL) has emerged as a popular self-supervised representation learning paradigm that has been shown in many applications to perform similarly to traditional supervised learning methods. A key component of CL is mining the latent discriminative relationships between positive and negative samples and using them as self-supervised labels. We argue that this discriminative contrastive task is, in essence, similar to a classification task, and the "either positive or negative"hard label sampling strategies are arbitrary. To solve this problem, we explore ideas from data distillation, which considers probabilistic logit vectors as soft labels to transfer model knowledge. We attempt to abandon the classical hard sampling labels in CL and instead explore self-supervised soft labels. We adopt soft sampling labels that are extracted, without supervision, from the inherent relationships in data pairs to retain more information. We propose a new self-supervised graph learning method, Distill and Contrast (D&C), for learning representations that closely approximate natural data relationships. D&C extracts node similarities from the features and structures to derive soft sampling labels, which also eliminate noise in the data to increase robustness. Extensive experimental results on real-world datasets demonstrate the effectiveness of the proposed method. © 2025 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Toward Long Video Understanding via Fine-Detailed Video Story Generation

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第5期35卷 4592-4607页

作者： You, Zeng Wen, Zhiquan Chen, Yaofo Li, Xin Zeng, Runhao Wang, Yaowei Tan, Mingkui South China University of Technology School of Future Technology Guangzhou510006 China Peng Cheng Laboratory Shenzhen518066 China South China University of Technology School of Software Engineering Guangzhou510006 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Harbin Institute of Technology School of Computer Science and Technology Shenzhen518055 China

Long video understanding has become a critical task in computer vision, driving advancements across numerous applications from surveillance to content retrieval. Existing video understanding methods suffer from two challenges when dealing with long video understanding: intricate long-context relationship modeling and interference from redundancy. To tackle these challenges, we introduce Fine-Detailed Video Story generation (FDVS), which interprets long videos into detailed textual representations. Specifically, to achieve fine-grained modeling of long-temporal content, we propose a Bottom-up Video Interpretation Mechanism that progressively interprets video content from clips to video. To avoid interference from redundant information in videos, we introduce a Semantic Redundancy Reduction mechanism that removes redundancy at both the visual and textual levels. Our method transforms long videos into hierarchical textual representations that contain multi-granularity information of the video. With these representations, FDVS is applicable to various tasks without any fine-tuning. We evaluate the proposed method across eight datasets spanning three tasks. The performance demonstrates the effectiveness and versatility of our method. © 1991-2012 IEEE.

关键词： Video analysis

来源：评论

学校读者我要写书评

暂无评论

Business Process Representation Based on Graph Convolutional Network 1st

Business Process Representation Based on Graph Convolutiona...

引用

1st Conference on Blockchain and Web3.0 Technology Innovation and Application, BWTAC 2024

作者： Zeng, Qingtian Zhang, Lin Cao, Rui Guo, Wenyan Li, Chao College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao Shandong China School of Information and Control Engineering Qingdao University of Technology Qingdao China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China

ISBN: (纸本)9789819794119

The effective representation of business processes is a key problem of predictive monitoring based on deep learning networks. Most of the existing business process representation methods are unable to accurately reflect the characteristics and node information aggregation of events in the graph structure. Therefore, a business process representation method based on graph convolutional network is proposed. Firstly, the diagram structure is constructed based on the same prefix window event of the business process. Secondly, on the basis of the constructed graph structure data, the node vectorization representation based on graph convolutional network model is given, and the information is aggregated through the graph convolutional network. Then, the depth representation of nodes is applied to the downstream prediction task of the business process. Finally, five real datasets are used for experimental evaluation. The experimental results show that the proposed event log graph construction strategy and process representation method are effective in business process prediction. The source code of this work is available at https://***/LinZhang0/GCNp. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Incomplete Multi-view Clustering via Diffusion Contrastive Generation

arXiv

引用

arXiv 2025年

作者： Zhang, Yuanyang Lin, Yijie Yan, Weiqing Yao, Li Wan, Xinhang Li, Guangyuan Zhang, Chao Ke, Guanzhou Xu, Jie School of Computer Science and Engineering Southeast University Nanjing210096 China College of Computer Science Sichuan University China School of Computer and Control Engineering Yantai University China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China College of Computer National University of Defense Technology China College of Computer Science and Technology Zhejiang University China Department of Control Science and Intelligence Engineering Nanjing University China School of Economics and Management Beijing Jiaotong University China School of Computer Science and Engineering University of Electronic Science and Technology of China China

Incomplete multi-view clustering (IMVC) has garnered increasing attention in recent years due to the common issue of missing data in multi-view datasets. The primary approach to address this challenge involves recovering the missing views before applying conventional multi-view clustering methods. Although imputation-based IMVC methods have achieved significant improvements, they still encounter notable limitations: 1) heavy reliance on paired data for training the data recovery module, which is impractical in real scenarios with high missing data rates;2) the generated data often lacks diversity and discriminability, resulting in suboptimal clustering results. To address these shortcomings, we propose a novel IMVC method called Diffusion Contrastive Generation (DCG). Motivated by the consistency between the diffusion and clustering processes, DCG learns the distribution characteristics to enhance clustering by applying forward diffusion and reverse denoising processes to intra-view data. By performing contrastive learning on a limited set of paired multi-view samples, DCG can align the generated views with the real views, facilitating accurate recovery of views across arbitrary missing view scenarios. Additionally, DCG integrates instance-level and category-level interactive learning to exploit the consistent and complementary information available in multi-view data, achieving robust and end-to-end clustering. Extensive experiments demonstrate that our method outperforms state-of-the-art approaches. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Hybrid Multi-Population Genetic Algorithm for Multi-UAV Task Assignment in Consumer Electronics Applications

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Bai, Xiaoshan Jiang, Haoyu Li, Chao Ullah, Inam Dabel, Maryam M. Al Bashir, Ali Kashif Wu, Zongze Sam, Shuzhi Shenzhen University College of Mechatronics and Control Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Shenzhen University Shenzhen City Joint Laboratory of Autonomous Unmanned Systems and Intelligent Manipulation Shenzhen518060 China Tashkent State University of Economics Department of Artificial Intelligence Tashkent100066 Uzbekistan University of Hafr Al Batin Department of Computer Science and Engineering College of Computer Science and Engineering Saudi Arabia Manchester Metropolitan University Manchester United Kingdom Shenzhen518060 China National University of Singapore Department of Electrical and Computer Engineering Singapore117576 Singapore

In recent years, as people’s living standards have improved and consumption concepts have been transformed, the demand for purchasing consumer electronics online has continued to grow, further stimulating the development of the logistics industry. Consequently, how to deliver consumer electronics to households at minimal cost has become a crucial factor that limits the development of the consumer technology industry. To tackle this problem, this paper studies the task assignment problem for multiple initially dispersed UAVs to deliver products to target locations while minimizing their total operation time. Each UAV can continuously provide delivery services to multiple target locations within its limited loading capacity and operation time. To solve this problem, we propose several hybrid multipopulation genetic algorithms. First, a novel crossover operator for the genetic algorithms is designed, through which a single parent chromosome can generate offspring individually. Second, two mutation mechanisms are performed to increase gene diversity. Third, multiple local search strategies are employed to enhance the populations’ fitness during each iteration of evolution. An improved 2-opt local search strategy is applied to optimize individual chromosomes when their similarity with the current best chromosome falls below a prescribed threshold. Alternatively, local search strategies are utilized for 1-opt, 2h-opt and interchange processes. Combining local search strategies, genetic operators, and the multi-population mechanism leads to several hybrid multi-population genetic algorithms. Numerical simulations and experimental tests demonstrate that the hybrid multi-population genetic algorithm, integrated with the improved 2-opt and 1-opt local search strategies, exhibits superior performance among the designed hybrid genetic algorithms, the minimum marginal cost algorithm (MMA), and the existing popular Co-evolutionary Multi-population Genetic Algorithm (CMGA). In exp

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

SIMSE: a contrastive learning method combining sample importance metric and semantic enhancement

引用

Expert Systems with Applications 2025年 286卷

作者： Gao, Yangyang Zheng, Zhi Huang, Wenjun Lin, Xiaomin College of Computer and Cyber Security Fujian Normal University Fuzhou350117 China College of Control Science and Engineering Zhejiang University Hangzhou310027 China State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou310027 China

In complex application scenarios, the lack of accurate labels for training samples has positioned contrastive learning a key focus in self-supervised learning. This approach effectively extracts meaningful representations from unlabeled data. A significant challenge lies in identifying high-value samples and exploring their semantic features to improve performance. Most existing self-supervised learning methods do not focus much on mining or augmenting valuable samples, relying mainly on contrastive learning between original samples. As a result, performance suffers in cases with limited or sparse data. To address this, we propose a contrastive learning method that combines sample importance measurement and semantic enhancement, overcoming the limitations of traditional methods that only use original samples. First, we generate additional valuable samples using interpolation and apply a similarity-based strategy to better distinguish positive and negative samples, refining the sample partitioning process. Second, we design a semantic enhancement mechanism to better capture and strengthen shared high-level semantic features between samples. Third, we introduce a new metric to evaluate sample value by measuring oscillations in the learning model caused by gradients, determining the importance of each sample. We also use confidence learning to identify and correct mislabeled samples. Extensive evaluations conduct on multiple benchmark datasets demonstrate that our method improves linear classification accuracy by 2.23 %, 4.3 %, 1.6 %, 3.73 %, and 4.69 % on ImageNet-100, ImageNet-10, CIFAR-10, CIFAR-100, and STL-10, respectively. Additionally, accelerates convergence speed by 1.5x and effectively detects mislabeled samples. © 2025 Elsevier Ltd

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Image Inversion: A Survey from GANs to Diffusion and Beyond

arXiv

引用

arXiv 2025年

作者： Chen, Yinan Zhang, Jiangning Bi, Yali Hu, Xiaobin Hu, Teng Xue, Zhucun Yi, Ran Liu, Yong Tai, Ying College of Control Science and Engineering Zhejiang University China YouTu Lab Tencent China College of Computer and Information Science Southwest University China Department of Computer Science & Engineering Shanghai Jiao Tong University China School of Intelligence Science and Technology Nanjing University China

Image inversion is a fundamental task in generative models, aiming to map images back to their latent representations to enable downstream applications such as editing, restoration, and style transfer. This paper provides a comprehensive review of the latest advancements in image inversion techniques, focusing on two main paradigms: Generative Adversarial Network (GAN) inversion and diffusion model inversion. We categorize these techniques based on their optimization methods. For GAN inversion, we systematically classify existing methods into encoder-based approaches, latent optimization approaches, and hybrid approaches, analyzing their theoretical foundations, technical innovations, and practical trade-offs. For diffusion model inversion, we explore training-free strategies, fine-tuning methods, and the design of additional trainable modules, highlighting their unique advantages and limitations. Additionally, we discuss several popular downstream applications and emerging applications beyond image tasks, identifying current challenges and future research directions. By synthesizing the latest developments, this paper aims to provide researchers and practitioners with a valuable reference resource, promoting further advancements in the field of image inversion. We keep track of the latest works at https://***/RyanChenYN/ImageInversion. Copyright © 2025, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Mixed-Integer Optimal control With Disjunctive Characteristic Time Constraints for Energy-Optimal Speed Planning

引用

IEEE Transactions on Transportation Electrification 2025年

作者： Dong, Shiying Chen, Hong Luo, Xi Meng, Xiangyu Huang, Yanjun Liu, Qifang Gao, Bingzhao Jilin University Department of Control Science and Engineering Changchun China Tongji University College of Automotive Studies Shanghai China Louisiana State University Division of Electrical and Computer Engineering Baton RougeLA70803 United States

This paper considers the energy optimization problem with multiple time window constraints, which is motivated by the eco-driving of connected and automated vehicles (CAVs) in urban traffic. Timely crossing of signalized intersections defines complex spatio-temporal constraints, and multiple available open time windows introduce the discontinuous feasible domains of crossing times. The CAVs should select an open time-window for each intersection, determine the crossing times, and optimize the speed profiles accordingly, which turns out to be a hard-to-solve optimization problem. To address this challenge, this paper proposes a unifying approach that transforms the energy optimization problem into a novel mixed-integer optimal control problem with characteristic time constraints (MIOCP-CT). This approach facilitates the simultaneous optimization of open time windows, crossing times, and speed profiles within a single optimization problem, which can be solved by our proposed novel numerical solution procedure. The application of the proposed method in the eco-driving of CAVs approaching multiple signalized intersections demonstrates its performance within real-world urban driving cycles. The experimental results of the hardware-in-the-loop (HiL) demonstrate a superior energy-saving performance of 5.83% compared to existing methods, while also achieving real-time feasibility within 100 milliseconds. © 2015 IEEE.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Pose-graph optimization for efficient tie-point matching and 3D scene reconstruction from oblique UAV images

引用

ISPRS Journal of Photogrammetry and Remote Sensing 2025年 225卷 461-491页

作者： Xu, Zhihua Niu, Yongze Jiang, Jincheng Qin, Rongjun Cui, Ximin College of Geoscience and Surveying Engineering China University of Mining and Technology-Beijing Beijing100083 China North Automatic Control Technology Institute Shanxi Taiyuan030006 China School of Intelligent Systems Engineering Sun Yat-sen University Guangdong Shenzhen518107 China Department of Civil Environmental and Geodetic Engineering The Ohio State University 2036 Neil Avenue ColumbusOH43210 United States Department of Electrical and Computer Engineering The Ohio State University Dreese Laboratories 205 2015 Neil Ave ColumbusOH43210 United States Translational Data Analytics Institute The Ohio State University 1760 Neil Ave ColumbusOH43210 United States

Oblique photogrammetry using unmanned aerial vehicles (UAV) is crucial to 3D scene reconstruction. Nevertheless, oblique images are generally acquired with large overlaps, and sometimes with multiple views. Although this increases the level of data completeness, it introduces additional and sometimes redundant computations in tie-point matching, creating overly dense camera connections in the pose graph for bundle adjustment (BA). This study optimizes the pose graph of oblique UAV images by removing redundant image connections to guide tie-point matching. Assuming a five-camera system for oblique image collection, a pose graph called a topologically connected camera network (TCN) was initially constructed using position and orientation system (POS) data to determine the spatial connectivity among oblique images. Second, five geometric meta-parameters of overlapping images were constructed, and their influence on tie-point matching was analyzed using a data-driven approach to generate a weighted pose graph. Third, the weighted pose graph was simplified to a degree-bounded skeletal camera network (D-SCN) using the proposed two-stage multi-objective graph optimization approach. Finally, the D-SCN was embedded into a structure from motion (SfM) pipeline to produce a novel D-SCN–SfM method to reduce the required computations for tie-point matching. The proposed D-SCN-SfM method was tested using data from three large sites, each containing over 5,000 images. In addition, the D-SCN-SfM method was compared with three state-of-the-art methods. The experimental results indicate that our method can significantly reduce the required computations for tie-point matching to 1/14–1/20 as compared to a method that uses only topological constraints, that is, TCN, saving 89–92% of the time expenditure. Furthermore, the accuracy and completeness of the 3D geometry produced by the proposed method were comparable to those produced by standard SfM methods. The source code of our approach

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：