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

arXiv 2022年

作者： Ferrentino, Enrico Savino, Heitor J. Franchi, Antonio Chiacchio, Pasquale University of Salerno SA Fisciano84084 Italy Ambev Robotics Lab Anheuser-Busch InBev SP Jacareí12334-480 Brazil The Robotics and Mechatronics Laboratory Faculty of Electrical Engineering Mathematics & Computer Science University of Twente Enschede7522NH Netherlands The Department of Computer Control and Management Engineering Sapienza University of Rome Rome00185 Italy

Offline optimal planning of trajectories for redundant robots along prescribed task space paths is usually broken down into two consecutive processes: first, the task space path is inverted to obtain a joint space path, then, the latter is parametrized with a time law. If the two processes are separated, they cannot optimize the same objective function, ultimately providing sub-optimal results. In this paper, a unified approach is presented where dynamic programming is the underlying optimization technique. Its flexibility allows accommodating arbitrary constraints and objective functions, thus providing a generic framework for optimal planning of real systems. To demonstrate its applicability to a real world scenario, the framework is instantiated for time-optimality on Franka Emika's Panda robot. The well-known issues associated with the execution of non-smooth trajectories on a real controller are partially addressed at planning level, through the enforcement of constraints, and partially through post-processing of the optimal solution. The experiments show that the proposed framework is able to effectively exploit kinematic redundancy to optimize the performance index defined at planning level and generate feasible trajectories that can be executed on real hardware with satisfactory results. Note to Practitioners-The common planning algorithms which consolidated over the years for generating trajectories for non-redundant robots are not adequate to fully exploit the more advanced capabilities offered by redundant robots. This is especially true in performance-demanding tasks, as for robots employed on assembly lines in manufacturing industries, repeatedly performing the same activity. Once the assembly line engineer has defined the tool path in the task space, our planning algorithm unifies inverse kinematics and time parametrization so as to bring the manipulator at its physical limits to achieve specific efficiency goals, being execution time the most typical

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Enhancing Motor Imagery EEG Signal Classification with Simplified GoogLeNet

Enhancing Motor Imagery EEG Signal Classification with Simpl...

引用

International Winter Workshop on Brain-computer Interface (BCI)

作者： Lu Wang Junkongshuai Wang Bo Wen Wei Mu Lusheng Liu Jiaguan Han Lihua Zhang Jie Jia Xiaoyang Kang Shanghai Engineering Research Center of AI & Robotics MOE Frontiers Center for Brain Science State Key Laboratory of Medical NeurobiologyAcademy for Engineering & Technology Laboratory for Neural Interface and Brain Computer Interface Engineering Research Center of AI & Robotics Ministry of Education Institute of AI & Robotics Institute of Meta-MedicalFudan University Shanghai China Ji Hua Laboratory Guangdong Province Foshan China Yiwu Research Institute of Fudan University Chengbei Road Yiwu City Zhejiang China Department of Rehabilitation Medicine Huashan Hospital Fudan University Shanghai China Research Center for Intelligent Sensing Zhejiang Lab Hangzhou China

The brain-computer interface is a novel tool for interaction between the brain and external devices, and is an important tool at the forefront of international brain science research. Motor imagery does not require external stimulation and is one of the most widely used BCI paradigms, and is now widely used to address the treatment of neurological impairments such as paralysis, stroke, and acromegaly. Electrophysiological source imaging is a technique based on the observation of electromagnetic signals from the cerebral cortex, reflecting the electrophysiological activity of brain nerve cells on the scalp surface of the brain. The wavelet transform, on the other hand, is commonly used for the processing of non-smooth signals and aims to extract excellent signal features. This paper combines these two algorithms as feature extraction methods. In recent years, deep learning has been increasingly combined with MI-EEG-based BCI. GoogLeNet is one of the most classical convolutional neural networks and has made a splash in ImageNet image recognition. However, using GoogLeNet to train the BCI public dataset BCI IV IIa and dataset HGD has shown problems such as long training time, overfitting, and gradient disappearance. In response, this paper proposes an improved and streamlined version of GoogLeNet for training based on this dataset to achieve an overall improvement in accuracy, training time, number of parameters, and other indicators. It is useful for the realistic application of MI-based BCI systems.

