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

arXiv 2024年

作者： Feng, Yi Guo, Zizhan Chen, Qijun Fan, Rui The Department of Control Science & Engineering The College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Shanghai Institute of Intelligent Science and Technology The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China

Unsupervised monocular depth estimation frameworks have shown promising performance in autonomous driving. However, existing solutions primarily rely on a simple convolutional neural network for ego-motion recovery, which struggles to estimate precise camera poses in dynamic, complicated real-world scenarios. These inaccurately estimated camera poses can inevitably deteriorate the photometric reconstruction and mislead the depth estimation networks with wrong supervisory signals. In this article, we introduce SCIPaD, a novel approach that incorporates spatial clues for unsupervised depth-pose joint learning. Specifically, a confidence-aware feature flow estimator is proposed to acquire 2D feature positional translations and their associated confidence levels. Meanwhile, we introduce a positional clue aggregator, which integrates pseudo 3D point clouds from DepthNet and 2D feature flows into homogeneous positional representations. Finally, a hierarchical positional embedding injector is proposed to selectively inject spatial clues into semantic features for robust camera pose decoding. Extensive experiments and analyses demonstrate the superior performance of our model compared to other state-of-the-art methods. Remarkably, SCIPaD achieves a reduction of 22.2% in average translation error and 34.8% in average angular error for camera pose estimation task on the KITTI Odometry dataset. Our source code is available at https://***/SCIPaD. Copyright © 2024, The Authors. All rights reserved.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Development of an Adaptive Artifact Subspace Reconstruction Based on Hebbian/Anti-Hebbian Learning Networks for Enhancing BCI Performance

引用

IEEE Transactions on Neural Networks and Learning Systems 2024年第1期35卷 348-361页

作者： Tsai, Bo-Yu Diddi, Sandeep Vara Sankar Ko, Li-Wei Wang, Shuu-Jiun Chang, Chi-Yuan Jung, Tzyy-Ping Institute of Biomedical Engineering and the Brain Research Center National Yang Ming Chiao Tung University Hsinchu300 Taiwan Hsinchu300 Taiwan College of Biological Science and Technology National Yang Ming Chiao Tung University Hsinchu300 Taiwan Institute of Electrical and Control Engineering Institute of Biomedical Engineering Brain Research Center College of Electrical and Computer Engineering National Yang Ming Chiao Tung University Department of Electronics and Electrical Engineering Hsinchu300 Taiwan Kaohsiung Medical University Department of Biomedical Science and Environment Biology Drug Development and Value Creation Research Center Kaohsiung807 Taiwan Taipei Veterans General Hospital Taipei11217 Taiwan National Yang Ming Chiao Tung University Brain Research Center School of Medicine Taipei112 Taiwan University of California San Diego Swartz Center for Computational Neuroscience San DiegoCA92093 United States

Brain-computer interface (BCI) actively translates the brain signals into executable actions by establishing direct communication between the human brain and external devices. Recording brain activity through electroencephalography (EEG) is generally contaminated with both physiological and nonphysiological artifacts, which significantly hinders the BCI performance. Artifact subspace reconstruction (ASR) is a well-known statistical technique that automatically removes artifact components by determining the rejection threshold based on the initial reference EEG segment in multichannel EEG recordings. In real-world applications, the fixed threshold may limit the efficacy of the artifact correction, especially when the quality of the reference data is poor. This study proposes an adaptive online ASR technique by integrating the Hebbian/anti-Hebbian neural networks into the ASR algorithm, namely, principle subspace projection ASR (PSP-ASR) and principal subspace whitening ASR (PSW-ASR) that segmentwise self-organize the artifact subspace by updating the synaptic weights according to the Hebbian and anti-Hebbian learning rules. The effectiveness of the proposed algorithm is compared to the conventional ASR approaches on benchmark EEG dataset and three BCI frameworks, including steady-state visual evoked potential (SSVEP), rapid serial visual presentation (RSVP), and motor imagery (MI) by evaluating the root-mean-square error (RMSE), the signal-to-noise ratio (SNR), the Pearson correlation, and classification accuracy. The results demonstrated that the PSW-ASR algorithm effectively removed the EEG artifacts and retained the activity-specific brain signals compared to the PSP-ASR, standard ASR (Init-ASR), and moving-window ASR (MW-ASR) methods, thereby enhancing the SSVEP, RSVP, and MI BCI performances. Finally, our empirical results from the PSW-ASR algorithm suggested the choice of an aggressive cutoff range of c =1-10 for activity-specific BCI applications and a moderat

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A novel high-through cell micronucleus detection algorithm based on improved YOLOv5 4

