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

Cat Swarm Algorithm Generated Based on Genetic Programming Framework Applied in Digital Watermarking

computers, Materials & Continua 2025年第5期83卷 3135-3163页

作者： Shu-Chuan Chu Libin Fu Jeng-Shyang Pan Xingsi Xue Min Liu School of Artificial Intelligence Nanjing University of Information Science and TechnologyNanjing210000China College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266000China Department of Information Management Chaoyang University of TechnologyTaichung40601TaiwanChina School of Information Science and Engineering Fujian University of TechnologyFuzhou350000China Key Laboratory of Hydrometeorological Disaster Mechanism and Warning of Ministry of Water Resource Nanjing University of Information Science and TechnologyNanjing210000China

Evolutionary algorithms have been extensively utilized in practical ***,manually designed population updating formulas are inherently prone to the subjective influence of the *** programming(GP),characterized by its tree-based solution structure,is a widely adopted technique for optimizing the structure of mathematical models tailored to real-world *** paper introduces a GP-based framework(GPEAs)for the autonomous generation of update formulas,aiming to reduce human *** modifications to tree-based GP have been instigated,encompassing adjustments to its initialization process and fundamental update operations such as crossover and mutation within the *** designing suitable function sets and terminal sets tailored to the selected evolutionary algorithm,and ultimately derive an improved update *** Cat Swarm Optimization Algorithm(CSO)is chosen as a case study,and the GP-EAs is employed to regenerate the speed update formulas of the *** validate the feasibility of the GP-EAs,the comprehensive performance of the enhanced algorithm(GP-CSO)was evaluated on the CEC2017 benchmark ***,GP-CSO is applied to deduce suitable embedding factors,thereby improving the robustness of the digital watermarking *** experimental results indicate that the update formulas generated through training with GP-EAs possess excellent performance scalability and practical application proficiency.

关键词： Cat swarm algorithm genetic programming digital watermarking update mode mode generation framework

来源：评论

学校读者我要写书评

暂无评论

Video Corpus Moment Retrieval with Query-specific Context Learning and Progressive Localization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第6期35卷 5659-5670页

作者： Zhang, Long Song, Peipei Duan, Zhangling Wang, Shuo Chang, Xiaojun Yang, Xun School of Information Science and Technology Hefei230026 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230026 China University of Science and Technology of China School of Information Science and Technology Hefei230026 China Department of Computer Vision Abu Dhabi United Arab Emirates University of Science and Technology of China MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition China

Video corpus moment retrieval (VCMR) aims to retrieve a moment from a large corpus of untrimmed videos corresponding to a given language query. However, existing methods often fall short due to their reliance on simple cross-modal attention mechanisms and one-stop localization, which fail to handle the complex multimodal information and large search space effectively. To address these challenges, we propose a novel VCMR method with Query-specific Context Learning and Progressive Localization (QCLPL). First, we construct query-specific multimodal contexts that capture complementary and consistent semantics across subtitles and frames, ensuring informative and efficient context building. We further introduce a semantic contrastive loss to refine these multimodal contexts, filtering out query-irrelevant information. Additionally, we introduce a progressive localization strategy that transforms the moment localization task into a two-stage process. By classifying frames into foreground and background regions, we present a simplified binary classification problem before boundary prediction, constrained by a region-aware loss. This progressive approach leverages region priors to improve subsequent moment localization. Extensive experiments on the TVR and DiDeMo datasets demonstrate that our method significantly outperforms existing approaches, setting a new state of the art for VCMR. © 1991-2012 IEEE.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Image Dehazing Algorithm Based on Color Correction and Channel Compensation Prior 4

Image Dehazing Algorithm Based on Color Correction and Chann...

引用

4th International Conference on Information science, Electrical, and Automation Engineering, ISEAE 2022

作者： Xie, Shangyou Zhang, Jun School of Artificial Intelligence and Computer Science Jiangnan university Wuxi China School of Artificial Intelligence and Computer Science Jiangnan university China Jiangsu Key Laboratory of Media Design and Software Technology Wuxi China

ISBN: (纸本)9781510655157

