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

FSA-Net:A Cost-efficient Face Swapping Attention Network with Occlusion-Aware Normalization

intelligent Automation & Soft Computing 2023年第7期37卷 971-983页

作者： Zhipeng Bin Huihuang Zhao Xiaoman Liang Wenli Chen College of Computer Science and Technology Hengyang Normal UniversityHengyang421002China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002China

The main challenges in face swapping are the preservation and adaptive superimposition of attributes of two *** this study,the Face Swapping Attention Network(FSA-Net)is proposed to generate photoreal-istic face *** existing face-swapping methods ignore the blending attributes or mismatch the facial keypoint(cheek,mouth,eye,nose,etc.),which causes artifacts and makes the generated face silhouette *** address this problem,a novel reinforced multi-aware attention module,referred to as RMAA,is proposed for handling facial fusion and expression occlusion *** framework includes two *** the first stage,a novel attribute encoder is proposed to extract multiple levels of target face attributes and integrate identities and attributes when synthesizing swapped *** the second stage,a novel Stochastic Error Refinement(SRE)module is designed to solve the problem of facial occlusion,which is used to repair occlusion regions in a semi-supervised way without any *** proposed method is then compared with the current state-of-the-art *** obtained results demonstrate the qualitative and quantitative outperformance of the proposed *** details are provided at the footnote link and at https://***/view/fsa-net-official.

关键词： Attention face-swapping neural network face manipulation identity swap image translation

来源：评论

学校读者我要写书评

暂无评论

Parallel finite element computation of incompressible magnetohydrodynamics based on three iterations

引用

applied mathematics and Mechanics(English Edition) 2022年第1期43卷 141-154页

作者： Qili TANG Yunqing HUANG Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing&Information Processing of Ministry of EducationSchool of Mathematics and Computational ScienceXiangtan UniversityXiangtanHunan Province411105China

Based on local algorithms,some parallel finite element(FE)iterative methods for stationary incompressible magnetohydrodynamics(MHD)are *** approaches are on account of two-grid skill include two major phases:find the FE solution by solving the nonlinear system on a globally coarse mesh to seize the low frequency component of the solution,and then locally solve linearized residual subproblems by one of three iterations(Stokes-type,Newton,and Oseen-type)on subdomains with fine grid in parallel to approximate the high frequency *** error estimates with regard to two mesh sizes and iterative steps of the proposed algorithms are *** numerical examples are implemented to verify the algorithm.

关键词： local and parallel algorithm finite element(FE)method iteration stationary incompressible magnetohydrodynamics(MHD)

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Warning Signs for Vehicles Based on Automatic Navigation Algorithms 1

引用

13th International Conference on Computer Engineering and Networks, CENet 2023

作者： Wang, Fangyan Jiao, Ge Lu, Jinjia Yuan, Yiping College of Computer Science and Technology Hengyang Normal University Hunan Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hunan Hengyang421002 China

ISBN: (数字)9789819992393

ISBN: (纸本)9789819992386

Traditional warning signs use human retrograde placement;there are problems such as short warning distances, imprecise placement positions, and difficult positioning of accident points. According to statistics, the user's reaction time after facing a car accident is generally 1.05–1.28 s, and the reaction time to light is 0.225 s. The reaction time for the user to deal with a car accident independently is completely insufficient, and these reasons are the main reasons for secondary traffic accidents. In order to solve this social pain point, we designed a new intelligent triangle warning sign. The intelligent warning sign is installed with an intelligent base at the bottom, and it gets the traffic accident point precisely located when the intelligent warning sign is working, and the system gets the vehicle accident point and reminds the vehicles behind to pay attention to avoid, realizing the three-way interconnection of drivers and passengers, traffic control departments, and the personnel of the vehicles behind, and using the automatic navigation algorithm to realize the automatic navigation of the warning sign to protect the safety of drivers and passengers. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Exploiting Multi-Decision and Deep Refinement for Ultrasound Image Segmentation 48

Exploiting Multi-Decision and Deep Refinement for Ultrasound...

引用

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

作者： Liu, Wenjing Li, Xuanya Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Baidu Inc Beijing100085 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781728163277