A novel high-through cell micronucleus detection algorithm b...

引用

4th International Conference on Industrial IoT, Big Data and Supply Chain, IIoTBDSC 2023

作者： Wei, Weiyi Li, Jingyu Wu, Xiaoqin Zhang, Hangjian College of Computer Science and Engineering Northwest Normal University Lanzhou China Radiology Department Gansu Provincial Center for Disease Control and Prevention Lanzhou China Business School Northwest Normal University Lanzhou China

ISBN: (纸本)9798350341690

In response to the challenges associated with cell micronucleus image recognition, namely small target sizes, high class similarity, and limited sample data, A novel cell micronucleus detection algorithm named YOLOv5-ECA is proposed based on YOLOv5. The proposed algorithm gets hyper-accurate micronucleus identification through a series of improvements. To begin with, the anchor frame size is recalibrated based on a meticulously constructed dataset. This process serves to expedite convergence speed while bolstering accuracy. Subsequently, in C3 module, a coordinate attention (CA) is introduced, which enlarging the receptive field and enabling the model to allocate greater focus to crucial elements within processed images. Ultimately, a superficial detection layer is incorporated, thereby enhancing the precision of cell micronucleus identification through multi-scale detection. Comparative analysis with the original YOLOv5 which demonstrates a 2% increase in average precision, accuracy, and a 1.3% enhancement in recall for the YOLOv5-ECA algorithm based on experimental results. © 2023 IEEE.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements 63

A Multi-Player Potential Game Approach for Sensor Network Lo...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Xu, Gehui Chen, Guanpu Fidan, Baris Hong, Yiguang Qi, Hongsheng Parisini, Thomas Johansson, Karl H. Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden University of Waterloo Department of Mechanical and Mechatronics Engineering WaterlooONN2L 3G1 Canada Tongji University Department of Control Science and Engineering shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China University of Chinese Academy of Sciences School of Mathematical Sciences Beijing China Aalborg University Department of Electronic Systems Denmark Imperial College London Department of Electrical and Electronic Engineering LondonSW7 2AZ United Kingdom University of Trieste Department of Engineering and Architecture Italy

ISBN: (纸本)9798350316339

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multiplayer non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies. © 2024 IEEE.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Construction and optimization of a computational holographic lithography system 8

Construction and optimization of a computational holographic...

引用

8th International Conference on Speckle Metrology, Speckle 2023

作者： Chen, Rui Lin, Angyi You, Jianfeng Lin, Huixiang Zhao, Wenqing Zhang, Fucai School of Control and Computer Engineering North China Electric Power University Baoding071003 China The Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen518055 China Engineering Research Center of Intelligent Computing for Complex Energy Systems Ministry of Education North China Electric Power University China

ISBN: (数字)9781510674592

ISBN: (纸本)9781510674585

Traditional lithography techniques are currently facing challenges, including high costs and the susceptibility of mask plates to damage. This research aims to elucidate the feasibility and technical constraints of a novel diffraction lithography approach. This method can reduce the size and cost of lithography machines, break through existing technological barriers, and offer new possibilities for the future development of lithography machines. We have built a basic computational holographic lithography system utilizing a 405nm laser and validated the system using holograms obtained with both classical GS algorithm and a newly proposed method. With the GS holograms, patterns with 700nm features have been successfully exposed on the photoresist. With our new algorithms, multiple holograms for the same target pattern can be generated with different settings in the algorithm. Sequential exposure of those holograms resulted in continuous lines 500 nm wide with reduced speckle artifacts, which was about a 1.4-time improvement over the result from the GS algorithm. Future research will focus on optimizing and enhancing the experimental system and the hologram calculation methods to reduce the line widths further and improve the exposure pattern quality. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Holograms

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Robust Optimization Under Decision Dependent Uncertainty

