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

International Conference on Computer and Communications (ICCC)

作者： Dawen Zheng Lusheng Wang Caihong Kai Min Peng Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Service robots play an increasingly important role in people's daily life. The density of pedestrians is large and the movement is irregular in pedestrian-robot mixed traffic flows. Robots are prone to collision with pedestrians, and the tasks to be offloaded are closely related to pedestrians. How to analyze the tasks of robots and select the appropriate roadside unit is an important issue. In this paper, the social force model is used to predict the positions of pedestrians and robots, taking into account the influence of various forces to avoid collisions. A task offloading resource optimization algorithm with position prediction is proposed. According to the predicted information, the size and position distribution of all tasks in the scenario are obtained, and then the neural network trained beforehand based on deep Q-Iearning is used to generate a task offloading strategy. The simulation results show that the running time of the proposed algorithm is very short, and the resource allocation required for task offloading is completed in advance based on the predicted information before robots arriving the corresponding positions. Besides, the algorithm significantly reduces the task offloading delay.

关键词： Service robots Simulation Force Predictive models Prediction algorithms Delays Task analysis

来源：评论

学校读者我要写书评

暂无评论

LGDB-Net: Dual-Branch Path for Building Extraction from Remote Sensing Image 30

LGDB-Net: Dual-Branch Path for Building Extraction from Remo...

引用

30th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2024

作者： Zhang, Ronghuan Zhao, Jing Li, Ming Zou, Qingzhi Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Shandong University of Traditional Chinese Medicine School of Intelligence and Information Engineering Jinan China

ISBN: (纸本)9798331515966

Extracting buildings from remote sensing images using deep learning techniques is a widely applied and crucial task. Convolutional Neural Networks (CNNs) adopt hierarchical feature representation, showcasing powerful capabilities in extracting local information but facing challenges in capturing global features. Transformers can address this limitation, but they perform poorly in extracting local features and significantly increase memory requirements and computational complexity. To overcome these challenges, we propose a method for building extraction from remote sensing images called LGDB-Net (Local-Global Dual-Branch Network), employing a dual-branch approach. Firstly, inspired by Swin Transformer, we designed GB-Former(Global Branch-Former) as the backbone network to model global information. We use a linear multi-head self-attention mechanism to reduce time and memory complexity while maintaining a large global receptive field. Additionally, we replace the traditional multi-layer perceptron with a convolution-enhanced multi-layer perceptron to improve channel feature representation, reduce model parameters, and enhance segmentation performance. Secondly, we use multiple Depth-wise Conv3×3 + LN (Layer Normalization) + GeLU (Gaussian Error Linear Unit) modules as the auxiliary branch for local detailed feature extraction. Finally, we adopt a multi-scale feature fusion strategy to integrate feature information from both branches. We conduct a series of experiments on three datasets: WHU, Massachusetts, and Inria. The experimental results demonstrate that the proposed method not only effectively improves segmentation accuracy with lower building omission and commission rates but also significantly reduces model parameters and computational complexity. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Multilingual knowledge Graph Completion via Multimodal Decouple and Relation-based Ensemble Inference 29

Multilingual Knowledge Graph Completion via Multimodal Decou...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Liu, Xiaojing Jiang, Xuesong Yi, Fengge Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

The objective of Multimodal knowledge Graph Completion (MKGC) is to forecast absent entities within a knowledge graph by leveraging additional textual and visual modalities. Existing studies commonly utilize a singular relationship embedding to depict all modalities within an entity pair, thus connecting several relationships derived from diverse modalities. However, this coupling may introduce interference from conflicting information between modalities, as the relationships between modalities for a given entity pair can be contradictory. Moreover, existing Ensemble Inference methods fail to dynamically adjust modal weights based on their differences and importance, despite the varying contributions of different modalities. In this paper, we propose the Multimodal Decouple and Relation-based Ensemble inference (MDRE) model. For each modality, we construct corresponding relationship embeddings and build separate triple representations to avoid interferences among modalities. During the training phase, we employ confidence-constrained training with temperature scaling to alleviate conflicting information in textual and visual modalities. For inference, we utilize the Relation-based Ensemble Inference method to adjust modal weights at the relationship level, thus achieving improved prediction results. Experimental results on two datasets demonstrate that MDRE outperforms existing single-modal and multimodal knowledge graph completion methods in terms of performance. © 2023 IEEE.

关键词： knowledge graph knowledge graph completion multimodal fusion

来源：评论

学校读者我要写书评

暂无评论

A Multiple-Blockchains based Service Monitoring Framework in Edge-Cloud Computing 23

A Multiple-Blockchains based Service Monitoring Framework in...

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and big data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Fu, Hang Wang, Puwei Li, Haoran Zhan, Ying Chen, Jinchuan Du, Xiaoyong Guizhou University of Finance and Economics Guiyang City550025 China School of Information Renmin University of China China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing100872 China