关键词： Training Wavelet transforms Surface waves Scalp Pattern classification Electrophysiology Streaming media

来源：评论

学校读者我要写书评

暂无评论

Corrections to “Intelligent Traffic Data Transmission and Sharing Based on Optimal Gradient Adaptive Optimization Algorithm”

引用

IEEE Transactions on Intelligent Transportation Systems 2024年第3期25卷 3202-3204页

作者： Xing Li Haotian Zhang Yajing Shen Lina Hao Wanfeng Shang School of Electrical Engineering and Intelligentization Dongguan University of Technology Dongguan China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China College of Computer Science and Technology Jilin University Changchun China Department of Biomedical Engineering City University of Hong Kong Hong Kong China School of Mechanical and Engineering Northeastern University Shenyang China Guangdong Provincial Key Laboratory of Robotics and Intelligent System Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China

In [1] , inaccuracies in several critical equations along with their accompanying descriptions appear in the article. Furthermore, some references are missing, and certain analyses of experiments are flawed.

关键词： Adaptive systems Data communication Optimization Intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

LMS-Net: A Learned Mumford-Shah Network For Few-Shot Medical Image Segmentation

arXiv

引用

arXiv 2025年

作者： Zhang, Shengdong Jia, Fan Li, Xiang Zhang, Hao Shi, Jun Ma, Liyan Ying, Shihui Department of Mathematics School of Science Shanghai University Shanghai200444 China Institute University of Utah Salt Lake CityUT84102 United States School of Computer Science and Technology East China Normal University Shanghai China School of Communication and Information Engineering Shanghai University Shanghai200444 China School of Computer Engineering and Science Shanghai University Shanghai200444 China School of Mechatronic Engineering and Automation Shanghai Key Laboratory of Intelligent Manufacturing and Robotics Shanghai University Shanghai200444 China Shanghai Institute of Applied Mathematics and Mechanics The School of Mechanics and Engineering Science Shanghai University Shanghai200072 China

Few-shot semantic segmentation (FSS) methods have shown great promise in handling data-scarce scenarios, particularly in medical image segmentation tasks. However, most existing FSS architectures lack sufficient interpretability and fail to fully incorporate the underlying physical structures of semantic regions. To address these issues, in this paper, we propose a novel deep unfolding network, called the Learned Mumford-Shah Network (LMSNet), for the FSS task. Specifically, motivated by the effectiveness of pixel-to-prototype comparison in prototypical FSS methods and the capability of deep priors to model complex spatial structures, we leverage our learned Mumford-Shah model (LMS model) as a mathematical foundation to integrate these insights into a unified framework. By reformulating the LMS model into prototype update and mask update tasks, we propose an alternating optimization algorithm to solve it efficiently. Further, the iterative steps of this algorithm are unfolded into corresponding network modules, resulting in LMS-Net with clear interpretability. Comprehensive experiments on three publicly available medical segmentation datasets verify the effectiveness of our method, demonstrating superior accuracy and robustness in handling complex structures and adapting to challenging segmentation scenarios. These results highlight the potential of LMS-Net to advance FSS in medical imaging applications. Our code will be available at: https:// ***/SDZhang01/LMSNet Copyright © 2025, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Autonomous In-Plane Normal Positioning in Robotic Ultrasound Scanning

Autonomous In-Plane Normal Positioning in Robotic Ultrasound...

引用

IEEE International Conference on robotics and Biomimetics

作者： Yizhao Qian Yameng Zhang Max Q.-H. Meng Li Liu Department of Electronic Engineering The Chinese University of Hong Kong Hong Kong SAR China Shenzhen Key Laboratory of Robotics Perception and Intelligence Shenzhen China Department of Electronic and Electrica Engineering Southern University of Science and Technology Shenzhen China Emeritus in the Department of Electronic Engineering The Chinese University of Hong Kong Hong Kong SAR China Department of Electrical and Computer Engineering University of Alberta Canada Great Bay University and the Dongguan Great Bay Institute for Advanced Study Dongguan China

