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

High-Fidelity and High-Efficiency Talking Portrait Synthesis With Detail-Aware Neural Radiance Fields

IEEE Transactions on Visualization and computer Graphics 2024年 PP卷 PP-PP页

作者： Wang, Muyu Zhao, Sanyuan Dong, Xingping Shen, Jianbing Wuhan University School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan430072 China Beijing Institute of Technology School of Computer Science Beijing China University of Macau State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science China

In this paper, we propose a novel rendering framework based on neural radiance fields (NeRF) named HH-NeRF that can generate high-resolution audio-driven talking portrait videos with high fidelity and fast rendering. Specifically, our framework includes a detail-aware NeRF module and an efficient conditional super-resolution module. Firstly, a detail-aware NeRF is proposed to efficiently generate a high-fidelity low-resolution talking head, by using the encoded volume density estimation and audio-eye-aware color calculation. This module can capture natural eye blinks and high-frequency details, and maintain a similar rendering time as previous fast methods. Secondly, we present an efficient conditional super-resolution module on the dynamic scene to directly generate the high-resolution portrait with our low-resolution head. Incorporated with the prior information, such as depth map and audio features, our new proposed efficient conditional super resolution module can adopt a lightweight network to efficiently generate realistic and distinct high-resolution videos. Extensive experiments demonstrate that our method can generate more distinct and fidelity talking portraits on high resolution (900 × 900) videos compared to state-of-the-art methods. Our code is available at https://***/muyuWang/HHNeRF. © 1995-2012 IEEE.

关键词： Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

FedSSP: federated graph learning with spectral knowledge and personalized preference 24

FedSSP: federated graph learning with spectral knowledge and...

引用

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

作者： Zihan Tan Guancheng Wan Wenke Huang Mang Ye National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China and Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

ISBN: (纸本)9798331314385

Personalized Federated Graph Learning (pFGL) facilitates the decentralized training of Graph Neural networks (GNNs) without compromising privacy while accommodating personalized requirements for non-IID participants. In cross-domain scenarios, structural heterogeneity poses significant challenges for pFGL. Nevertheless, previous pFGL methods incorrectly share non-generic knowledge globally and fail to tailor personalized solutions locally under domain structural shift. We innovatively reveal that the spectral nature of graphs can well reflect inherent domain structural shifts. Correspondingly, our method overcomes it by sharing generic spectral knowledge. Moreover, we indicate the biased message-passing schemes for graph structures and propose the personalized preference module. Combining both strategies, we propose our pFGL framework FedSSP which Shares generic Spectral knowledge while satisfying graph Preferences. Furthermore, We perform extensive experiments on cross-dataset and cross-domain settings to demonstrate the superiority of our framework. The code is available at https://***/OakleyTan/FedSSP.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Auto-scalable and fault-tolerant load balancing mechanism for cloud computing based on the proof-of-work election

引用

Science China(Information Sciences) 2022年第1期65卷 131-146页

作者： Xiaoqin FENG Jianfeng MA Shaobin LIU Yinbin MIAO Ximeng LIU School of Cyber Engineering Xidian University State Key Laboratory of Cryptology Shaanxi Key Laboratory of Network and System Security Xidian University College of Mathematics and Computer Science Fuzhou University

Load balancing mechanism in technologies such as cloud computing has provided a huge opportunity for the development of large-scale projects. Although the conventional view is to build mechanisms that adopt a dynamic load balancing strategy, existing strategies cannot automatically scale platform(network) servers(nodes) to adapt for dynamic requests, but only guarantee load balancing for the pre-deployed nodes, thereby increasing resource consumption and decreasing networks' efficiency. We contend that existing load balancing mechanisms are inadequate for deploying dynamic applications. In this regard, we first adopt both load balancing and cloud computing virtualization technologies to modularly design a load balancing mechanism that provides a dynamically auto-scalable solution for large-scale and dynamic computing scenarios. Furthermore, we adopt the proof-of-work consensus, for a novel use during the lifecycle of master nodes in case of system failure caused by a failed master node, to demonstrate a fault-tolerant load balancing mechanism. We theoretically evaluate the security requirement of our mechanism and analyze its performance. Experimental results show that the mechanism supports auto-scalability and has a better performance compared to existing mechanisms such as the ordinary cluster.

关键词： cloud computing load balancing auto-scalable proof-of-work fault-tolerant

来源：评论

学校读者我要写书评

暂无评论

Efficient Wildcard Searchable Symmetric Encryption with Forward and Backward Security 1st

Efficient Wildcard Searchable Symmetric Encryption with For...

引用

1st International Conference on Artificial Intelligence Security and Privacy, AIS and P 2023

