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

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Cai, Haojie Yin, Dongfu Yu, Fei Xiong, Siting Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen University Shenzhen China

ISBN: (纸本)9798350368741

Increasing attention has been garnered by LiDAR points and multi-view images fusion based on Transformer for supplementing another modality in 3D object detection. However, challenges persist for cross-modal fusion methods due to the heterogeneity of these two modalities, leading to issues such as inaccurate detection results encountered by Transformer-based methods. In this work, a one-way mid-level fusion based framework for 3D object detection named Modal Fusion Transformer (MFT) using LiDAR points and multi-view images is introduced. It comprises a Depth-Guided Generation(DGG) module, Position Encoding Generation (PEG) module and Cross Modal Fusion(CMF) module. Specifically, depth information from point cloud is utilized for both gathering the image depth map and initializing object queries in DGG. PEG unifies the form of position encoding from LiDAR features and multi-view image features. Depth and position information of object from images is aggregated to point clouds by CMF, which fully explores dual-modal information. Furthermore, a Modal Fusion Network with deformable attention named fast-MFT is introduced to reduce the relatively large computational cost associated with global attention. Our MFT and fast-MFT achieve competitive performance while maintaining a faster inference speed than other models. © 2025 IEEE.

关键词： 3D Object Detection Autonomous Driving Cross-Modal Transformer Positional Embedding Speed comparison

来源：评论

学校读者我要写书评

暂无评论

Research on Improved Quick Sort Algorithm with Duplicate Value Handling 8

Research on Improved Quick Sort Algorithm with Duplicate Val...

引用

8th International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud), I-SMAC 2024

作者： Hemin Yadav, Amit Khan, Asif Sah, Abhishek Pratap Chengdu Neusoft University College of Computer and Software Chengdu China Charles Darwin University College of Engineering It and Environment NT Australia Integral University Department of Computer Application Lucknow India University of Electronic Science and Technology of China School of Management Science and Engineering Chengdu China

ISBN: (纸本)9798350376425

An improved algorithm based on Quick Sort algorithm research method is proposed to deal with prevailing duplicate values in the sorting of data. The duplicate values are specially processed, which effectively reduces the number of division and greatly reduces the number of recursions. The experimental results show that the time efficiency is improved by more than 50% when dealing with large data than the traditional Quick Sort algorithm without reducing the space efficiency. © 2024 IEEE.

关键词： Duplicate Value Quick Sort Recursion

来源：评论

学校读者我要写书评

暂无评论

Clustering-based Autoencoding for Dynamic Multiobjective Evolutionary Optimization 4

Clustering-based Autoencoding for Dynamic Multiobjective Evo...

引用

4th International Conference on Data-Driven Optimization of Complex Systems, DOCS 2022

作者： Ye, Yulong Zhu, Qingling Li, Lingjie Chen, Jianyong Shenzhen University College of Computer Science and Software Engineering Shenzhen China

ISBN: (数字)9781665459822

ISBN: (纸本)9781665459822

Dynamic multiobjective optimization problems (DMOPs) usually contain multiple conflicting objectives that change over time, which requires the optimization algorithms to quickly track the Pareto optimal front (POF) when the environment changes. In recent years, transfer learning (TL)-based methods have been considered promising in solving DMOPs. However, most existing TL-based methods are computationally extensive and therefore time-consuming. In this paper, a clustering based autoencoding for DMOEA, called CAE-DMOEA, is proposed, which aims to generate a high-quality initial population to accelerate the evolutionary process and improve the optimization performance. In particular, by learning the mapping relationship between the regional centroids of the approximate Pareto-optimal solutions (POS) from the previous two environments, the CAE-DMOEA can effectively predict the regional centroids of the POS in the new environment, which helps to tracking the moving POS and enhance the optimization efficiency. To study the performance of the proposed method, extensive experiments have been carried out by comparing three state-of-the-art DMOEAs. The experimental results show that the overall performance of the CAE-DMOEA is superior to that of the compared algorithms. © 2022 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

RoSe: Rotation-Invariant Sequence-Aware Consensus for Robust Correspondence Pruning 24

RoSe: Rotation-Invariant Sequence-Aware Consensus for Robust...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Liu, Yizhang Zhou, Weiwei Li, Yanping Zhao, Shengjie School of Software Engineering Tongji University Shanghai China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Technology Tongji University Shanghai China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai China

ISBN: (纸本)9798400706868