ISBN: (纸本)9781665494571

In the edge-cloud computing, the applications usually are delivered as services, each of which runs independently and can cooperate to construct the complicated applications. However, it is difficult to monitor the services in the decentralized edge-cloud environment since there usually does not exist the central authorization to guarantee trustiness of the service quality data collected. To address the trust issue, the blockchain techniques have been introduced to the service monitoring. Considering the services usually are distributed on the edge nodes, if we deploy only a blockchain on the edge nodes near to the services, it may have to support both the service registration and monitoring because of the loose-coupling principle. That would influence the performance, even would crash the edge nodes. In this paper, we propose a multiple-blockchains based framework, including a registration blockchain that focuses on the service registration and discovery, and a set of monitoring blockchains that focus on the service invocation and monitoring. The registration blockchain is deployed on the cloud nodes, and the monitoring blockchains are deployed on the edge nodes near to the services for collecting efficiently and precisely the service quality data. Based on the cross-chain technology, we design a cross-chain service discovery between the monitoring blockchain and the registration blockchain for finding the services the requesters need. Finally, we implement the registration and monitoring blockchains based on the blockchain platform Cosmos and conduct a set of experiments to show the effectiveness of the proposed framework. © 2021 IEEE.

关键词： Authorization Cloud computing Smart cities Computer crashes Blockchains Monitoring

来源：评论

学校读者我要写书评

暂无评论

Deformable registration framework for glioma images with absent correspondence based on auxiliary-image-aided intensity-consistency constraint

Deformable registration framework for glioma images with abs...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Tang, Kun Wang, Lihui Yang, Menglong Xu, Jingwen Cheng, Xinyu Zhang, Jian Zhu, Yuemin Wei, Hongjiang Ministry of Education State Key Laboratory of Public Big Data College of Computer Science and Technology Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province Engineering Research Center of Text Computing & Cognitive Intelligence Guiyang China Univ Lyon Insa Lyon Cnrs Inserm Creatis Umr 5220 U1206 Lyon France Shanghai Jiao Tong University School of Biomedical Engineering Shanghai200240 China

ISBN: (纸本)9798350386226

Considering the tumor aggressive nature and the significant changes in anatomical structure, aligning the preoperative and follow up scans of glioma patients remains a challenge due to the presence of regions with absent correspondence. To address this challenge, this work proposed a novel bidirectional unsupervised deformable image registration framework for image pairs with missing correspondence based on an auxiliary-image-aided intensity-consistency constraint (ICC) strategy. Specifically, for any fixed and moving image pairs, we introduced an auxiliary image and warped it directly to fixed/moving image or warped it twice through a transition of moving/fixed image. By comparing the difference between these warped images, the weighting maps to identify and exclude regions with absent correspondence between fixed and moving image pairs can be generated. To verify the effectiveness of the proposed framework, we combined it with several deep learning-based registration models and tested it on BraTS-Reg challenge dataset, the results demonstrated that the proposed ICC strategy can improve the registration performance for all the models, with the improvement of average target registration error (TRE) and success rate (SR) being up to 44.9% and 66.7%, respectively. Comparing against the best existing forward-backward consistency strategy for dealing with missing correspondence registration, our auxiliary-image-aided ICC strategy can also decrease average TRE by 2.9%, demonstrating the superiority of the proposed framework. The present work is not limited to the glioma images, it can be used to address the registration problems for any image pairs with absent correspondence or inconsistent intensity. © 2024 IEEE.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

Queue Length Prediction Method of Short-linked Intersections Based on Long Short-Term Memory 9

Queue Length Prediction Method of Short-linked Intersections...

引用

9th International Conference on Systems and Informatics, ICSAI 2023

作者： Shi, Kang Shi, Kang Yang, Jun Liang, Zi Jun Jun Liang, Zi Li, Yu Qi Wang, Rui Han Tongji University Key Laboratory of Road and Traffic Engineering Ministry of Education Shanghai201804 China Anhui Chaoyuan Information Technology Co. Ltd HeFei230088 China Anhui Province Transportation Big Data Analysis and Application Engineering Laboratory Hefei230601 China Hefei University School of Urban Construction and Transportation Hefei230601 China

ISBN: (纸本)9798350383706

