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

SSRN 2024年

作者： Li, Yahui Sun, Qi Zhou, Chunjie Liu, Lu Tian, Yu-Chu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Hubei Wuhan430074 China School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan430074 China School of Computer Science Queensland University of Technology BrisbaneQLD4001 Australia

intelligent industrial manufacturing heavily relies on structured knowledge. Named Entity Recognition (NER), an essential technique for extracting structured knowledge from text, has garnered significant research interest. However, current NER approaches face difficulties in handling multiple levels of entity nesting in knowledge extraction, especially within the manufacturing context. To address this issue, we present an Anchor Span-based NER (ASNER) approach for accurately and efficiently extracting manufacturing text knowledge. This method combines token and span classification. Initially, the head and tail features of the entity are extracted, with the corresponding anchor span of potential entities generated based on a boundary match neural network to localize the entities. Subsequently, token spatial contextual features are extracted using biaffine attention and convolutional neural networks, and classification categories are assigned to the anchor span-filtered entity features. Experimental studies demonstrate the effectiveness of the proposed ASNER approach. © 2024, The Authors. All rights reserved.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

AoI-Reliability Analysis with Block Length over Erasure Channels Using Rateless Codes

AoI-Reliability Analysis with Block Length over Erasure Chan...

引用

International Conference on Communication Technology (ICCT)

作者： Haobo Huang Yusun Fu Yue Qiao Junpeng Yin Weiwu Yan Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350363760

ISBN: (纸本)9798350363777

As a metric to measure the information freshness, Age of Information (AoI) is widely used to evaluate low-latency high-reliability communication. Since the communication in Industrial Internet of Things (IIoT) often has the special requirements, the relationship among AoI, reliability and block length in time-critical scenarios with bounded latency and non-time-critical scenarios without bounded latency is explored respectively in this paper, based on erasure channels using rateless codes. We build a model using LT codes over erasure channels and consider two metrics: average AoI and bounded AoI. Theoretical analysis and simulation results show that AoI has a minimum value with different block lengths. Furthermore, we draw a conclusion that the minimum value of AoI under different reliability is monotonically decreasing functioned with reliability. Finally, the impact of overhead on reliability and AoI of LT codes in time-critical scenarios is studied.

关键词： Measurement Codes Simulation Reliability theory Information age Communications technology Time factors Low latency communication Industrial Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Enhancing the McEliece Scheme Based on Concatenation of Polar Codes and Blocked QC-LDPC Codes

Enhancing the McEliece Scheme Based on Concatenation of Pola...

引用

IEEE Conference on Communications and Network Security (CNS)

作者： Xin Lin Yusun Fu Zihao Wang Junpeng Yin Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350375961

ISBN: (纸本)9798350375978

This paper proposes an enhanced McEliece cryptosystem, leveraging a concatenation scheme of Polar codes and blocked QC-LDPC codes. During the key generation phase, the generator matrices for both Polar and blocked QC-LDPC codes are employed as private keys. These matrices are subsequently multiplied by reversible and random permutation matrices respectively. The products of these multiplications are then combined to form the public key, effectively concealing the structural properties of the generator matrices. In the encryption phase, the plaintext is encrypted sequentially through the Polar codes and the blocked QC-LDPC codes. This process introduces two layers of random error vectors, culminating in the generation of the encrypted ciphertext. The proposed scheme reduces the public key length by 54% and doubles the security level compared to the original McEliece scheme with similar parameters. It also significantly reduces the total key length compared to improved schemes based on Polar codes and QC-LDPC/MDPC codes at an 80-bit security level, and shortens the private key length compared to schemes based on Polar-LDPC concatenated codes. Notably, the scheme is secure against known structural and decoding attacks while increases resistance to information set decoding (ISD) attacks. Through the randomization and hashing of the plaintext, the proposed scheme can achieve IND-CCA2 security.

关键词： Resistance Codes Public key Network security Generators Vectors Decoding Encryption Concatenated codes Polar codes

来源：评论

学校读者我要写书评

暂无评论

Boltzmann Robust Soliton Distribution for Rateless Codes

Boltzmann Robust Soliton Distribution for Rateless Codes

引用

International Conference on Communication Technology (ICCT)

作者： Jinhui Tang Yusun Fu Yue Qiao Junpeng Yin Haobo Huang School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350363760

ISBN: (纸本)9798350363777