作者： Zhang, Xi Su, Ye Wei, Zhongkai Shen, Wenting Qin, Jing College of Computer and Cyber Security Hebei Normal University Shijiazhuang050024 China Hebei Provincial Key Laboratory of Network and Information Security Hebei Normal University Shijiazhuang050024 China School of Information Science and Engineering Shandong Normal University Jinan250358 China School of Mathematics Shandong University Jinan250100 China College of Computer Science and Technology Qingdao University Qingdao266071 China

ISBN: (纸本)9789819997848

Wildcard Searchable Symmetric Encryption can achieve flexibility and pattern matching while protecting data privacy. There is a promising future for combining secure wildcard search with emerging technologies such as AI. However, there are challenges in reducing the communication cost and improving security. In this paper, we propose an efficient wildcard searchable symmetric encryption with forward and backward security. The complexity of communication costs in the search protocol is O(1), independent of the number of characters of wildcard keywords, or files in the search result. It is achieved by a double-compressed index in which the character set and file identifiers are encoded simultaneously. Then, the double-compressed index provides a possibility to achieve oblivious keyword query and update, so that the proposed scheme only reveals the query type (search or update) without anything else. It achieves forward and backward security using the distributed multi-point function and an additively homomorphic symmetric encryption scheme. Detailed security proof and the theoretical comparison show the improvement in security and efficiency. The acceptable overheads of the proposed scheme are presented by the extensive performance evaluation. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

A provable decision rule for out-of-distribution detection 24

A provable decision rule for out-of-distribution detection

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Xinsong Ma Xin Zou Weiwei Liu School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence and Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China

Out-of-distribution (OOD) detection task plays the key role in reliable and safety-critical applications. Existing researches mainly devote to designing or training the powerful score function but overlook investigating the decision rule based on the proposed score function. Different from previous work, this paper aims to design a decision rule with rigorous theoretical guarantee and well empirical performance. Specifically, we provide a new insight for the OOD detection task from a hypothesis testing perspective and propose a novel generalized Benjamini Hochberg (g-BH) procedure with empirical p-values to solve the testing problem. Theoretically, the g-BH procedure controls false discovery rate (FDR) at pre-specified level. Furthermore, we derive an upper bound of the expectation of false positive rate (FPR) for the g-BH procedure based on the tailed generalized Gaussian distribution family, indicating that the FPR of g-BH procedure converges to zero in probability. Finally, the extensive experimental results verify the superiority of g-BH procedure over the traditional threshold-based decision rule on several OOD detection benchmarks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mixture Gaussian Distribution-Based Collaborative Reinforcement Learning for 3D UAV Localization Optimization Against Jamming Attacks

Mixture Gaussian Distribution-Based Collaborative Reinforcem...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Zhu, Yujiao Chen, Mingzhe Wang, Sihua Liu, Yuchen Li, Gaolei Yin, Changchuan Quek, Tony Q.S. Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Network Beijing100876 China Singapore University of Technology and Design 487372 Singapore University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL33146 United States North Carolina State University Department of Computer Science RaleighNC27695 United States Shanghai Jiao Tong University School of Electronic Information and Electrical Engineering Shanghai200240 China

ISBN: (纸本)9798350351255

In this paper, the optimization of unmanned aerial vehicle (UAV) localization under jamming attacks is studied. In the considered network, a base station (BS) collaborates with an active UAV to localize a target UAV. During this positioning process, a jamming UAV transmits discontinuous signals to passive UAVs to interfere the distance information measurement. To localize the target UAV under jamming attacks, the BS jointly use two localization methods: 1) generative adversarial network (GAN)-based positioning method and 2) time difference of arrival (TDOA)-based positioning method. Since GAN-based positioning method cannot defense in a strong jamming signal while TDOA-based positioning method may consume more energy and sacrifice localization accuracy, the BS must select an appropriate positioning method (GAN-based or TDOA-based methods) and four distance measurement information of passive UAVs to estimate the position of the target UAV. This problem is formulated as an optimization problem whose goal is to minimize the positioning error between the estimated and the ground truth positions of the target UAV while considering jamming attacks and the trajectory of passive UAVs. To solve this problem, we propose a mixture Gaussian distribution model-based collaborative reinforcement learning (RL) method which enables the active UAV to determine its transmit power and trajectory, and enables the BS to select the most appropriate subsets of distance measurement information and the optimal positioning method according to the movement of passive UAVs and the unknown jamming attack pattern of the jamming UAV. Simulation results show the proposed method can reduce the positioning error of the target UAV by up to 36.5% compared to the method that does not consider the GAN-based positioning method. © 2024 IEEE.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Parameter disparities dissection for backdoor defense in heterogeneous federated learning 24

Parameter disparities dissection for backdoor defense in het...

引用

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

作者： Wenke Huang Mang Ye Zekun Shi Guancheng Wan He Li Bo Du National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China and Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

ISBN: (纸本)9798331314385

