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

IEEE International Conference on robotics and Biomimetics

作者： Leyuan Sun Guanqun Ding Yusuke Yoshiyasu Fumio Kanehiro Department of Intelligent and Mechanical Interaction Systems Graduate School of Science and Technology University of Tsukuba Tsukuba Ibaraki Japan CNRS-AIST Joint Robotics Laboratory (JRL) IRL National Institute of Advanced Industrial Science and Technology (AIST). Digital Architecture Research Center (DARC) National Institute of Advanced Industrial Science and Technology (AIST) Tokyo Japan Computer Vision Research Team Artificial Intelligence Research Center (AIRC) National Institute of Advanced Industrial Science and Technology (AIST) Japan

ISBN: (纸本)9781665481106

As a basic and indispensable module, LiDAR odom-etry estimation is widely used in robotics. In recent years, learning-based modeling approaches for odometry estimation have been validated to be feasible. However, it is necessary to consider security factors as the highest priorities when we apply the learning-based model to certain high-risk real-world scenarios, such as autonomous driving. The odometry uncertainty estimation provides more valuable information for downstream tasks, such as route planning and navigation. In this paper, we propose an end-to-end neural network (namely CertainOdom) to solve odometry and uncertainty estimation tasks by applying multi-task learning. Instead of using the manually-tuned hyper-parameters, we employ the learnable uncertainties to weigh the balance between the error of translation and orientation in the loss function. We evaluate the estimated trajectory and uncertainty on KITTI dataset. We also compare the robustness against the traditional geometry-based methods on our artificially degraded KITTI LiDAR dataset. Extensive experimental results show that our model with uncertainty weighted loss achieves competitive performance in LiDAR odometry estimation. We also explain our uncertainties qualitatively and quantitatively.

关键词： Uncertainty Laser radar Biological system modeling Estimation Multitasking Robustness Trajectory

来源：评论

学校读者我要写书评

暂无评论

Cubic boron arsenide: An emerging semiconductor with exceptional thermal conductivity and high carrier mobility

引用

Matter 2025年第5期8卷

作者： Yue, Shuai Tian, Fei Song, Bai Zhong, Yangguang Bao, Jiming Liu, Xinfeng CAS Key Laboratory of Standardization and Measurement for Nanotechnology National Center for Nanoscience and Technology Beijing100190 China School of Materials Science and Engineering Sun Yat-sen University Guangdong Guangzhou510006 China Department of Energy and Resources Engineering and Department of Advanced Manufacturing and Robotics Peking University Beijing100871 China Department of Electrical and Computer Engineering and Texas Center for Superconductivity University of Houston HoustonTX77204 United States University of Chinese Academy of Sciences Beijing100049 China College of Materials Science and Engineering Hunan University Hunan Changsha410082 China

Over the past decade, cubic boron arsenide (BAs) has emerged as a highly promising semiconductor owing to its extraordinary thermal conductivity (1,200 W/m·K) and high ambipolar mobility (1,600 cm2/V·s). This unique combination has spurred significant research interest in its potential for advanced device applications. However, the challenge of growing uniform, high-quality crystals has hindered its widespread adoption, limiting its realization in high-performance devices. To accelerate the development and utilization of BAs, we systematically review recent theoretical and experimental advancements, focusing on key aspects such as carrier mobility, carrier relaxation, and the impact of defects on thermal conductivity and carrier mobility. Additionally, we explore emerging applications, persistent challenges, and future research directions. By addressing these critical issues, we aim to inspire further research and facilitate the development of next-generation electronic and optoelectronic devices based on BAs. © 2025 Elsevier Inc.

关键词： Carrier mobility

来源：评论

学校读者我要写书评

暂无评论

A Distributed Framework for Deep Reinforcement Learning by Consensus

A Distributed Framework for Deep Reinforcement Learning by C...

引用

Chinese Control and Decision Conference, CCDC

作者： Bo Liu Shuang Zhu Peng Sun Qisheng Huang Zhengtao Ding Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China PowerChina Huadong Engineering Corporation Limited Hangzhou China College of Computer Science and Electronic Engineering Hunan University Changsha China School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Shenzhen China Department of Electrical and Electronic Engineering University of Manchester Manchester UK

This paper proposes a distributed training framework for deep reinforcement learning algorithms to address large-scale problems with privacy protection. First, we design a hierarchical decentralized communication topology with a server to alleviate the heavy burden on the central server. By pushing the model updating and data storage to the edge side, it not only unleashes the computing potential of the terminal devices but also shortens the response time. Second, the consensus algorithm is applied for all agents over the decentralized topology to approach each other, where each agent only requires neighboring information to achieve consensus. Then, the distributed training framework for deep Q-networks is designed based on the consensus algorithm, which consists of local learning and global consensus. Finally, the simulation demonstrates that the proposed distributed learning deep Q-networks shows better performance than its centralized learning counterpart.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PVPUFormer: Probabilistic Visual Prompt Unified Transformer for Interactive Image Segmentation