The dark channel prior is a statistical conclusion based on outdoor haze-free images and it is widely used in haze removal because of its effectiveness. However, it does not work well when dealing with images containing sky areas . The reason is values of R,G,B channels are very high in this region, i.e. the dark channel prior does not hold . Therefore, the transmission of this region is overestimated, resulting in serious halo artifacts and noise amplification in the recovered image. To solve this problem, an image dehazing algorithm based on the inverse channel compensation prior is proposed in this paper. According to observation and experimental verification, for haze-free images, when the pixels in the sky region of the image have higher values in a certain channel, their inverse channel values are lower even tend to be close to zero. Therefore, when finding the dark channel of the image, the inverse channel is considered for compensation so that the pixels in the failed sky region also satisfy the dark channel prior assumption. It is worth noting that the method based on the inverse channel compensation in this paper can obtain the accurate transmittance, and the sky region will not produce distortion and noise amplification even if the lower constraint on transmission is not set . In addition, a simple and effective color cast judgment and adaptive correction method is proposed based on the characteristics of atmospheric light, and adaptive color correction if necessary, which makes the method in this paper effective for the enhancement of sand dust images, extending the applicable scenarios of the algorithm. © 2022 SPIE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

DTN Routing Algorithm Based on Social Center and Classifier 20th

DTN Routing Algorithm Based on Social Center and Classifie...

引用

20th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2024

作者： Cui, Jianqun Gao, Mengnan Chang, Yanan Yan, Huiran Ma, Zhiyuan Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning Central China Normal University Hubei Wuhan430079 China Department of Computer Science Central China Normal University Wuhan China

ISBN: (纸本)9789819628636

Opportunistic Mobile Social Networks (OMSNs) are intermittent complex networks consisting of mobile nodes equipped with communication devices, characterized by unstable connections, high node mobility, and limited resources. Existing OSMN routing algorithms, when selecting the next hop node, either focus on limited information within the network and employ simple fusion techniques or consider excessive redundant information in complex designs. To address these issues, this paper proposes an OSMN routing algorithm RFSC based on social centrality and classifier. The algorithm introduces a social circle partitioning algorithm and designs the routing algorithm SCRouter by considering the social attributes of nodes, node-specific situations, and message properties. Subsequently, the SCRouter algorithm is integrated with classifier to enhance the algorithm’s anti-interference capabilities and reduce the consideration of redundant metrics. Furthermore, the RFSC algorithm introduces an adaptive cache replica allocation strategy to improve data transmission efficiency. Experimental results demonstrate that compared to CARA, Prophet, SprayAndWait, CPN_ASW and INR_PRA algorithms, the RFSC enhances delivery rates by 139.6%, 16.6%, 39.5%, 12.0% and 12.7% respectively. It effectively reduces transmission delays and alleviates network congestion. © IFIP International Federation for Information Processing 2025.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A deep neural network based surrogate model for damage identification in full-scale structures with incomplete noisy measurements

引用

Frontiers of Structural and Civil Engineering 2024年第3期18卷 393-410页

作者： Tram BUI-NGOC Duy-Khuong LY Tam T TRUONG Chanachai THONGCHOM T.NGUYEN-THOI Laboratory for Computational Mechanics Institute for Computational Science and Artificial IntelligenceVan Lang UniversityHo Chi Minh City 70000Vietnam Faculty of Mechanical-Electrical and Computer Engineering School of TechnologyVan Lang UniversityHo Chi Minh City 70000Vietnam Faculty of Civil Engineering School of TechnologyVan Lang UniversityHo Chi Minh City 70000Vietnam Department of Computer Science Aarhus UniversityAarhus 8000Denmark Thammasat University research unit in structural and foundation engineering Department of Civil EngineeringThammasat UniversityPathumthani 12120Thailand Laboratory for Applied and Industrial Mathematics Institute for Computational Science and Artificial IntelligenceVan Lang UniversityHo Chi Minh City 70000Vietnam Thammasat School of Engineering Thammasat UniversityPathumthani 12120Thailand