To address traffic congestion and vehicle queue overflow at short-link intersections, it is essential to conduct a predictive analysis of vehicle queue length between these intersections. This helps in proactively implementing appropriate traffic management measures to prevent traffic overflow and congestion. In this paper, we propose a short-link intersection vehicle queue length prediction method based on Long Short-Term Memory (LSTM). First, historical traffic data from the morning peak hours over the past month is collected. After comparing multiple machine learning models, LSTM is chosen for traffic flow prediction. Subsequently, mathematical models are used to predict queue length at future time intervals. Through practical validation, we found that the proposed method for predicting queue length between short-link intersections in this paper is effective, with an average prediction error rate of 11.9%. It meets the requirements for predicting vehicle queue length between intersections and proactively controlling them, holding significant practical significance for preventing traffic flow and congestion events. © 2023 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6315-6332页

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science Faculty of Environment Science and Economy ExeterEX4 4QF United Kingdom Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China University of Oslo Department of Informatics Oslo0316 Norway

Mobile Edge Computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. © 2025 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

IF-Font: ideographic description sequence-following font generation 24

IF-Font: ideographic description sequence-following font gen...

引用

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

作者： Xinping Chen Xiao Ke Wenzhong Guo Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou China and Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China

ISBN: (纸本)9798331314385

Few-shot font generation (FFG) aims to learn the target style from a limited number of reference glyphs and generate the remaining glyphs in the target font. Previous works focus on disentangling the content and style features of glyphs, combining the content features of the source glyph with the style features of the reference glyph to generate new glyphs. However, the disentanglement is challenging due to the complexity of glyphs, often resulting in glyphs that are influenced by the style of the source glyph and prone to artifacts. We propose IF-Font, a novel paradigm which incorporates Ideographic Description Sequence (IDS) instead of the source glyph to control the semantics of generated glyphs. To achieve this, we quantize the reference glyphs into tokens, and model the token distribution of target glyphs using corresponding IDS and reference tokens. The proposed method excels in synthesizing glyphs with neat and correct strokes, and enables the creation of new glyphs based on provided IDS. Extensive experiments demonstrate that our method greatly outperforms state-of-the-art methods in both one-shot and few-shot settings, particularly when the target styles differ significantly from the training font styles. The code is available at https://***/Stareven233/IF-Font.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scene-Adaptive Person Search via Bilateral Modulations

arXiv

引用

arXiv 2024年

作者： Jiang, Yimin Wang, Huibing Peng, Jinjia Fu, Xianping Wang, Yang School of Information Science and Technology Dalian Maritime University Dalian China School of Cyber Security and Computer Hebei University Baoding China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China

Person search aims to localize specific a target person from a gallery set of images with various scenes. As the scene of moving pedestrian changes, the captured person image inevitably bring in lots of background noise and foreground noise on the person feature, which are completely unrelated to the person identity, leading to severe performance degeneration. To address this issue, we present a Scene-Adaptive Person Search (SEAS) model by introducing bilateral modulations to simultaneously eliminate scene noise and maintain a consistent person representation to adapt to various scenes. In SEAS, a Background Modulation Network (BMN) is designed to encode the feature extracted from the detected bounding box into a multi-granularity embedding, which reduces the input of background noise from multiple levels with norm-aware. Additionally, to mitigate the effect of foreground noise on the person feature, SEAS introduces a Foreground Modulation Network (FMN) to compute the clutter reduction offset for the person embedding based on the feature map of the scene image. By bilateral modulations on both background and foreground within an end-to-end manner, SEAS obtains consistent feature representations without scene noise. SEAS can achieve state-of-the-art (SOTA) performance on two benchmark datasets, CUHK-SYSU with 97.1% mAP and PRW with 60.5% mAP. The code is available at https://***/whbdmu/SEAS. © 2024, CC0.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Multi-Label Learning with Missing Labels via Correlation Information

Semi-supervised Multi-Label Learning with Missing Labels via...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zexian Xie Peipei Li Jinling Jiang Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Knowledge Engineering Research Center Zhejiang Lab Hangzhou Zhejiang China

In multi-label learning, each instance is associated with a set of labels simultaneously. Most existing studies assume that the set of labels for each instance is complete. However, it is generally difficult to obtain all the relevant labels of each instance, and only a partial or even empty set of relevant labels is available, which is called semi-supervised multi-label learning with missing labels. To tackle this problem, we propose a novel framework that considers label correlations and instance correlations to recover the missing labels and utilizes a large amount of unlabeled data simultaneously to improve the classification performance. Specifically, a new supplementary label matrix is firstly obtained by learning the label correlation. Secondly, considering each class label may be decided by some specific characteristics of its own, a label-specific data representation is hence learned for each class label. Thirdly, instance correlations are utilized not only to recover the missing labels, but also to propagate the supervision information from labeled instances to unlabeled ones. In addition, a united objective function is designed to facilitate the above processing and an accelerated proximal gradient method is adopted to solve the optimization problem. Finally, extensive experimental results conducted on several benchmark datasets demonstrate the effectiveness of the proposed method compared to competing ones.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：