Correspondence pruning has recently drawn considerable attention as a crucial step in image matching. Existing methods typically achieve this by constructing neighborhoods for each feature point and imposing neighborhood consistency. However, the nearest-neighbor matching strategy often results in numerous many-to-one correspondences, thereby reducing the reliability of neighborhood information. Furthermore, the smoothness constraint fails in cases of large-scale rotations, leading to misjudgments. To address the above issues, this paper proposes a novel robust correspondence pruning method termed RoSe, which is based on rotation-invariant sequence-aware consensus. We formulate the correspondence pruning problem as a mathematical optimization problem and derive a closed-form solution. Specifically, we devise a rectified local neighborhood construction strategy that effectively enlarges the distribution between inliers and outliers. Meanwhile, to accommodate large-scale rotation, we propose a relative sequence-aware consistency as an alternative to existing smoothness constraints, which can better characterize the topological structure of inliers. Experimental results on image matching and registration tasks demonstrate the effectiveness of our method. Robustness analysis involving diverse feature descriptors and varying rotation degrees further showcases the efficacy of our method. © 2024 ACM.

关键词： correspondence pruning

来源：评论

学校读者我要写书评

暂无评论

Building LOD representation for 3D urban scenes

引用

ISPRS Journal of Photogrammetry and Remote Sensing 2025年 226卷 16-32页

作者： Pan, Shanshan Zhang, Runze Liu, Yilin Gong, Minglun Huang, Hui College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Computer Science University of Guelph Guelph Canada

The advances in 3D reconstruction technology, such as photogrammetry and LiDAR scanning, have made it easier to reconstruct accurate and detailed 3D models for urban scenes. Nevertheless, these reconstructed models often contain a large number of geometry primitives, making interactive manipulation and rendering challenging, especially on resource-constrained devices like virtual reality platforms. Therefore, the generation of appropriate levels-of-detail (LOD) representations for these models is crucial. Additionally, automatically reconstructed 3D models tend to suffer from noise and lack semantic information. Dealing with these issues and creating LOD representations that are robust against noise while capturing semantic meaning present significant challenges. In this paper, we propose a novel algorithm to address these challenges. We begin by analyzing the properties of planar primitives detected from the input and group these primitives into multiple level sets by forming meaningful 3D structures. These level sets form the nodes of our innovative LOD-Tree. By selecting nodes at appropriate depths within the LOD-Tree, different LOD representations can be generated. Experimental results on real and complex urban scenes demonstrate the merits of our approach in generating clean, accurate, and semantically meaningful LOD representations. © 2025

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

A Deep Reinforcement Learning based VM Scheduling Strategy Decreasing Data Center Communication costs 24

A Deep Reinforcement Learning based VM Scheduling Strategy D...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Xiao, Zhijiao Liu, Xiao Ming, Zhong Software Engineering Research Center College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen China

ISBN: (纸本)9798350319934

With the rapid development of cloud computing, more and more complicated services are deployed on the cloud. The frequent communication between services places a great burden on the network of the data center and leads to a decline in the quality of service. Researches have shown that the costs of communication between services vary with the placements of virtual machines on which services are running. Therefore, the virtual machine strategy should be optimized by migrating virtual machines with high communication frequency closer. Based on fat-tree network topology, a Deep Q network based online virtual machines scheduling strategy(DQN-VMS) is proposed. The objective is to obtain an optimized virtual machine scheduling strategy that brings down communication costs while guaranteeing the quality of service. The calculation model for communication costs is built for the fat-tree network topology. A reward function that takes into account the communication costs and Service Level Agreements violation(SLAV) rate is designed. The experiment shows that the proposed strategy performs about 26.81% and 40.55% better in comparison with two virtual machine scheduling strategies based on graph partition algorithm and greedy algorithm, which are commonly used in existing data centers. © 2022 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Towards Trustworthy Multi-Label Sewer Defect Classification via Evidential Deep Learning 48

Towards Trustworthy Multi-Label Sewer Defect Classification ...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Zhao, Chenyang Hu, Chuanfei Shao, Hang Wang, Zhe Wang, Yongxiong Southeast University The College of Software Engineering Nanjing China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai China Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing China

ISBN: (纸本)9781728163277

An automatic vision-based sewer inspection plays a key role of sewage system in a modern city. Recent advances focus on utilizing deep learning model to realize the sewer inspection system, benefiting from the capability of data-driven feature representation. However, the inherent uncertainty of sewer defects is ignored, resulting in the missed detection of serious unknown sewer defect categories. In this paper, we propose a trustworthy multi-label sewer defect classification (TMSDC) method, which can quantify the uncertainty of sewer defect prediction via evidential deep learning. Meanwhile, a novel expert base rate assignment (EBRA) is proposed to introduce the expert knowledge for describing reliable evidences in practical situations. Experimental results demonstrate the effectiveness of TMSDC and the superior capability of uncertainty estimation is achieved on the latest public benchmark. © 2023 IEEE.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

Predicting the Risks of Brain Stroke Using Machine Learning Models and Artificial Neural Network

Predicting the Risks of Brain Stroke Using Machine Learning ...