The paper introduces a novel approach for detecting structural damage in full-scale structures using surrogate models generated from incomplete modal data and deep neural networks(DNNs).A significant challenge in this field is the limited availability of measurement data for full-scale structures,which is addressed in this paper by generating data sets using a reduced finite element(FE)model constructed by SAP2000 software and the MATLAB programming *** surrogate models are trained using response data obtained from the monitored structure through a limited number of measurement *** proposed approach involves training a single surrogate model that can quickly predict the location and severity of damage for all potential *** achieve the most generalized surrogate model,the study explores different types of layers and hyperparameters of the training algorithm and employs state-of-the-art techniques to avoid overfitting and to accelerate the training *** approach’s effectiveness,efficiency,and applicability are demonstrated by two numerical *** study also verifies the robustness of the proposed approach on data sets with sparse and noisy measured ***,the proposed approach is a promising alternative to traditional approaches that rely on FE model updating and optimization algorithms,which can be computationally *** approach also shows potential for broader applications in structural damage detection.

关键词： vibration-based damage detection deep neural network full-scale structures finite element model updating noisy incomplete modal data

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Method for Colon Polyp Segmentation with Better Universality 1

A Deep Learning Method for Colon Polyp Segmentation with Bet...

引用

1st IEEE International Conference on Medical artificial intelligence, MedAI 2023

作者： Wang, Yuanyuan Deng, Zhaohong School of Artificial Intelligence and Computer Science Jiangnan University Jiangsu Key Laboratory of Media Design and Software Technology Wuxi China ZJLab Wuxi China

ISBN: (纸本)9798350358780

Colon polyp segmentation is an important work in the adjuvant treatment of colon diseases. Traditional colon polyp segmentation methods are mainly designed according to the underlying characteristics of polyps, but the size of polyp tissues is usually different. Thus the segmentation accuracy of such methods is low. In recent years, deep learning colon polyp segmentation methods developed based on vision Transformer have higher segmentation accuracy than traditional methods on some colon polyp datasets. However, this method is more specific to a certain dataset and is not universal. In order to address the above challenges, this paper proposes a general colon polyp segmentation method-MixFormNet, which can effectively improve the segmentation accuracy of multiple datasets. MixFormNet is a encoder-decoder structure. MixFormNet utilizes a Mix Transformer with multi-scale output as an encoder. Then this paper designs a new decoder structure for multi-scale output. The decoder designed in this paper processes the characteristics of the different scale feature maps output from the encoder separately, with the aim of maximizing the use of the feature information contained in the deep and shallow feature maps. Specifically, the low-level output of the encoder has a large resolution but contains weak semantic information. Therefore, the convolutional neural network is constructed in the decoder and applied to the low-level output in order to obtain richer local feature information. A large number of experiments have shown that MixFormNet effectively improves the segmentation accuracy of multiple colon polyp datasets. In particular, the mDice of the CVC-ClinicDB dataset reached 0.94. It is proved that MixFormNet has good universality and effectiveness in improving the segmentation accuracy of colon polyp datasets. © 2023 IEEE.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving 33

Grounding Planning Tasks Using Tree Decompositions and Itera...

引用

33rd International Conference on Automated Planning and Scheduling, ICAPS 2023

作者： Corrêa, Augusto B. Hecher, Markus Helmert, Malte Longo, Davide Mario Pommerening, Florian Woltran, Stefan University of Basel Switzerland TU Wien Institute of Logic and Computation Austria Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States

ISBN: (纸本)1577358813

Classical planning tasks are commonly described in a first-order language. However, most classical planners translate tasks by grounding them and then rewriting them into a propositional language. In recent years, the grounding step has become a larger bottleneck. In this work, we study how to improve it. We build on top of the most common grounder for planning tasks which uses Datalog to find all reachable atoms and actions. Inspired by recent progress in lifted planning, database theory, and algorithmics, we develop a new method to ground these Datalog programs. Our algorithm can ground more instances than the baseline, and most tasks it cannot ground are out of reach from any ground planner. Copyright © 2023, Association for the Advancement of artificial intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How Does Oversampling Affect the Performance of Classification Algorithms 28

How Does Oversampling Affect the Performance of Classificati...

引用

28th IEEE Symposium on computers and Communications, ISCC 2023

作者： Xiang, Zhizhen Xu, Yingying Tang, Zhenzhou College of Computer Science and Artificial Intelligence Wenzhou University Wenzhou325035 China Wenzhou University Wenzhou Key Laboratory for Intelligent Networking 325035 China

