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

Toward AI-Powered Edge Intelligence for Object Detection in Self-Driving Cars: Enhancing IoV Efficiency and Safety

IEEE Internet of Things Journal 2025年第11期12卷 16990-16997页

作者： Imran Ahmed Misbah Ahmad Muftooh Ur Rehman Siddiqi Abdellah Chehri Gwangill Jeon School of Computing and Information Science Anglia Ruskin University Cambridge U.K. Centre for Machine Vision Bristol Robotics Laboratory University of the West of England Bristol U.K. Department of Animal and Agriculture Hartpury University Gloucester U.K. College of Engineering and Physical Sciences Aston University Birmingham U.K. Department of Mathematics and Computer Science Royal Military College of Canada Kingston ON Canada Department of Embedded Systems Engineering Incheon National University Incheon South Korea

In the rapidly advancing field of intelligent transportation systems, integrating artificial intelligence (AI) with edge computing presents a promising way to enhance the safety and efficiency of the Internet of Vehicles (IoV). This study explores and presents a deep learning-based object detection model within an edge computing framework which aims to facilitate real time object detection in self driving cars. Using an urban traffic scenarios-based dataset, our research shows the ability of the model to accurately detect and classify various objects important for autonomous driving. The YOLOv8 model is used in this work due to its optimal balance between accuracy and computational efficiency. This model has also demonstrated its worth by achieving good performance results, including an average precision of 0.79, a recall of 0.62, and an F1-score of 0.69. The results are demonstrated by a detailed confusion matrix, highlighting the model’s effectiveness in complex driving environments and underscoring its reliability for in-vehicle deployment. By implementing AI directly on edge devices within vehicles, our approach might be helpful in significantly reducing latency, boosting decision-making speed, and enhancing data privacy by minimising dependence on cloud processing. The findings not only support the model’s capabilities but also illustrate the practical benefits of edge intelligence in autonomous vehicles. These benefits, such as faster decision making and improved data privacy, contribute effectively to the IoV infrastructure. This study marks a substantial step toward recognizing the possibility of AI-enhanced edge computing in driving the next generation of autonomous vehicle technology.

关键词： Computational modeling Object detection Edge computing Image edge detection Artificial intelligence computer architecture Data models Accuracy Servers Safety

来源：评论

学校读者我要写书评

暂无评论

Diff9D: Diffusion-Based Domain-Generalized Category-Level 9-DoF Object Pose Estimation

arXiv

引用

arXiv 2025年

作者： Liu, Jian Sun, Wei Yang, Hui Deng, Pengchao Liu, Chongpei Sebe, Nicu Rahmani, Hossein Mian, Ajmal National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering School of Robotics State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Hunan University Changsha410082 China Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Xi’an710049 China Department of Information Engineering and Computer Science University of Trento Trento38123 Italy School of Computing and Communications Lancaster University LA1 4YW United Kingdom Department of Computer Science The University of Western Australia WA6009 Australia

Nine-degrees-of-freedom (9-DoF) object pose and size estimation is crucial for enabling augmented reality and robotic manipulation. Category-level methods have received extensive research attention due to their potential for generalization to intra-class unknown objects. However, these methods require manual collection and labeling of large-scale real-world training data. To address this problem, we introduce a diffusion-based paradigm for domain-generalized category-level 9-DoF object pose estimation. Our motivation is to leverage the latent generalization ability of the diffusion model to address the domain generalization challenge in object pose estimation. This entails training the model exclusively on rendered synthetic data to achieve generalization to real-world scenes. We propose an effective diffusion model to redefine 9-DoF object pose estimation from a generative perspective. Our model does not require any 3D shape priors during training or inference. By employing the Denoising Diffusion Implicit Model, we demonstrate that the reverse diffusion process can be executed in as few as 3 steps, achieving near real-time performance. Finally, we design a robotic grasping system comprising both hardware and software components. Through comprehensive experiments on two benchmark datasets and the real-world robotic system, we show that our method achieves state-of-the-art domain generalization performance. Our code will be made public at https://***/CNJianLiu/Diff9D. Copyright © 2025, The Authors. All rights reserved.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Reservoir computing with state-dependent time delay

引用

Physical Review E 2025年第3期111卷 035313-035313页

作者： G. O. Danilenko A. V. Kovalev D. S. Citrin A. Locquet D. Rontani E. A. Viktorov Institute of Advanced Data Transfer Systems ITMO University Birzhevaya Liniya 14 199034 Saint Petersburg Russia Georgia Tech-CNRS IRL 2958 Georgia Tech-Europe 2 Rue Marconi 57070 Metz France School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta Georgia 30332-0250 USA Chair in Photonics LMOPS UR 4423 Laboratory CentraleSupélec & Université de Lorraine 57070 Metz France

We examine a new design of reservoir computing based on an otherwise linear dynamical system subject to feedback in which a delay time linearly depends on the system's state. Despite the apparent linearity of the system under casual perusal, the system nonetheless possesses a nonlinearity that can be used for time-delay reservoir computing. We find that close multiple Hopf bifurcation points lead to a rich sawtooth-shaped transient response to input signals, which can be beneficial for computing capabilities. We benchmark the reservoir computing system's memory capacity and performance on solving delayed XOR, Iris flower classification tasks, and the Santa Fe time-series prediction task. We demonstrate how the nonlinearity and the memory capacity of the system can be tuned by changing the time-delay dependence.

关键词： Response time (computer systems)

来源：评论

学校读者我要写书评

暂无评论

Sensing With Random Communication Signals

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Business Process Remaining Time Prediction Based on Incremental Event Logs

引用

IEEE Transactions on Services computing 2025年