arXiv

引用

arXiv 2023年

作者： Zhang, Xu Yang, Kailun Lin, Jiacheng Yuan, Jin Li, Zhiyong Li, Shutao College of Computer Science and Electronic Engineering Hunan University Changsha410082 China School of Robotics The National Engineering Research Center of Robot Visual Perception and Control Technology Hunan University Changsha410082 China College of Electrical and Information Engineering The Key Laboratory of Visual Perception and Artificial Intelligence of Hunan Province Hunan University Changsha410082 China

Integration of diverse visual prompts like clicks, scribbles, and boxes in interactive image segmentation significantly facilitates users’ interaction as well as improves interaction efficiency. However, existing studies primarily encode the position or pixel regions of prompts without considering the contextual areas around them, resulting in insufficient prompt feedback, which is not conducive to performance acceleration. To tackle this problem, this paper proposes a simple yet effective Probabilistic Visual Prompt Unified Transformer (PVPUFormer) for interactive image segmentation, which allows users to flexibly input diverse visual prompts with the probabilistic prompt encoding and feature post-processing to excavate sufficient and robust prompt features for performance boosting. Specifically, we first propose a Probabilistic Prompt-unified Encoder (PPuE) to generate a unified one-dimensional vector by exploring both prompt and non-prompt contextual information, offering richer feedback cues to accelerate performance improvement. On this basis, we further present a Prompt-to-Pixel Contrastive (P2C) loss to accurately align both prompt and pixel features, bridging the representation gap between them to offer consistent feature representations for mask prediction. Moreover, our approach designs a Dual-cross Merging Attention (DMA) module to implement bidirectional feature interaction between image and prompt features, generating notable features for performance improvement. A comprehensive variety of experiments on several challenging datasets demonstrates that the proposed components achieve consistent improvements, yielding state-of-the-art interactive segmentation performance. Our code is available at https://***/XuZhang1211/PVPUFormer. Copyright © 2023, The Authors. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

SOFT GRIPPING: SPECIFYING FOR TRUSTWORTHINESS

arXiv

引用

arXiv 2023年

作者： Abeywickrama, Dhaminda B. Le, Nguyen Hao Chance, Greg Winter, Peter D. Manzini, Arianna Partridge, Alix J. Ives, Jonathan Downer, John Deacon, Graham Rossiter, Jonathan Eder, Kerstin Windsor, Shane Department of Computer Science University of Bristol United Kingdom Department of Engineering Mathematics University of Bristol United Kingdom School of Sociology University of Bristol United Kingdom Bristol Medical School University of Bristol United Kingdom Department of Mechanical Engineering University of Bristol United Kingdom Robotics Research Team Ocado Technology United Kingdom Department of Aerospace Engineering University of Bristol United Kingdom

Soft robotics is an emerging technology in which engineers create flexible devices for use in a variety of applications. In order to advance the wide adoption of soft robots, ensuring their trustworthiness is essential;if soft robots are not trusted, they will not be used to their full potential. In order to demonstrate trustworthiness, a specification needs to be formulated to define what is trustworthy. However, even for soft robotic grippers, which is one of the most mature areas in soft robotics, the soft robotics community has so far given very little attention to formulating specifications. In this work, we discuss the importance of developing specifications during development of soft robotic systems, and present an extensive example specification for a soft gripper for pick-and-place tasks for grocery items. The proposed specification covers both functional and non-functional requirements, such as reliability, safety, adaptability, predictability, ethics, and regulations. We also highlight the need to promote verifiability as a first-class objective in the design of a soft gripper. Copyright © 2023, The Authors. All rights reserved.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

SubZero: Subspace Zero-Shot MRI Reconstruction

arXiv

引用

arXiv 2023年

作者： Yu, Heng Arefeen, Yamin Bilgic, Berkin The Robotics Institute Carnegie Mellon University PittsburghPA United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA United States Athinoula A. Martinos Center for Biomedical Imaging Massachusetts General Hospital CharlestownMA United States Department of Radiology Harvard Medical School BostonMA United States

Recently introduced zero-shot self-supervised learning (ZS-SSL) has shown potential in accelerated MRI in a scan-specific scenario, which enabled high quality reconstructions without access to a large training dataset. ZS-SSL has been further combined with the subspace model to accelerate 2D T2-shuffling acquisitions. In this work, we propose a parallel network framework and introduce attention mechanism to improve subspace based zero-shot self-supervised learning and enable higher acceleration factors. We name our method SubZero and demonstrate that it can achieve improved performance compared with current methods in T1 and T2 mapping acquisitions. Copyright © 2023, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Few-shot learning based histopathological image classification of colorectal cancer

引用

Intelligent Medicine 2024年第4期4卷 256-267页