ISBN: (数字)9798331509644

ISBN: (纸本)9798331509651

Ultrasound examination is pivotal in the preoperative assessment of Proximal Humerus Fractures (PHF). To construct a 3D representation of the entire upper arm, it is critical to minimize the relative error between the probe's axis and the skin's normal to secure high-fidelity images. In this research, we introduce an autonomous robotic ultrasound scanning system that facilitates both scanning and 3D reconstruction. To achieve precise control and diminish in-plane motion errors between the probe and skin, we introduce a method for in-plane normal vector search predicated on column similarity. This technique affords high-precision and high-frequency in-plane ultrasound scanning. Experimental findings confirm that our automated system consistently aligns the probe with the skin's normal direction on human arms, thighs, and abdomens. The findings reveal that, relative to traditional algorithms, our method realizes an 84% increase in speed, with an average error below 4.12°. To corroborate the algorithm's efficacy in real-time scanning, we reconstructed the 3D volume of volunteers' upper arms.

关键词： Ultrasonic imaging Three-dimensional displays Thigh Robot sensing systems Skin Vectors Robustness Real-time systems Probes Surface treatment

来源：评论

学校读者我要写书评

暂无评论

Exploiting the Intrinsic Neighborhood Semantic Structure for Domain Adaptation in EEG-based Emotion Recognition

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Yi Wang, Ze Song, Yu Jia, Ziyu Wang, Boyu Jung, Tzyy-Ping Wan, Feng Macau University of Science and Technology Macao Centre for Mathematical Sciences Respiratory Disease AI Laboratory on Epidemic Intelligence and Medical Big Data Instrument Applications Faculty of Innovation Engineering 999078 China Tianjin University of Technology School of Electrical Engineering and Automation Tianjin Key Laboratory of New Energy Power Conversion Transmission and Intelligent Control Tianjin300384 China Chinese Academy of Sciences Beijing Key Laboratory of Brainnetome and Brain-Computer Interface and Brainnetome Center Institute of Automation Beijing100045 China Western University Department of Computer Science Brain Mind Institute LondonONN6A 3K7 Canada University of California at San Diego Swartz Center for Computational Neuroscience Institute for Neural Computation La Jolla CA92093 United States University of Macau Department of Electrical and Computer Engineering Faculty of Science and Technology China University of Macau Centre for Cognitive and Brain Sciences Centre for Artificial Intelligence and Robotics Institute of Collaborative Innovation 999078 China

Due to the inherent non-stationarity and individual differences present in electroencephalogram (EEG) signals, developing a generalizable model that performs well on new subjects is challenging in EEG-based emotion recognition. Most existing domain adaptation (DA) methods typically mitigate these discrepancies by aligning the marginal distributions of domain feature representations. However, when there is a significant difference in the class-conditional distribution between domain features and labels, the domain-invariant features learned by aligning marginal distributions may have limited discriminative ability for unlabeled target instances or even prove counterproductive. To address this issue, we propose a Neighborhood Semantic Aware Learning-based Dynamic Graph Attention Convolution (NSAL-DGAT) approach that learns target semantic information by considering the inter-domain semantic topological structure, thereby improving classifier adaptation for target instances. Specifically, the proposed NSAL framework is designed to capitalize on the insight that after domain feature alignment, some target samples and their neighboring source samples exhibit similar semantics. By leveraging the neighborhood topological structure, we extract and incorporate semantic target features to train a more transferable classifier. Besides, we implement an entropy weighting mechanism to emphasize representative target semantic information, encouraging target instances to prioritize high-confidence individuals within the source neighborhood. We have conducted extensive experiments on the public SEED dataset and our collected the Hearing-Impaired EEG Dataset (HIED). The experimental results underscore the efficacy of our proposed NSAL-DGAT approach, showcasing state-of-the-art accuracy in subject-dependent as well as subject-independent scenarios. The source code is available at https://***/YYingDL/NSAL-DGAT. © 2010-2012 IEEE.

