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

8th International Conference on Automation, Control and Robotics engineering, CACRE 2023

作者： Wang, Liangliang Huo, Guanglei Chen, Xinwei Huang, Chengxi Wuhan University of Technology School of Computer Science and Artificial Intelligence Luoshi Road 122 Wuhan430070 China -HIT Research Institute of Engineering and Technology Building 9 Software Park Quanzhou362008 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou350121 China

ISBN: (纸本)9798350302776

To enable robots to understand a specific assistive task during human-robot interactions under complex home scenes, at the center is the problem of human-object interaction (HOI) recognition. In particular, aiming at identifying efficiently, this paper proposes a graph convolutional network (GCN) by considering the similarity and proximity of human and object nodes, based on which the geometric positions and morphological relationships are explored. Also, a supplementary convolutional neural network (CNN) is fused to GCN to extract the global semantic features, which also ensures the recognition applicability for the cases where detectors fall into failure. Experiments on V-COCO demonstrate our approach, and results in real-world scenes on our assistive robot - Xiaozhi II verify its robustness. © 2023 IEEE.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Research on Visual Slam Technology for UAV Positioning and Navigation

Research on Visual Slam Technology for UAV Positioning and N...

引用

International Conference on Wavelet Active Media Technology and Information Processing (ICWAMTIP)

作者： ZHOU WANG LIU ZHIHAO TIAN YING YANG YUJUN School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Computer and Software Engineering Xihua University Chengdu China Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College LuZhou China College of Computer and Artificial Intelligence (Software College) Huaihua University Huaihua China

ISBN: (数字)9798331519254

ISBN: (纸本)9798331519261

UAV (Unmanned Aerial Vehicle) navigation can be considered as the process of robots that determine how to successfully and quickly reach the target location. Specifically, in order to complete the scheduled task successfully, the UAV must accurately understand its status, such as position, navigation speed, heading, as well as the starting point and target position. Moreover, it mainly depends on the current environment and location. This article generally focuses on the research on visual SLAM (Simultaneous localization and mapping) for UAV positioning and navigation.

关键词： Visualization Simultaneous localization and mapping Navigation Information processing Media Autonomous aerial vehicles Robots

来源：评论

学校读者我要写书评

暂无评论

BIG-MOE: BYPASS ISOLATED GATING MOE FOR GENERALIZED MULTIMODAL FACE ANTI-SPOOFING

arXiv

引用

arXiv 2024年

作者： Ma, Yingjie Yu, Zitong Lin, Xun Xie, Weicheng Shen, Linlin Great Bay University China College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

In the domain of facial recognition security, multimodal Face Anti-Spoofing (FAS) is essential for countering presentation attacks. However, existing technologies encounter challenges due to modality biases and imbalances, as well as domain shifts. Our research introduces a Mixture of Experts (MoE) model to address these issues effectively. We identified three limitations in traditional MoE approaches to multimodal FAS: (1) Coarse-grained experts’ inability to capture nuanced spoofing indicators;(2) Gated networks’ susceptibility to input noise affecting decision-making;(3) MoE’s sensitivity to prompt tokens leading to overfitting with conventional learning methods. To mitigate these, we propose the Bypass Isolated Gating MoE (BIG-MoE) framework, featuring: (1) Fine-grained experts for enhanced detection of subtle spoofing cues;(2) An isolation gating mechanism to counteract input noise;(3) A novel differential convolutional prompt bypass enriching the gating network with critical local features, thereby improving perceptual capabilities. Extensive experiments on four benchmark datasets demonstrate significant generalization performance improvement in multimodal FAS task. The code is released at https://***/murInJ/BIGMoE. Copyright © 2024, The Authors. All rights reserved.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

TraSculptor: Visual Analytics for Enhanced Decision-Making in Road Traffic Planning

引用

IEEE Transactions on Visualization and Computer Graphics 2025年 PP卷 PP页

作者： Deng, Zikun Liu, Yuanbang Zhu, Mingrui Xiang, Da Yu, Haiyue Su, Zicheng Lu, Qinglong Schreck, Tobias Cai, Yi South China University of Technology School of Software Engineering China South China University of Technology Ministry of Education Key Laboratory of Big Data and Intelligent Robot China Tongji University Key Laboratory of Road and Traffic Engineering of the Ministry of Education China National University of Singapore Department of Civil and Environmental Engineering Singapore Graz University of Technology Austria

The design of urban road networks significantly influences traffic conditions, underscoring the importance of informed traffic planning. Traffic planning experts rely on specialized platforms to simulate traffic systems, assessing the efficacy of the road network across various states of modifications. Nevertheless, a prevailing issue persists: many existing traffic planning platforms exhibit inefficiencies in flexibly interacting with the road network's structure and attributes and intuitively comparing multiple states during the iterative planning process. This paper introduces TraSculptor, an interactive planning decision-making system. To develop TraSculptor, we identify and address two challenges: interactive modification of road networks and intuitive comparison of multiple network states. For the first challenge, we establish flexible interactions to enable experts to easily and directly modify the road network on the map. For the second challenge, we design a comparison view with a history tree of multiple states and a road-state matrix to facilitate intuitive comparison of road network states. To evaluate TraSculptor, we provided a usage scenario where the Braess's paradox was showcased, invited experts to perform a case study on the Sioux Falls network, and collected expert feedback through interviews. © 1995-2012 IEEE.