作者： Guo, Na Liu, Cong Mo, Qi Cao, Jian Ouyang, Chun Lu, Xixi Zeng, Qingtian Shandong University of Technology School of Electrical and Electronic Engineering Zibo255000 China Nova University of Lisbon NOVA Information Management School Lisbon1070-312 Portugal Shandong University of Technology School of Computer Science and Technology Zibo255000 China Yunnan University School of Software Kunming650091 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200030 China Queensland University of Technology School of Information Systems BrisbaneQLD4000 Australia Utrecht University Department of Information and Computing Sciences CS Utrecht3584 Netherlands Shandong University of Science and Technology College of Computer Science and Engineering Qingdao266590 China

Predictive Process Monitoring (PPM) aims to predict the future state of running process instances to enable timely interventions to mitigate potential risks. As one of the most fundamental tasks in PPM, process remaining time prediction focuses on preventing timeout occurrences. While various deep learning-based approaches have been developed for this purpose, they often rely on pre-established static prediction models and struggle to maintain accurate predictions when the process undergoes dynamic changes, such as an expanding sales channels. To tackle this challenge, this paper proposes an incremental process remaining time prediction framework by continuously updating the prediction model based on an incremental event log. Specifically, a feature selection strategy is first introduced to extract effective features from event logs. Leveraging effective features can significantly improve the prediction quality by capturing the changes in process information. Then, three incremental log-based updating mechanisms, including period-based updating, quantity-based updating, and concept-drift-based updating, along with a reconstruction strategy, are proposed to dynamically adjust the prediction model in response to business changes. Finally, LSTM, Transformer, and Auto-encoder models are adapted and integrated into the proposed framework. The approach has been implemented and publicly released. Experimental evaluation using nine real-life event logs demonstrate that the proposed framework and its three instantiations (i.e., LSTM-based, Transformer-based, and Auto-encoder-based ones) outperform state-of-the-art techniques in terms of prediction accuracy. © 2008-2012 IEEE.

关键词： incremental event log Predictive process monitoring process mining remaining time prediction

来源：评论

学校读者我要写书评

暂无评论

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

arXiv

引用

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Hybrid phase-locked loop with fast locking time and low spur in a 0.18-μm CMOS process

引用

Chinese Physics B 2014年第7期23卷 748-753页

作者：朱思衡司黎明郭超史君宇朱卫仁 Beijing Key Laboratory of Millimeter Wave and Terahertz Technology Department of Electronic Engineering School of Information and ElectronicsBeijing Institute of Technology Advanced Computing and Simulation Laboratory (AχL) Department of Electrical and Computer Systems EngineeringMonash University

We propose a novel hybrid phase-locked loop （PLL） architecture for overcoming the trade-off between fast locking time and low spur. To reduce the settling time and meanwhile suppress the reference spurs, we employ a wide-band single-path PLL and a narrow-band dual-path PLL in a transient state and a steady state, respectively, by changing the loop bandwidth according to the gain of voltage controlled oscillator （VCO） and the resister of the loop filter. The hybrid PLL is implemented in a 0.18-μm complementary metal oxide semiconductor （CMOS） process with a total die area of 1.4×0.46 mm2. The measured results exhibit a reference spur level of lower than -73 dB with a reference frequency of 10 MHz and a settling time of 20 μs with 40 MHz frequency jump at 2 GHz. The total power consumption of the hybrid PLL is less than 27 mW with a supply voltage of 1.8 V.

关键词： phase-locked loop （PLL） fast locking time low spur complementary metal oxide semiconductor（CMOS）

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

arXiv

引用

arXiv 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan The Beijing Key Laboratory of Network System Architecture and Convergence The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing China Singapore The Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States The College of Information Science and Electronic Engineering Zhejiang University Zhejiang Hangzhou310027 China The Department of Computer Science North Carolina State University RaleighNC27695 United States The Beijing Key Laboratory of Network System Architecture and Convergence China The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025, CC BY-NC-SA.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Consensus Control for Discrete-Time Stochastic Multiagent systems Under a Multiple Description Coding Mechanism

引用

IEEE systems Journal 2025年

作者： Wang, Licheng Wang, Zidong Qian, Wei Du, Shuxin Shanghai University of Electric Power College of Automation Engineering Shanghai 200090 China Brunel University London Department of Computer Science Uxbridge UB8 3PH United Kingdom Henan Polytechnic University School of Electrical Engineering and Automation Jiaozuo 454000 China Huzhou University Huzhou Key Laboratory of Intelligent Sensing and Optimal Control for Industrial Systems School of Engineering Huzhou 313000 China

This article addresses the consensus control problem for a specific class of discrete-time stochastic multiagent systems (MASs). When transmitting the local measurement output to the local controller and neighboring agents, a multiple description coding (MDC) scheme is introduced to reduce the communication burden and enhance data transmission reliability in a resource-constrained environment. The MDC scheme encodes each signal into two descriptions, which are then transmitted through separate channels, and decoding schemes are employed to address the different characteristics of the arrival of the two descriptions, ensuring the boundedness of the decoding error. The proposed consensus control scheme uses the relative decoded measurement errors between local agents and their neighbors. The aim is to design an output-feedback control scheme that ensures the error dynamics of the controlled MAS reach exponentially mean-square boundedness. Sufficient conditions are established for the existence of the controllers through stochastic analysis techniques, and the desired controller gains are parameterized using the feasibility of certain matrix inequalities. The effectiveness of the proposed coding-decoding-based consensus control scheme is verified through a numerical simulation. © 2007-2012 IEEE.

关键词： Consensus control multiagent systems (MASs) multiple description coding (MDC) packet dropout stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：