引用

IEEE/CAA Journal of Automatica Sinica 2022年第7期9卷 1295-1306页

作者： Yunfan Zhang Feng Liu Yifan Su Yue Chen Zhaojian Wang João P.S.Catalão State Key Laboratory of Power System and Generation Equipment the Department of Electrical EngineeringTsinghua UniversityBeijing 100084China Department of Mechanical and Automation Engineering the Chinese University of Hong KongHong Kong SARChina Ministry of Education Key Laboratory of System Control and Information Processing the Department of AutomationShanghai Jiao Tong Universityand also with Shanghai Engineering Research Center of Intelligent Control and ManagementShanghai 200240China Faculty of Engineering of the University of Porto and Institute for Systems and Computer Engineering Technology and Science(INESC TEC)Porto 4200-465Portugal IEEE

In the conventional robust optimization(RO)context,the uncertainty is regarded as residing in a predetermined and fixed uncertainty *** many applications,however,uncertainties are affected by decisions,making the current RO framework *** paper investigates a class of two-stage RO problems that involve decision-dependent *** introduce a class of polyhedral uncertainty sets whose right-hand-side vector has a dependency on the here-and-now decisions and seek to derive the exact optimal wait-and-see decisions for the second-stage problem.A novel iterative algorithm based on the Benders dual decomposition is proposed where advanced optimality cuts and feasibility cuts are designed to incorporate the uncertainty-decision *** computational tractability,robust feasibility and optimality,and convergence performance of the proposed algorithm are guaranteed with theoretical *** motivating application examples that feature the decision-dependent uncertainties are ***,the proposed solution methodology is verified by conducting case studies on the pre-disaster highway investment problem.

关键词： Benders decomposition decision-dependent uncertainty endogenous uncertainty robust optimization(RO)

来源：评论

学校读者我要写书评

暂无评论

Continuous-Time Damping-Based Mirror Descent for a Class of Non-Convex Multi-Player Games with Coupling Constraints

Continuous-Time Damping-Based Mirror Descent for a Class of ...

引用

International Conference on control and Automation (ICCA)

作者： Guanpu Chen Kun Cao Karl Henrik Johansson Yiguang Hong Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Control Science and Engineering Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China

ISBN: (数字)9798350354409

ISBN: (纸本)9798350354416

We study the computation of the global generalized Nash equilibrium (GNE) for a class of non-convex multi-player games, where players' actions are subject to both local and coupling constraints. Due to the non-convex payoff functions, we employ canonical duality to reformulate the setting as a complementary problem. Under given conditions, we reveal the relation between the stationary point and the global GNE. According to the convex-concave properties within the complementary function, we propose a continuous-time mirror descent to compute GNE by generating functions in the Bregman divergence and the damping-based design. Then, we devise several Lyapunov functions to prove that the trajectory along the dynamics is bounded and convergent.

关键词： Couplings Damping Automation Games Nash equilibrium Trajectory Mirrors

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Predictive Display for Teleoperated Driving Using CARLA Simulator

Evaluation of Predictive Display for Teleoperated Driving Us...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Fatima Kashwani Bilal Hassan Peng-Yong Kong Majid Khonji Jorge Dias Center for Autonomous Robotic Systems (KUCARS) Abu Dhabi UAE Department of Electrical Engineering and Computer Science Khalifa University Abu Dhabi UAE

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