关键词： Visual analytics

来源：评论

学校读者我要写书评

暂无评论

Towards Time-Series Key Points Detection Through Self-supervised Learning and Probability Compensation 28th

Towards Time-Series Key Points Detection Through Self-superv...

引用

28th International Conference on Database Systems for Advanced Applications, DASFAA 2023

作者： Yuan, Mingxu Bi, Xin Huang, Xuechun Zhang, Wei Hu, Lei Yuan, George Y. Zhao, Xiangguo Sun, Yongjiao Key Laboratory of Ministry of Education on Safe Mining of Deep Metal Mines Northeastern University Shenyang110819 China Key Laboratory of Liaoning Province on Deep Engineering and Intelligent Technology Northeastern University Shenyang110819 China School of Computer Science and Engineering Northeastern University Shenyang China Thinvent Digital Technology Co. Ltd. Nanchang India College of Software Northeastern University Shenyang China

ISBN: (纸本)9783031306365

Key points detection is crucial for signal analysis by marking the identification points of specific events. Deep learning methods have been introduced into key points detection tasks due to their significant representation learning ability. However, in contrast to common time series classification and prediction tasks, the target key points correspond to significantly different time-series patterns and account for an extremely small proportion in a whole sample. Consequently, existing end-to-end methods for key points detection encounter two major problems: specificity and sparsity. Thus, in this work, we address these issues by proposing a probability compensated self-supervised learning framework named ProCSS. Our ProCSS consists of two major components: 1) a pretext task module pretraining an encoder based on self-supervised learning to capture effective time-series representations with a higher generalization ability;2) a joint loss function providing both dynamic focal adaptation and probability compensation by extreme value theory. Extensive experiments using both real-world and benchmark datasets are conducted. The results indicate that our method outperforms our rival methods for time-series key points detection. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

DeepMesh: A Comprehensive Survey of Deep Learning-Based Routing Performance in Wireless Mesh Networks 18

DeepMesh: A Comprehensive Survey of Deep Learning-Based Rout...

引用

18th International Conference on intelligent Systems and Knowledge engineering, ISKE 2023

作者： Xiaoping, Qiu Alam, Md Zahidul Du, Shiling Yue, Zhongjian Wang, Yulan School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu610031 China Tangshan Institute of Southwest Jiaotong University Tangshan063000 China National United Engineering Laboratory of Integrated and Intelligent Transportation Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Chengdu610031 China Sichuan Institute of Industrial Software Technology Sichuan Chengdu China

ISBN: (纸本)9798350318401

This paper provides a analysis of the challenges faced in routing in wireless mesh networks and how deep learning can be used to improve performance. Wireless mesh networks (WMNs) are a particular kind of wireless network that use mesh routers and mesh clients that talk to one another to provide wireless coverage over a wide area. The paper discusses the limitations of traditional routing methods in WMNs and highlights the potential of deep learning-based routing approaches to revolutionize WMNs. The survey evaluates the literature focusing on the various routing approaches, performances, and research methodologies. The study aims to provide several potential areas for further investigation in deep learning-based routing approaches for WMNs and discusses several research challenges and opportunities in the field. The identification of trends and challenges, and recommendations for future research directions provide valuable insights for researchers and practitioners in the field of wireless mesh networks. © 2023 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Rsta: A Reversible Signal Transmission Architecture for Breaking the Limitation of Unidirectional Transmission

SSRN

引用

SSRN 2025年

作者： Liu, Xin Cui, Shuang Zhang, Xun Zhou, Fuxing Sheng, Kaikai Wang, Bin Zhang, Qiang School of Computer Science and Technology Dalian University of Technology Dalian116024 China Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian University Dalian116622 China

Molecular circuits are essential tools for biosensing and molecular information processing. However, the long-distance and reversible transmission of orthogonal signals remains a significant challenge in molecular circuits, preventing molecular signals from achieving reversible transmission similar to that of electrical signals in wires. To overcome the limitations of unidirectional signal transmission and facilitate the integration of antagonistic circuits. We propose a reversible signal transmission architecture (RSTA) with wire-like characteristics to achieve reversible signal transmission based on fundamental molecular devices known as reversible signal fan-out devices (RSFDs). The polarity of the input signal dictates the transmission direction, establishing the initial condition for the output signals. Cascaded RSFDs within RSTA offer two key advantages. First, the temporal response to signals. Second, the reversible transformation of opposite circuit types without structural modification. We experimentally validated the principles and functionality of RSTA using temporal logic device and integrated molecular circuits. This work advances the field of reversible molecular signal transmission, enabling the rational design of complex molecular circuits and molecular information processing systems. We envision applications of this technology in nanomachines, molecular computing, and biosensing. © 2025, The Authors. All rights reserved.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