ISBN: (纸本)9798350300482

To address the issue of imbalanced datasets classification, this study explores how different oversampling algorithms and imbalance ratios affect the performance of classification algorithms. Two oversampling algorithms, including random oversampling and Synthetic Minority Oversampling Technique (SMOTE), are used to adjust the imbalance ratio of the training dataset to 999:1, 99:1, 9:1, 3:1, and 1:1. Four classification methods, including the Convolutional Neural Network, Vision Transformer, XGBoost and CatBoost, are evaluated using performance metrics such as precision, recall, AUC, and F2-Score. We conduct more than 240 experiments and observe that oversampling ratio has a significant positive impact on AUC and recall rate, but a negative impact on precision. The study also identifies the best oversampling algorithm and imbalance ratio for each classification algorithm. It is noteworthy that the Vision Transformer algorithm used in this study has not been employed in previous research on imbalanced data classification. © 2023 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

MeshWGAN: Mesh-to-Mesh Wasserstein GAN with Multi-Task Gradient Penalty for 3D Facial Geometric Age Transformation

引用

IEEE Transactions on Visualization and computer Graphics 2024年第8期30卷 4927-4940页

作者： Zhang, Jie Zhou, Kangneng Luximon, Yan Lee, Tong-Yee Li, Ping The Hong Kong Polytechnic University Department of Computing The School of Design Hong Kong University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China The Hong Kong Polytechnic University School of Design Hong Kong Laboratory for Artificial Intelligence in Design Hong Kong National Cheng-Kung University Department of Computer Science and Information Engineering Tainan70101 Taiwan

As the metaverse develops rapidly, 3D facial age transformation is attracting increasing attention, which may bring many potential benefits to a wide variety of users, e.g., 3D aging figures creation, 3D facial data augmentation and editing. Compared with 2D methods, 3D face aging is an underexplored problem. To fill this gap, we propose a new mesh-to-mesh Wasserstein generative adversarial network (MeshWGAN) with a multi-task gradient penalty to model a continuous bi-directional 3D facial geometric aging process. To the best of our knowledge, this is the first architecture to achieve 3D facial geometric age transformation via real 3D scans. As previous image-to-image translation methods cannot be directly applied to the 3D facial mesh, which is totally different from 2D images, we built a mesh encoder, decoder, and multi-task discriminator to facilitate mesh-to-mesh transformations. To mitigate the lack of 3D datasets containing children's faces, we collected scans from 765 subjects aged 5-17 in combination with existing 3D face databases, which provided a large training dataset. Experiments have shown that our architecture can predict 3D facial aging geometries with better identity preservation and age closeness compared to 3D trivial baselines. We also demonstrated the advantages of our approach via various 3D face-related graphics applications. © 1995-2012 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Cftracker: Object tracking by channel filtering 6

Cftracker: Object tracking by channel filtering

引用

6th International Conference on Robot Systems and Applications, ICRSA 2023

作者： Liu, Xinwei Lu, Tao Wang, Jiaming Fang, Wenhua Fu, Shichang Hubei Provincial Key Laboratory of Intelligent Robot School of Computer Science and Engineering School of Artificial Intelligence Wuhan Institute of Technology Wuhan430073 China

ISBN: (纸本)9798400708039

In visual object tracking, the background noise information in the target scene is one of the main challenging factors affecting the tracking performance, while the existing trackers do not make full use of the background information which causes tracking drift of the trackers when facing complex background noise (such as occlusion and the background changes). To address this issue, in this work, we propose a novel channel filtering module(CFM) that leverages global context information of frames to assist in tracking. The proposed method effectively reduces the interference of background information by employing an improved CFM. Specifically, our approach consists of a channel processing module and a spatial filtering module. Finally, we propose a tracking framework, called CFTracker, which incorporates CFM to assist in tracking. This framework enhances the discriminability between the target and the background, thereby improving tracking performance. Experimental results demonstrate the promising performance of our CFTracker on four challenging datasets. Furthermore, our method achieves improved tracking performance without significantly increasing the computational overhead of the tracking network. © 2023 ACM.

关键词： Information filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：