关键词： Speech analysis

来源：评论

学校读者我要写书评

暂无评论

Explicit-Implicit Subgoal Planning for Long-Horizon Tasks With Sparse Rewards

引用

IEEE Transactions on Automation science and Engineering 2025年 22卷 16038-16049页

作者： Fangyuan Wang Anqing Duan Peng Zhou Shengzeng Huo Guodong Guo Chenguang Yang David Navarro-Alarcon Department of Mechanical Engineering The Hong Kong Polytechnic University Hung Hom Hong Kong Ningbo Institute of Digital Twin Eastern Institute of Technology (EIT) Ningbo China Robotics Department Mohamed Bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi United Arab Emirates School of Advanced Engineering Great Bay University Dongguan China Ningbo Institute of Digital Twin and Zhejiang Key Laboratory of Industrial Intelligence and Digital Twin Eastern Institute of Technology (EIT) Ningbo China Department of Computer Science University of Liverpool Liverpool U.K.

The challenges inherent in long-horizon tasks in robotics persist due to the typical inefficient exploration and sparse rewards in traditional reinforcement learning approaches. To address these challenges, we have developed a novel algorithm, termed hlexplicit-implicit subgoal planning (EISP), designed to tackle long-horizon tasks through a divide-and-conquer approach. We utilize two primary criteria, feasibility and optimality, to ensure the quality of the generated subgoals. EISP consists of three components: a hybrid subgoal generator, a hindsight sampler, and a value selector. The hybrid subgoal generator uses an explicit model to infer subgoals and an implicit model to predict the final goal, inspired by way of human thinking that infers subgoals by using the current state and final goal as well as reason about the final goal conditioned on the current state and given subgoals. Additionally, the hindsight sampler selects valid subgoals from an offline dataset to enhance the feasibility of the generated subgoals. While the value selector utilizes the value function in reinforcement learning to filter the optimal subgoals from subgoal candidates. To validate our method, we conduct four long-horizon tasks in both simulation and the real world. The obtained quantitative and qualitative data indicate that our approach achieves promising performance compared to other baseline methods. These experimental results can be seen on the website https://***/view/vaesi Note to Practitioners—This paper addresses the persistent challenges in executing long-horizon tasks in robotics, which are hindered by inefficient exploration and sparse rewards in traditional reinforcement learning methods. EISP overcomes these obstacles through the integration of a hybrid subgoal generator, a hindsight sampler, and a value selector, ensuring that the generated subgoals are both feasible and optimal, thereby facilitating the completion of the entire task by addressing each subgo

关键词： Robots Space exploration Planning Trajectory Training Imitation learning Predictive models Hybrid power systems Generators Digital twins

来源：评论

学校读者我要写书评

暂无评论

THE BLESSINGS OF MULTIPLE TREATMENTS AND OUTCOMES IN TREATMENT EFFECT ESTIMATION

arXiv

引用

arXiv 2023年

作者： Wu, Yong Liu, Mingzhou Yan, Jing Fu, Yanwei Wang, Shouyan Wang, Yizhou Sun, Xinwei Institute of Science and Technology for Brain-Inspired Intelligence Fudan University China Computer Science Department Peking University China School of Data Science Fudan University China Key Laboratory of Computational Neuroscience Brain-Inspired Intelligence China MOE Frontiers Center for Brain Science Fudan University China Zhangjiang Fudan International Innovation Center China Engineering Research Center of AI & Robotics Ministry of Education Fudan University China

Assessing causal effects in the presence of unobserved confounding is a challenging problem. Existing studies leveraged proxy variables or multiple treatments to adjust for the confounding bias. In particular, the latter approach attributes the impact on a single outcome to multiple treatments, allowing estimating latent variables for confounding control. Nevertheless, these methods primarily focus on a single outcome, whereas in many real-world scenarios, there is greater interest in studying the effects on multiple outcomes. Besides, these outcomes are often coupled with multiple treatments. Examples include the intensive care unit (ICU), where health providers evaluate the effectiveness of therapies on multiple health indicators. To accommodate these scenarios, we consider a new setting dubbed as multiple treatments and multiple outcomes. We then show that parallel studies of multiple outcomes involved in this setting can assist each other in causal identification, in the sense that we can exploit other treatments and outcomes as proxies for each treatment effect under study. We proceed with a causal discovery method that can effectively identify such proxies for causal estimation. The utility of our method is demonstrated in synthetic data and sepsis disease. Copyright © 2023, The Authors. All rights reserved.