引用

2023 Annual International Conference on Emerging Research Areas: International Conference on Intelligent Systems, AICERA/ICIS 2023

作者： Nahid, Nafiz Hossain, Mehrab Rifat, Ariful Islam Khan Raisa, Meher Durdana Islam, Ashraful Sylhet Engineering College Department of Computer Science and Engineering Sylhet Bangladesh American International University Department of Computer Science and Engineering Dhaka Bangladesh Daffodil International University Department of Software Engineering Dhaka Bangladesh University of Regina Department of Computer Science Regina Canada

ISBN: (纸本)9798350303452

The primary cause of death and disability worldwide is stroke. Accurate prediction models and identification of stroke risk factors can aid in early intervention and preventive measures. In this study, an approach based on machine learning algorithms, including Logistic Regression (LR), Support Vector Machine (SVM), K-Nearest Neighbors (KNN), AdaBoost (AdB), Gradient Boosting (GB), Decision Tree (DT), and a unique Artificial Neural Network (ANN) model, is proposed to predict stroke risk at four different levels. To address the issue of imbalanced dataset, Synthetic Minority Over-sampling Technique coupled with Edited Nearest Neighbors (SMOTEENN) was used. 11 features were selected for training the models out of the initial 12 features, and the data-set was divided into an 80-20 train-test ratio for model assessment. The Decision Tree (DT) model achieved an accuracy of 98.53%. Additionally, a 1000 epoch Artificial Neural Network (ANN) model with various batch sizes was created;128 produced the best results. Stochastic Gradient Descent (SGD), Adam, and RMSprop were examined along with other optimizers, however SGD produced the highest accuracy rate of 99.21%. The results suggest that utilizing the selected features and the balanced data-set, machine learning algorithms such as the unique CNN model can accurately predict stroke risk at various levels. These models have the potential to aid in early detection of stroke risk and guide preventive interventions, thus improving patient care and outcomes. Further testing and implementation of these models in real clinical settings are warranted. © 2023 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

VCApather: A Network as a Service Solution for Video Conference Applications 34

VCApather: A Network as a Service Solution for Video Confere...

引用

34th Workshop on Network and Operating System Support for Digital Audio and Video, NOSSDAV 2024

作者： He, Dongbiao Lin, Canshu Yu, Xian Westphal, Cedric Ming, Zhongxing Cui, Laizhong Zhou, Xu Garcia-Luna-Aceves, J.J. Sangfor Technologies Inc China College of Computer Science and Software Engineering Shenzhen University China Computer Network Information Center Chinese Academy of Sciences China China Electrical and Computer Engineering Department University of Toronto Canada Futurewei

ISBN: (纸本)9798400706134

We propose a network service as a solution for video conference applications by constructing network layer routing strategies. Our approach takes into account the characteristics of conferencing flows, addresses various self-customized metrics, and proactively ensures a positive user experience by preventing contention. The performance of VCApather is evaluated using a fully-meshed topology with five nodes and real-world video conference traffic. The results show that VCApather is capable of achieving high link utilization and balance, while also meeting predefined user metrics. Compared to other schemes, VCApather was found to satisfy 69.8% more QoE requirement and to yield an average bitrate improvement of 1.74×. © 2024 ACM.

关键词： Network layers

来源：评论

学校读者我要写书评

暂无评论

Improving Breast Cancer Detection Accuracy Through Random Forest Machine Learning Algorithm

Improving Breast Cancer Detection Accuracy Through Random Fo...

引用

International Conference on Advanced engineering, Technology and Applications, ICAETA 2024

作者： Agrawal, Atul Khanday, Akib MohiUd Din Alazzawi, Esraa Mohammed Bhushan, Bharat Baniya, Pashupati Jamil, Akhtar Department of Computer Science and Engineering ITS Engineering College Greater Noida India Department of Computer Science and Engineering Sharda University Greater Noida India Department of Computer Science and Software Engineering United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates Department of Computer Engineering University of Baghdad Al-Jadriya Baghdad10071 Iraq Department of Computer Science National University of Computer and Emerging Sciences Islamabad44000 Pakistan

ISBN: (纸本)9783031709234

Breast cancer continues to be a significant global health issue that greatly affects the well-being of people worldwide. Detecting breast cancer early is vital for improving the outcomes of patients. One promising method for breast cancer detection is the use of the Random Forest machine learning algorithm. In a recent research paper, we investigated how Random Forest can be used to predict breast cancer by employing explainable AI techniques. We analyzed the specific features that the algorithm relies on to classify breast cancer and highlighted the advantages of Random Forest compared to other machine learning algorithms in diagnosing breast cancer. Our model offers a well-thought-out, efficient, and easily understandable approach to predicting breast cancer using explainable machine learning techniques. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：