Backdoor attacks pose a serious threat to federated systems, where malicious clients optimize on the triggered distribution to mislead the global model towards a predefined target. Existing backdoor defense methods typically require either homogeneous assumption, validation datasets, or client optimization conflicts. In our work, we observe that benign heterogeneous distributions and malicious triggered distributions exhibit distinct parameter importance degrees. We introduce the Fisher Discrepancy Cluster and Rescale (FDCR) method, which utilizes Fisher Information to calculate the degree of parameter importance for local distributions. This allows us to reweight client parameter updates and identify those with large discrepancies as backdoor attackers. Furthermore, we prioritize rescaling important parameters to expedite adaptation to the target distribution, encouraging significant elements to contribute more while diminishing the influence of trivial ones. This approach enables FDCR to handle backdoor attacks in heterogeneous federated learning environments. Empirical results on various heterogeneous federated scenarios under backdoor attacks demonstrate the effectiveness of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving Generalized Zero-Shot Learning by Exploring the Diverse Semantics from External Class Names

Improving Generalized Zero-Shot Learning by Exploring the Di...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Yapeng Li Yong Luo Zengmao Wang Bo Du National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering Institute of Artificial Intelligence School of Computer Science Wuhan University Wuhan China Hubei Luojia Laboratory Wuhan China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Generalized Zero-Shot Learning (GZSL) methods often assume that the unseen classes are similar to seen classes, and thus perform poor when unseen classes are dissimilar to seen classes. Although some existing GZSL approaches can alleviate this issue by leveraging additional semantic information from test unseen classes, their generalization ability to dissimilar unseen classes is still unsatisfactory. This motivates us to study GZSL in the more practical setting, where unseen classes can be either similar or dissimilar to seen classes. In this paper, we propose a simple yet effective GZSL framework by exploring diverse semantics from external class names (DSECN), which is simultaneously robust on the similar and dissimilar unseen classes. This is achieved by introducing diverse semantics from external class names and aligning the introduced semantics to visual space using the classification head of pretrained network. Furthermore, we show that the design idea of DSECN can easily be integrate into other advanced GZSL approaches, such as the generative-based ones, and enhance their robustness for dissimilar unseen classes. Extensive experiments in the practical setting including both similar and dissimilar unseen classes show that our method significantly outperforms the state-of-the-art approaches on all datasets and can be trained very efficiently.

关键词： Visualization computer vision Zero-shot learning Semantics Robustness Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Vehicular Cooperative Sensing: A Graph Attention Based Reinforcement Learning Approach

Performance Optimization for Vehicular Cooperative Sensing: ...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Li, Xuefei Chen, Mingzhe Liu, Danpu Zhang, Zhilong Quek, Tony Q. S. Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL33146 United States Information Systems Technology and Design Pillar Singapore University of Technology and Design 487372 Singapore

ISBN: (纸本)9798350351255

In this paper, the problem of collaborative vehicle sensing is investigated. In the considered model, a set of cooperative vehicles provide sensing information to sensing request vehicles with limited sensing and communication resources. A base station (BS) determines the subset of sensing request vehicles that each cooperative vehicle will serve and the sub-regions that each cooperative vehicle will detect. We formulate an optimization problem aiming to maximize the number of successfully detected sub-regions of sensing request vehicles while satisfying the cooperative sensing energy requirement by jointly determining the cooperative vehicle association and the sensing sub-region selection. To solve this problem, we propose a graph attention based reinforcement learning (RL) algorithm that can generate the graph information vectors based on the correlation between each cooperative vehicle and each sensing request vehicle. Using the learned graph information, the joint cooperative vehicle association and sensing sub-region selection strategy will be determined. Simulation results show that the proposed scheme can improve the number of successfully detected sub-regions of sensing request vehicles by up to 12.5% compared to the conventional RL algorithm without using graph attention networks (GANs). © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

引用

2021 IEEE International Conference on Artificial Intelligence and Industrial Design, AIID 2021

作者： Changhu, Cheng Peng, Yang School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9780738110837

Few-shot learning aims to build a classification model by training a small amount of labeled sample data, which can be well adapted to new domains. The key point of few-shot learning is that a small amount of sample data cannot reflect the true data distribution. Training on a small amount of sample data will lead to over-fitting of the deep neural network model. The differences between different categories are ignored when using similarity measures for classification. This paper proposes a novel few-shot learning method based on similarity-difference relation network, which uses shallow wide residual network to extract the features of the training dataset and fuses them into a category prototype. Meanwhile, SDRN pays attention to the characterization of similarities and differences between positive and negative samples. This paper verifies the effectiveness of the similarity-difference relational network on the Mini-ImageNet and Tiered-ImageNet datasets. The experimental results show that the similarity-difference two-way relational network further improves image classification accuracy in the few-shot learning task. © 2021 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：