关键词： Intensive care units

来源：评论

学校读者我要写书评

暂无评论

GRATIS: Deep Learning Graph Representation with Task-specific Topology and Multi-dimensional Edge Features

arXiv

引用

arXiv 2022年

作者： Song, Siyang Song, Yuxin Luo, Cheng Song, Zhiyuan Kuzucu, Selim Jia, Xi Guo, Zhijiang Xie, Weicheng Shen, Linlin Gunes, Hatice The Department of Computer Science and Technology University of Cambridge CambridgeCB3 0FT United Kingdom Baidu Inc Beijing100193 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China Department of Computer Engineering Middle East Technical University Ankara Turkey School of Computer Science University of Birmingham Birmingham United Kingdom

Graph is powerful for representing various types of real-world data. The topology (edges’ presence) and edges’ features of a graph decides the message passing mechanism among vertices within the graph. While most existing approaches only manually define a single-value edge to describe the connectivity or strength of association between a pair of vertices, task-specific and crucial relationship cues may be disregarded by such manually defined topology and single-value edge features. In this paper, we propose the first general graph representation learning framework (called GRATIS) which can generate a strong graph representation with a task-specific topology and task-specific multi-dimensional edge features from any arbitrary input (i.e., graph or non-graph data). To learn each edge’s presence and multi-dimensional feature, our framework takes both of the corresponding vertices pair and their global contextual information into consideration, enabling the generated graph representation to have a globally optimal message passing mechanism for different down-stream tasks. The principled investigation results achieved for various graph analysis tasks (e.g., graph classification, vertex classification, and link prediction) on 11 graph and non-graph datasets show that our GRATIS can not only largely enhance pre-defined graphs but also learns a strong graph representation for non-graph data, with clear performance improvements on all tasks. In particular, the learned topology and multi-dimensional edge features provide complementary task-related cues for graph analysis tasks. Our framework is effective, robust and flexible, and is a plug-and-play module that can be combined with different backbones and Graph Neural Networks (GNNs) to generate a task-specific graph representation from various graph and non-graph data. Our code is made publicly available at https://***/SSYSteve/Learning-Graph-Representation-with-Task-specific-Topology-and-Multi-dimensional-Edge-Feature

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Motion planning for a pair of tethered robots

arXiv

引用

arXiv 2021年

作者： Teshnizi, Reza H. Shell, Dylan A. Distributed AI and Robotics Laboratory Department of Computer Science and Engineering Texas A&M University College StationTX77843 United States

Considering an environment containing polygonal obstacles, we address the problem of planning motions for a pair of planar robots connected to one another via a cable of limited length. Much like prior problems with a single robot connected via a cable to a fixed base, straight line-of-sight visibility plays an important role. The present paper shows how the reduced visibility graph provides a natural discretization and captures the essential topological considerations very effectively for the two robot case as well. Unlike the single robot case, however, the bounded cable length introduces considerations around coordination (or equivalently, when viewed from the point of view of a centralized planner, relative timing) that complicates the matter. Indeed, the paper has to introduce a rather more involved formalization than prior single-robot work in order to establish the core theoretical result—a theorem permitting the problem to be cast as one of finding paths rather than trajectories. Once affirmed, the planning problem reduces to a straightforward graph search with an elegant representation of the connecting cable, demanding only a few extra ancillary checks that ensure sufficiency of cable to guarantee feasibility of the solution. We describe our implementation of A? search, and report experimental results. Lastly, we prescribe an optimal execution for the solutions provided by the algorithm. Copyright © 2021, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：