In this paper, we propose a novel convolutional neural network (MDR-Net) for ultrasound image segmentation by exploiting multi-decision and deep refinement of the target. Our MDR-Net consists of two main parts, i.e., a multi-decision module (MDM) and a deep refinement module (DRM). Specifically, the MDM effectively addresses the issue of inconspicuous target regions in ultrasound images by combining multi-scale features and multi-receptive field self-attention to enhance the discriminative representation of features and diagnose feature points multiple times. In addition, to alleviate the problem of blurred boundaries and severe speckle noise, the DRM progressively fuses multi-scale features and makes the fused features interact with higher-level features to refine the target details step by step. Finally, we evaluate the proposed method on two publicly available datasets, namely BUSI and UDIAT. We achieve a Dice of 0.8265 and 0.8827 on the two datasets, which are at least 2% and 1.24% higher than other state-of-the-art ultrasound image segmentation methods. © 2023 IEEE.

关键词： Convolutional neural network Deep refinement Multi-decision Ultrasound image segmentation

来源：评论

学校读者我要写书评

暂无评论

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs

引用

Frontiers of Computer Science 2023年第4期17卷 97-107页

作者： Jia LI Wenjun LI Yongjie YANG Xueying YANG School of Information Engineering Hunan Industry PolytechnicChangsha 410036China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha 410015China Chair of Economic Theory Saarland UniversitySaarbrücken 66123Germany

In the minimum degree vertex deletion problem,we are given a graph,a distinguished vertex in the graph,and an integer κ,and the question is whether we can delete at most κ vertices from the graph so that the distinguished vertex has the unique minimum *** maximum degree vertex deletion problem is defined analogously but here we want the distinguished vertex to have the unique maximum *** is known that both problems areΨ-hard and fixed-parameter intractable with respect to some natural *** this paper,we study the(parameterized)complexity of these two problems restricted to split graphs,p-degenerate graphs,and planar *** study provides a comprehensive complexity landscape of the two problems restricted to these special graphs.

关键词： minimum degree maximum degree vertex deletion split graphs planar graphs parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

Noise-tolerant fixed-time leader-follower consensus controller design for multi-agent systems via fuzzy-neural-network

引用

Neural Computing and Applications 2025年 1-23页

作者： Dai, Jianhua Tan, Ping Xiao, Lin Wang, Zidong He, Yongjun Zuo, Qiuyue Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing MOE-LCSM Hunan Normal University Hunan Changsha410081 China Department of Computer Science Brunel University London UxbridgeUB8 3PH United Kingdom

The leader-follower consensus control problem in multi-agent systems (MASs) is critical and has received significant attention. However, the simultaneous achievement of fixed-time stability and robustness is often challenging in MASs due to their inherent complexity and uncertainty. This paper developed a controller based on the proposed noise-tolerant fixed-time fuzzy neural network (NF-FNN) model to realize the leader-follower consensus of MASs. Specifically, the introduction of an integral error term makes the NF-FNN model have powerful noise tolerance, and a fuzzy gain parameter generated by the Takagi-Sugeno fuzzy logic system makes the NF-FNN model have fuzzy adaptiveness. In addition, a new partition-sign-by-power activation function is developed to ensure fixed-time stability of the NF-FNN model. Theoretical analysis and comparative simulations confirm the superb swift stability and excellent noise tolerance of controllers based on the NF-FNN model for achieving the leader-follower consensus of MASs, as compared with existing methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

A Finite Element Variational Multiscale Method for Stationary Incompressible Magnetohydrodynamics Equations

引用

Advances in applied mathematics and Mechanics 2023年第5期15卷 1142-1165页

作者： Huayi Huang Yunqing Huang Qili Tang Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of IntelligentComputing&Information Processing of Ministry of EducationSchool of Mathematics and Computational ScienceXiangtan UniversityXiangtanHunan 411105China

In this paper,we propose a variational multiscale method(VMM)for the stationary incompressible magnetohydrodynamics *** method is defined by large-scale spaces for the velocity field and the magnetic field,which aims to solve flows at high Reynolds *** provide a new VMM formulation and prove its stability and ***,some numerical experiments are presented to indicate the optimal convergence of our method.

关键词： Variational multiscale method stationary incompressible magnetohydrodynamics large-scale spaces stability and convergence high Reynolds numbers

来源：评论

学校读者我要写书评

暂无评论

αSetup-PCTL:An Adaptive Setup-Based Two-Level Preconditioner for Sequence of Linear Systems of Three-Temperature Energy Equations

引用

Communications in Computational Physics 2022年第10期32卷 1287-1309页

作者： Silu Huang Xiaoqiang Yue Xiaowen Xu Laboratory of Computational Physics Institute of Applied Physics and ComputationalMathematicsBeijing 100088China National Center for Applied Mathematics in Hunan Key Laboratory of Intelligent Computing and Information Processing of Ministry of EducationHunan Key Laboratory for Computation and Simulation in Science and EngineeringXiangtan UniversityXiangtan 411105China