The decoding success rate may be worse when classical degree distributions are used in short-packet transmission of rateless codes, especially in industrial communication scenarios. A novel Boltzmann degree distribution is proposed for Luby Transform (LT) codes. The Boltzmann degree distribution has a high decoding success rate for short-packet transmission but a lower decoding success rate in long-packet transmission. To balance the performance of rateless codes for short and long packet transmission, the Boltzmann degree distribution and the robust soliton distribution (RSD) are combined with a new joint degree distribution, called Boltzmann Robust Soliton Distribution (BRSD). Simulation results show that compared with RSD and Poisson robust soliton distribution (PRSD), the proposed joint distribution can achieve a higher decoding success rate and reduce the average degree, especially in short-packet transmission of industrial communication.

关键词： Codes Simulation Industrial communication Symbols Solitons Transforms Robustness Decoding Complexity theory Physics

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Coupled Slices in Edge-Assisted Industrial IoT Systems

Resource Allocation for Coupled Slices in Edge-Assisted Indu...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Xiaojing Wen Cailian Chen Cheng Ren Ling Lyu Xinping Guan Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China and Shanghai Engineering Research Center of Intelligent Control and Management Shanghai P. R. China School of Information Science and Technology Dalian Maritime University Dalian China

Multiple types of sensors are utilized for remote monitoring of single industrial process to compensate for the limited accuracy of a single type of sensor. Network slicing technology is considered promising for collecting data from heterogeneous sensors and meeting diverse Quality of Service (QoS) requirements. However, existing research on network slicing optimization mainly focuses on inter-slice resource constraints based on slice heterogeneity, neglecting slice coupling feature. In this regard, this paper proposes a novel network slicing framework for edge-assisted industrial IoT systems. The framework includes a slice coupling model and network resource allocation (transmission and computing) to address the problem of improving estimation performance while ensuring system convergence. The slice coupling model is primarily composed of the estimation error covariance of two slices, calculated using the Age of Task (AoT) as a bridge, which reflects the accuracy and freshness of the estimation. To reduce the complexity of the direct solution, the optimization problem is scaled down and decoupled. The iterative Particle Swarm Optimization (PSO) algorithm is proposed to determine the allocation rates of inter-slice transmission and computing resources. Simulation results demonstrate that the proposed algorithm achieves a flexible balance under heterogeneous estimation weights and exhibits near-optimal performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust Simultaneous Tracking and Local Dense Structured Mapping at Scenes lack of Geometric Features

Robust Simultaneous Tracking and Local Dense Structured Mapp...

引用

International Conference on Mechatronics and Machine Vision in Practice (M2VIP)

作者： Yueling Shen Zhijian Qiao Xu Wang Hesheng Wang Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781665431545

In this paper, we present a simultaneous tracking and dense structured mapping method aimed at robotic tasks including obstacle avoidance, path planning and manipulation. This is achieved through (1) sparse-to-dense pose estimation with both keypoints and dense vertex images for keeping robust at scenes lack of geometric features, (2) dense local map algorithm, which clears map outside the neighborhood of the robot for the consistency of the system at large-scale scenes, (3) structured analysis to obtain elevation and norms of surfaces, (4) the proposed dynamic mode for ghosting-free mapping in dynamic scenes. Experiments are conducted to evaluate each part of the system. The effectiveness and efficiency are proved by quantitative experiments.

关键词： Meters Surface reconstruction Three-dimensional displays Mechatronics Heuristic algorithms Pose estimation Path planning

来源：评论

学校读者我要写书评

暂无评论

Pseudo-LiDAR for Visual Odometry

arXiv

引用

arXiv 2022年

作者： Deng, Huiying Wang, Guangming Feng, Zhiheng Jiang, Chaokang Wu, Xinrui Miao, Yanzi Wang, Hesheng Advanced Robotics Research Center AI Research Institute School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China

As one of the important tasks in the field of robotics and machine vision, LiDAR/visual odometry provides tremendous help for various applications such as navigation, location, etc. In the existing methods, LiDAR odometry shows superior performance, but visual odometry is still widely used for its price advantage. Conventionally, the task of visual odometry mainly rely on the input of continuous images. However, it is very complicated for the odometry network to learn the epipolar geometry information provided by the images. In this paper, the concept of pseudo-LiDAR is introduced into the odometry to solve this problem. The pseudo-LiDAR point cloud back-projects the depth map generated by the image into the 3D point cloud, which changes the way of image representation. Compared with the stereo images, the pseudo-LiDAR point cloud generated by the stereo matching network can get the explicit 3D coordinates. Since the 6 Degrees of Freedom (DoF) pose transformation occurs in 3D space, the 3D structure information provided by the pseudo-LiDAR point cloud is more direct than the image. Compared with sparse LiDAR, the pseudo-LiDAR has a denser point cloud. In order to make full use of the rich point cloud information provided by the pseudo-LiDAR, a projection-aware dense odometry pipeline is adopted. Most previous LiDAR-based algorithms sampled 8192 points from the point cloud as input to the odometry network. The projection-aware dense odometry pipeline takes all the pseudo-LiDAR point clouds generated from the images except for the error points as the input to the network. While making full use of the 3D geometric information in the images, the semantic information in the images is also used in the odometry task. The fusion of 2D-3D is achieved in an image-only based odometry. Experiments on the KITTI dataset prove the effectiveness of our method. To the best of our knowledge, this is the first visual odometry method using pseudo-LiDAR. Copyright © 2022, The Authors. A

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