Before the world-wide deployment of autonomous vehicles, it is essential to implement intermediate solutions with partial autonomy. One such solution is the use of vehicle teleoperation, the act of controlling a vehicle from a distance. In real time applications of teleoperation, it is often pertinent to use augmented reality components within the teleoperator view, which are referred to as a predictive display. In this work, we evaluate our predictive display method, which is a guiding path based on the free space in the environment. The path is generated based on our Dual Transformer Network (DTNet), which uses both object detection and lane semantic segmentation to define the free space in the environment. While the model has previously performed well on image data, it is necessary to observe its accuracy in the presence of time delay and packet loss, to assess its performance in a real-time setting. Thus, in this work, we use CARLA simulator to compare the detected free space on the teleoperator side to the true free space on the vehicle side across different values of time delay and packet loss. Under optimal network conditions, our model yielded a remarkable 87.9% DSC score and 81.3% IoU score. Defining our minimum performance threshold as 80% DSC and 70% IoU, we conclude that our model can effectively mitigate the challenges of time delay below 100ms and packet loss below 1%, both of which represent substantial tolerances.

关键词： Space vehicles Teleoperators Visualization Accuracy Delay effects Packet loss Transformers Real-time systems Vehicle dynamics Usability

来源：评论

学校读者我要写书评

暂无评论

Finetuning Pre-trained Model with Limited Data for LiDAR-based 3D Object Detection by Bridging Domain Gaps

Finetuning Pre-trained Model with Limited Data for LiDAR-bas...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Jiyun Jang Mincheol Chang Jongwon Park Jinkyu Kim Department of Computer Science and Engineering Korea University Seoul Korea Hyundai Motor Company R&D Division Autonomous Driving Center

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

LiDAR-based 3D object detectors have been largely utilized in various applications, including autonomous vehicles or mobile robots. However, LiDAR-based detectors often fail to adapt well to target domains with different sensor configurations (e.g., types of sensors, spatial resolution, or FOVs) and location shifts. Collecting and annotating datasets in a new setup is commonly required to reduce such gaps, but it is often expensive and time-consuming. Recent studies suggest that pre-trained backbones can be learned in a self-supervised manner with large-scale unlabeled LiDAR frames. However, despite their expressive representations, they remain challenging to generalize well without substantial amounts of data from the target domain. Thus, we propose a novel method, called Domain Adaptive Distill-Tuning (DADT), to adapt a pretrained model with limited target data (≈100 LiDAR frames), retaining its representation power and preventing it from overfitting. Specifically, we use regularizers to align object-level and context-level representations between the pre-trained and finetuned models in a teacher-student architecture. Our experiments with driving benchmarks, i.e., Waymo Open dataset and KITTI, confirm that our method effectively finetunes a pre-trained model, achieving significant gains in accuracy.

关键词： Adaptation models Solid modeling Three-dimensional displays Laser radar Detectors Object detection Robot sensing systems Data models Spatial resolution Overfitting

来源：评论

学校读者我要写书评

暂无评论

Social Optimization in Noncooperative Games under Central Regulation

arXiv

引用

arXiv 2025年

作者： Du, Kaixin Meng, Min Li, Xiuxian Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai200092 China Department of Control Science and Engineering College of Electronics and Information Engineering The Shanghai Research Institute for Intelligent Autonomous Systems National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai China

This paper proposes a novel optimization problem building on noncooperative games under central regulation, which can be formulated as a bilevel structure. In the low-level, each player competes to minimize its own cost function that depends not only on the strategies of all players, but also on an intervention decision of the central regulator, while the central regulator located at the high-level attempts to achieve the social optimum, that is, to minimize the sum of cost functions of all players through an adjustable intervention decision. In this setting, under the intervention of the central regulator, the low-level players perform in a noncooperative game and aim to seek the Nash equilibrium, which indeed is related with the regulator’s decision. Meanwhile, the objective of the regulator is to choose a decision such that the social cost, i.e., the sum of cost functions of all players is minimum. This formulated bilevel social optimization problem is proven to be constrained, nonconvex and nonsmooth. To address this intricate problem, an inexact zeroth-order algorithm is developed by virtue of the smoothing techniques, allowing for the Nash equilibrium of the low-level game to be computed in an inexact manner. Levering the properties of smoothing techniques, it is rigorously shown that the devised algorithm achieves a sublinear convergence rate for computing a stationary point of a related optimization problem with a smoothed objective. Moreover, the sublinear convergence rate in the scenario where the exact equilibrium of the low-level game is available is also discussed. Finally, numerical simulations are conducted to demonstrate the efficiency of theoretical findings. Copyright © 2025, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：