ADATS: Adaptive RoI-Align based Transformer for End-to-End Text Spotting

ADATS: Adaptive RoI-Align based Transformer for End-to-End T...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Zepeng Huang Qi Wan Junliang Chen Xiaodong Zhao Kai Ye Linlin Shen Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

Scene text spotting has attracted great attention in recent years. Compared with two-stage approaches that locate scene texts in the first stage and recognize them in the second stage, the advantages of joint location and recognition training are not fully explored. In this paper, we present an ADaptive RoI-Align based transformer for end-to-end Text Spotting (ADATS), which simultaneously locates and recognizes text with a single forward pass. By employing an Adaptive RoI-Align, the text features are extracted from the feature extraction network with the original aspect ratio, such that less information is lost during the alignment of arbitrarily-shaped scene text. Attention-based segmentation and recognition heads allow us to simultaneously optimize detection and recognition. Experiments on ICDAR 2015, MSRA-TD500, Total-Text, and CTW1500 demonstrate the effectiveness of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

One-against-all-based Hellinger distance decision tree for multiclass imbalanced learning

引用

Frontiers of Information Technology & Electronic engineering 2022年第2期23卷 278-290页

作者： Minggang DONG Ming LIU Chao JING School of Information Science and Engineering Guilin University of TechnologyGuilin 541004China Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin 541004China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic TechnologyGuilin 541004China

Since traditional machine learning methods are sensitive to skewed distribution and do not consider the characteristics in multiclass imbalance problems,the skewed distribution of multiclass data poses a major challenge to machine learning *** tackle such issues,we propose a new splitting criterion of the decision tree based on the one-against-all-based Hellinger distance(OAHD).Two crucial elements are included in ***,the one-against-all scheme is integrated into the process of computing the Hellinger distance in OAHD,thereby extending the Hellinger distance decision tree to cope with the multiclass imbalance ***,for the multiclass imbalance problem,the distribution and the number of distinct classes are taken into account,and a modified Gini index is ***,we give theoretical proofs for the properties of OAHD,including skew insensitivity and the ability to seek a purer node in the decision ***,we collect 20 public real-world imbalanced data sets from the Knowledge Extraction based on Evolutionary Learning(KEEL)repository and the University of California,Irvine(UCI)*** and statistical results show that OAHD significantly improves the performance compared with the five other well-known decision trees in terms of Precision,F-measure,and multiclass area under the receiver operating characteristic curve(MAUC).Moreover,through statistical analysis,the Friedman and Nemenyi tests are used to prove the advantage of OAHD over the five other decision trees.

关键词： Decision trees Multiclass imbalanced learning Node splitting criterion Hellinger distance One-against-all scheme

来源：评论

学校读者我要写书评

暂无评论

CADEC: A Combinatorial Auction for Dynamic Distributed DNN Inference Scheduling in Edge-Cloud Networks

引用

IEEE Transactions on Mobile Computing 2025年

作者： Xu, Xiaolong Hu, Yuhao Cui, Guangming Qi, Lianyong Dou, Wanchun Nanjing University of Information Science and Technology School of Software Nanjing210044 China Nanjing University of Information Science and Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software China Nanjing University State Key Laboratory for Novel Software Technology China College of Computer science and technology Qingdao China Georgia State University Department of Computer Science United States

Deep Neural Network (DNN) Inference, as a key enabler of intelligent applications, is often computation-intensive and latency-sensitive. Combining the advantages of cloud computing (abundant computing resources) and edge computing (fast transmission), edge-cloud collaborative DNN inference is a powerful solution to these problems. However, in edge-cloud networks with heterogeneous resources, how to obtain reasonable decisions on server selection, model partition and resource allocation for efficient distributed DNN inference is a hard challenge. Furthermore, it is non-trivial to design suitable resource prices to maximize the social welfare. These challenges even escalate in dynamic edge-cloud networks where decisions should be generated as soon as each user arrives without future information. Therefore, we design a combinatorial auction for dynamic distributed DNN inference scheduling, named CADEC. CADEC first constructs a bid set for each user based on convex optimization theory for optimal solution searching. Next, prices of resources in the edge-cloud network are adjusted according to changes in supply-demand relationship, and whether to admit the request of each user is decided. Finally, the dynamic distributed inference scheduling decisions are generated through the primal-dual algorithm to maximize the social welfare. Theoretical analysis shows the good competitive ratio and polynomial time complexity of CADEC. Results of simulation experiments present that CADEC improves social welfare by up to 46% compared with state-of-the-art distributed DNN inference schemes. © 2002-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：