作者： Rui Li Xiaoyan Li Hongzan Sun Jinzhu Yang Md Rahaman Marcin Grzegozek Tao Jiang Xinyu Huang Chen Li Key Laboratory of Intelligent Computing in Medical Image Ministry of EducationNortheastern UniversityShenyangLiaoning 110167China Cancer Hospital China Medical UniversityShenyangLiaoning 110122China Shengjing Hospital China Medical UniversityShenyang.Liaoning 110000China Institute for Medical Informatics University of LuebeckGermany Department of Knowledge Engineering University of Economics in KatowicePoland School of Intelligent Medicine Chengdu University of Traditional Chinese MedicineChengduSichuan 610075China International Joint Institute of Robotics and Intelligent Systems Chengdu University of Information TechnologyChengduSichuan 610225China School of Computer Science and Engineering University of New South WalesSydneyNSW 2052Australia

Background Colorectal cancer is a prevalent and deadly disease worldwide,posing significant diagnostic *** histopathologic image classification is often inefficient and *** some histopathologists use computer-aided diagnosis to improve efficiency,these methods depend heavily on exten-sive data and specific annotations,limiting their *** address these challenges,this paper proposes a method based on few-shot *** This study introduced a few-shot learning approach that combines transfer learning and contrastive learning to classify colorectal cancer histopathology images into benign and malignant *** model comprises modules for feature extraction,dimensionality reduction,and classification,trained using a combi-nation of contrast loss and cross-entropy *** this paper,we detailed the setup of hyperparameters:n-way,κ-shot,β,and the creation of support,query,and test *** Our method achieved over 98% accuracy on a query dataset with 35 samples per category using only 10 training samples per *** documented the model’s loss,accuracy,and the confusion matrix of the ***,we employed the t-SNE algorithm to analyze and assess the model’s classification *** The proposed model may demonstrate significant advantages in accuracy and minimal data depen-dency,performing robustly across all tested n-way,κ-shot *** consistently achieved over 93% accuracy on comprehensive test datasets,including 1916 samples,confirming its high classification accuracy and strong generalization *** research could advance the use of few-shot learning in medical diagnostics and also lays the groundwork for extending it to deal with rare,difficult-to-diagnose cases.

关键词： Colorectal cancer Few-shot learning Transfer learning Contrastive learning Histopathological images Benign and malignant categories

来源：评论

学校读者我要写书评

暂无评论

Research and optimization of conflict search algorithm for multi-agent path planning based on incremental heuristic 2

Research and optimization of conflict search algorithm for m...

引用

2nd International Conference on computer Vision and Data Mining, ICVDM 2021

作者： Li, Yang Wang, Jun Zhang, Hualiang School of Computer Science Shenyang University of Chemical Technology Shenyang110142 China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang110016 China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China

Conflict Based Search(CBS) is used for multi-agent Pathfinding (MAPF) to enable each Agent to reach the target node. The CBS algorithm uses the heuristic algorithm A* search to calculate the MAPF solution, and the path planning uses forward search, which cannot explore the path of the unknown region. On this basis, this paper proposes that, in the case of unknown map and changing environment at any time, when encountering new obstacles, the information obtained from previous search should be used without completely replanning the path. Because of the idea of incremental programming, the number of reprogramming times and the number of affected nodes can be reduced. The optimized algorithm consumes less time and memory, and improves the efficiency of path planning. © 2021 Institute of Physics Publishing. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Is out-of-distribution detection learnable? 22

Is out-of-distribution detection learnable?

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Zhen Fang Yixuan Li Jie Lu Jiahua Dong Bo Han Feng Liu Australian Artificial Intelligence Institute University of Technology Sydney Department of Computer Sciences University of Wisconsin-Madison State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences and ETH Zurich Switzerland Department of Computer Science Hong Kong Baptist University Australian Artificial Intelligence Institute University of Technology Sydney and School of Mathematics and Statistics University of Melbourne

ISBN: (纸本)9781713871088

Supervised learning aims to train a classifier under the assumption that training and test data are from the same distribution. To ease the above assumption, researchers have studied a more realistic setting: out-of-distribution (OOD) detection, where test data may come from classes that are unknown during training (i.e., OOD data). Due to the unavailability and diversity of OOD data, good generalization ability is crucial for effective OOD detection algorithms. To study the generalization of OOD detection, in this paper, we investigate the probably approximately correct (PAC) learning theory of OOD detection, which is proposed by researchers as an open problem. First, we find a necessary condition for the learnability of OOD detection. Then, using this condition, we prove several impossibility theorems for the learnability of OOD detection under some scenarios. Although the impossibility theorems are frustrating, we find that some conditions of these impossibility theorems may not hold in some practical scenarios. Based on this observation, we next give several necessary and sufficient conditions to characterize the learnability of OOD detection in some practical scenarios. Lastly, we also offer theoretical supports for several representative OOD detection works based on our OOD theory.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：