The iterative solution of the sequence of linear systems arising from threetemperature(3-T)energy equations is an essential component in the numerical simulation of radiative hydrodynamic(RHD)***,due to the complicated application features of the RHD problems,solving 3-T linear systems with classical preconditioned iterative techniques is *** address this difficulty,a physicalvariable based coarsening two-level(PCTL)preconditioner has been proposed by dividing the fully coupled system into four individual easier-to-solve *** its nearly optimal complexity and robustness,the PCTL algorithm suffers from poor efficiency because of the overhead associatedwith the construction of setup phase and the solution of ***,the PCTL algorithm employs a fixed strategy for solving the sequence of 3-T linear systems,which completely ignores the dynamically and slowly changing features of these linear *** address these problems and to efficiently solve the sequence of 3-T linear systems,we propose an adaptive two-level preconditioner based on the PCTL algorithm,referred to as α*** adaptive strategies of the αSetup-PCTL algorithm are inspired by those of αSetup-AMG algorithm,which is an adaptive-setup-based AMG solver for sequence of sparse linear *** proposed αSetup-PCTL algorithm could adaptively employ the appropriate strategies for each linear system,and thus increase the overall *** results demonstrate that,for 36 linear systems,the αSetup-PCTL algorithm achieves an average speedup of 2.2,and a maximum speedup of 4.2 when compared to the PCTL algorithm.

关键词： Sequence of linear systems sparse linear solver preconditioning methods radiation hydrodynamics simulation

来源：评论

学校读者我要写书评

暂无评论

Spectral Galerkin Approximation of Fractional Optimal Control Problems with Fractional Laplacian

引用

Advances in applied mathematics and Mechanics 2023年第6期15卷 1631-1654页

作者： Jiaqi Zhang Yin Yang Zhaojie Zhou School of Mathematics and Computational Science Xiangtan UniversityHunan Key Laboratory for Computation and Simulation in Science and EngineeringKey Laboratory of Intelligent Computing and Information Processing of Ministry of EducationXiangtan 411105HunanChina School of Mathematics and Computational Science Xiangtan UniversityNational Center for Applied Mathematics in HunanHunan International Scientific and Technological Innovation Cooperation Base of Computational ScienceXiangtan 411105HunanChina School of Mathematics and Statistics Shandong Normal UniversityJinan 250014ShandongChina

In this paper spectral Galerkin approximation of optimal control problem governed by fractional elliptic equation is *** deal with the nonlocality of fractional Laplacian operator the Caffarelli-Silvestre extension is *** first order optimality condition of the extended optimal control problem is derived.A spectral Galerkin discrete scheme for the extended problem based on weighted Laguerre polynomials is developed.A priori error estimates for the spectral Galerkin discrete scheme is *** experiments are presented to show the effectiveness of our methods and to verify the theoretical findings.

关键词： Fractional Laplacian optimal control problem Caffarelli-Silvestre extension weighted Laguerre polynomials

来源：评论

学校读者我要写书评

暂无评论

Pseudo Multi-Source Domain Extension and Selective Pseudo-Labeling for Unsupervised Domain Adaptive Medical Image Segmentation 48

Pseudo Multi-Source Domain Extension and Selective Pseudo-La...

引用

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

作者： Liu, Xiaokang Wang, Zhiqiang Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Xiangnan University College of Medical Imaging Laboratory and Rehabilitation Chenzhou423000 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781728163277

Unsupervised domain adaptation (UDA) attracts extra attention in medical image processing because no additional labels are required when adapting to different distributions. In this work, we propose a novel unsupervised domain adaptation framework named as Domain Expansion and PseudoLabeling (DEPL). We extend the domain of a labeled source domain data to four different distributed domains and use adversarial learning to align the image appearance level and feature level from the four different domains to the unlabeled target domain. In addition, we propose a selective pseudolabeling mechanism, namely using strong confidence pseudolabeling to boost model performance. We evaluate our model for the MR to CT adaptation segmentation task on the public dataset MMWHS. Compared to seven other state-of-the-art segmentation methods, our DEPL achieves the best Dice similarity coefficient by 82.4%, which is at least 3.9% higher than the other UDA segmentation methods. © 2023 IEEE.

关键词： Adversarial learning domain extension Image segmentation Selective pseudo-labeling Unsupervised domain adaptive

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：