ESNet: evolution and succession network for high-resolution salient object detection 24

ESNet: evolution and succession network for high-resolution ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Hongyu Liu Runmin Cong Hua Li Qianqian Xu Qingming Huang Wei Zhang Institute of Information Science Beijing Jiaotong University & Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China School of Control Science and Engineering Shandong University & Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Computer Science and Technology Hainan University Hainan China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

Preserving details and avoiding high computational costs are the two main challenges for the High-Resolution Salient Object Detection (HRSOD) task. In this paper, we propose a two-stage HRSOD model from the perspective of evolution and succession, including an evolution stage with Low-resolution Location Model (LrLM) and a succession stage with High-resolution Refinement Model (HrRM). The evolution stage achieves detail-preserving salient objects localization on the low-resolution image through the evolution mechanisms on supervision and feature; the succession stage utilizes the shallow high-resolution features to complement and enhance the features inherited from the first stage in a lightweight manner and generate the final high-resolution saliency prediction. Besides, a new metric named Boundary-Detail-aware Mean Absolute Error (MAEBD) is designed to evaluate the ability to detect details in high-resolution scenes. Extensive experiments on five datasets demonstrate that our network achieves superior performance at real-time speed (49 FPS) compared to state-of-the-art methods. Our code is publicly available at: https://***/rmcong/ESNet_ICML24.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Learning of 3D Scene Flow from Monocular Camera^*

Unsupervised Learning of 3D Scene Flow from Monocular Camera...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Guangming Wang Xiaoyu Tian Ruiqi Ding Hesheng Wang Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai China

Scene flow represents the motion of points in the 3D space, which is the counterpart of the optical flow that represents the motion of pixels in the 2D image. However, it is difficult to obtain the ground truth of scene flow in the real scenes, and recent studies are based on synthetic data for training. Therefore, how to train a scene flow network with unsupervised methods based on real-world data shows crucial significance. A novel unsupervised learning method for scene flow is proposed in this paper, which utilizes the images of two consecutive frames taken by monocular camera without the ground truth of scene flow for training. Our method realizes the goal that training scene flow network with real-world data, which bridges the gap between training data and test data and broadens the scope of available data for training. Unsupervised learning of scene flow in this paper mainly consists of two parts: (i) depth estimation and camera pose estimation, and (ii) scene flow estimation based on four different loss functions. Depth estimation and camera pose estimation obtain the depth maps and camera pose between two consecutive frames, which provide further information for the next scene flow estimation. After that, we used depth consistency loss, dynamic-static consistency loss, Chamfer loss, and Laplacian regularization loss to carry out unsupervised training of the scene flow network. To our knowledge, this is the first paper that realizes the unsupervised learning of 3D scene flow from monocular camera. The experiment results on KITTI show that our method for unsupervised learning of scene flow meets great performance compared to traditional methods Iterative Closest Point (ICP) and Fast Global Registration (FGR). The source code is available at: https://***/IRMVLab/3DUnMonoFlow.

关键词： Training Three-dimensional displays Laser radar Laplace equations Pose estimation Training data Cameras

来源：评论

学校读者我要写书评

暂无评论

Improved black-box attack based on query and perturbation distribution

Improved black-box attack based on query and perturbation di...

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Weiwei Zhao Zhigang Zeng School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan China

Adversarial examples cause the deep neural network prediction error, which is a great threat to the deep neural network. How to generate more natural adversarial examples and improve the robustness of deep neural networks has received attention. In this paper, we propose an improved blackbox attack (IBBA) algorithm based on query and perturbation distribution. This algorithm only needs the top-l label of the attacked model to generate the adversarial examples. Based on the existing black-box attacks, we optimize the performance of the algorithm from two aspects: query distribution and perturbation distribution. In the aspect of query distribution, we adopt different strategies for nontargeted attack and targeted attack; in the aspect of perturbation distribution, we choose different low-frequency noise according to the difference between the targeted attack and nontargeted attack. The experimental results on imageNet show that the proposed algorithm is better than the existing algorithms in low query number, and the targeted attack is better in each specified query number.

关键词： Perturbation methods Neural networks Prediction algorithms Robustness Low-frequency noise Discrete cosine transforms Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：