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

IEEE International Joint Conference on Biometrics (IJCB)

作者： Yanliang Guo Xianxu Hou Feng Liu Linlin Shen Lei Wang Zhen Wang Peng Liu Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Qualcomm Technologies Inc

Facial expression editing has a wide range of applications, such as emotion detection, human-computer interaction, and social entertainment. However, existing expression editing methods either fail to allow for fine-grained editing, resulting in unnatural and unrealistic facial expressions, or generate artifacts and blurs, leading to poor image quality. In this paper, we propose a novel framework called StyleAU, which is based on StyleGAN and facial action units, to address these problems. Our framework leverages the pre-trained StyleGAN prior knowledge to enable action unit editing of the face in the StyleGAN latent space, allowing precise expression editing. In addition, we use an encoder to extract multi-scale content features to achieve high-fidelity image reconstruction. Our approach qualitatively and quantitatively outperforms competing methods for action unit manipulation and expression editing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability

Why Does Little Robustness Help? A Further Step Towards Unde...

引用

IEEE Symposium on Security and Privacy

作者： Yechao Zhang Shengshan Hu Leo Yu Zhang Junyu Shi Minghui Li Xiaogeng Liu Wei Wan Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University School of Software Engineering Huazhong University of Science and Technology Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (数字)9798350331301

ISBN: (纸本)9798350331318

Adversarial examples for deep neural networks (DNNs) are transferable: examples that successfully fool one white-box surrogate model can also deceive other black-box models with different architectures. Although a bunch of empirical studies have provided guidance on generating highly transferable adversarial examples, many of these findings fail to be well explained and even lead to confusing or inconsistent advice for practical *** this paper, we take a further step towards understanding adversarial transferability, with a particular focus on surrogate aspects. Starting from the intriguing "little robustness" phenomenon, where models adversarially trained with mildly perturbed adversarial samples can serve as better surrogates for transfer attacks, we attribute it to a trade-off between two dominant factors: model smoothness and gradient similarity. Our research focuses on their joint effects on transferability, rather than demonstrating the separate relationships alone. Through a combination of theoretical and empirical analyses, we hypothesize that the data distribution shift induced by off-manifold samples in adversarial training is the reason that impairs gradient *** on these insights, we further explore the impacts of prevalent data augmentation and gradient regularization on transferability and analyze how the trade-off manifests in various training methods, thus building a comprehensive blueprint for the regulation mechanisms behind transferability. Finally, we provide a general route for constructing superior surrogates to boost transferability, which optimizes both model smoothness and gradient similarity simultaneously, e.g., the combination of input gradient regularization and sharpness-aware minimization (SAM), validated by extensive experiments. In summary, we call for attention to the united impacts of these two factors for launching effective transfer attacks, rather than optimizing one while ignoring the other, and emphasize the

关键词： Training Privacy Buildings Closed box Minimization data augmentation Robustness

来源：评论

学校读者我要写书评

暂无评论

AOCC-FL: Federated Learning with Aligned Overlapping via Calibrated Compensation 42

AOCC-FL: Federated Learning with Aligned Overlapping via Cal...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Wang, Haozhao Xu, Wenchao Fan, Yunfeng Li, Ruixuan Zhou, Pan Huazhong University of Science and Technology School of Computer Science and Technology Wuhan China The Hong Kong Polytechnic University Department of Computing Hong Kong Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan China

ISBN: (纸本)9798350334142

Federated Learning enables collaboratively model training among a number of distributed devices with the coordination of a centralized server, where each device alternatively performs local gradient computation and communication to the server. FL suffers from significant performance degradation due to the excessive communication delay between the server and devices, especially when the network bandwidth of these devices is limited, which is common in edge environments. Existing methods overlap the gradient computation and communication to hide the communication latency to accelerate the FL training. However, the overlapping can also lead to an inevitable gap between the local model in each device and the global model in the server that seriously restricts the convergence rate of learning process. To address this problem, we propose a new overlapping method for FL, AOCC-FL, which aligns the local model with the global model via calibrated compensation such that the communication delay can be hidden without deteriorating the convergence performance. Theoretically, we prove that AOCC-FL admits the same convergence rate as the non-overlapping method. On both simulated and testbed experiments, we show that AOCC-FL achieves a comparable convergence rate relative to the non-overlapping method while outperforming the state-of-the-art overlapping methods. © 2023 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

MISA: Unveiling the Vulnerabilities in Split Federated Learning

MISA: Unveiling the Vulnerabilities in Split Federated Learn...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Wei Wan Yuxuan Ning Shengshan Hu Lulu Xue Minghui Li Leo Yu Zhang Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Computer Science and Technology Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University Cluster and Grid Computing Lab

Federated learning (FL) and split learning (SL) are prevailing distributed paradigms in recent years. They both enable shared global model training while keeping data localized on users’ devices. The former excels in parallel execution capabilities, while the latter enjoys low dependence on edge computing resources and strong privacy protection. Split federated learning (SFL) combines the strengths of both FL and SL, making it one of the most popular distributed architectures. Furthermore, a recent study has claimed that SFL exhibits robustness against poisoning attacks, with a fivefold improvement compared to FL in terms of *** this paper, we present a novel poisoning attack known as $\color{Fuchsia} {{\text{MISA}}}$. It poisons both the top and bottom models, causing a misalignment in the global model, ultimately leading to a drastic accuracy collapse. This attack unveils the vulnerabilities in SFL, challenging the conventional belief that SFL is robust against poisoning attacks. Extensive experiments demonstrate that our proposed MISA poses a significant threat to the availability of SFL, underscoring the imperative for academia and industry to accord this matter due attention.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing

arXiv

引用

arXiv 2024年

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. The code is available at https://***/connorxian/CA-Edit. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

JSRevealer: A Robust Malicious JavaScript Detector against Obfuscation

JSRevealer: A Robust Malicious JavaScript Detector against O...

引用

International Conference on Dependable systems and Networks (DSN)

作者： Kunlun Ren Weizhong Qiang Yueming Wu Yi Zhou Deqing Zou Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jinyinhu Laboratory Wuhan China Nanyang Technological University Singapore National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Due to the convenience and popularity of Web applications, they have become a prime target for attackers. As the main programming language for Web applications, many methods have been proposed for detecting malicious JavaScript, among which static analysis-based methods play an important role because of their high effectiveness and efficiency. However, obfuscation techniques are commonly used in JavaScript, which makes the features extracted by static analysis contain many useless and disguised features, leading to many false positives and false negatives in detection results. In this paper, we propose a novel method to find out the essential features related to the semantics of JavaScript code. Specifically, we develop JS-Revealer, a robust, effective, scalable, and interpretable detector for malicious JavaScript. To test the capabilities of JSRevealer, we conduct comparative experiments with four other state-of-the-art malicious JavaScript detection tools. The experimental results show that JSRevealer has an average F1 of 84.8% on the data obfuscated by different obfuscators, which is 21.6%, 22.3%, 18.7%, and 22.9% higher than the tools CUJO, ZOZZLE, JAST, and JSTAP, respectively. Moreover, the detection results of JSRevealer can be interpreted, which can provide meaningful insights for further security research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

Congress on Evolutionary Computation

作者： Yongfeng Li Yuze Zhang Lijia Ma Junkai Ji Dugang Liu Victor C. M. Leung Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen China Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms.

关键词： Measurement Correlation Sociology Evolutionary computation Reinforcement learning Germanium Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

arXiv

引用

arXiv 2024年

作者： Deng, Kaijun Zheng, Dezhi Xie, Jindong Wang, Jinbao Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China Department of Computer Science University of Exeter United Kingdom

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need

arXiv

引用

arXiv 2024年

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EagerLog: Active Learning Enhanced Retrieval Augmented Generation for Log-based Anomaly Detection

EagerLog: Active Learning Enhanced Retrieval Augmented Gener...

引用

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

作者： Duan, Chiming Jia, Tong Yang, Yong Liu, Guiyang Liu, Jinbu Zhang, Huxing Zhou, Qi Li, Ying Huang, Gang School of Software and Microelectronics Peking University Beijing China Institute for Artificial Intelligence Peking University Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China National Key Laboratory of Data Space Technology and System Beijing China Alibaba Cloud Computing Company Hangzhou China

ISBN: (纸本)9798350368741

Logs record essential information about system operations and serve as a critical source for anomaly detection, which has generated growing research interest. Utilizing large language models (LLMs) within a retrieval-augmented generation (RAG) framework for log-based anomaly detection is an effective approach due to its strong generalization capabilities and efficient few-shot performance. However, the effectiveness of this method hinges on the quality of the knowledge source, which can be impacted by noise and changes within the software systems. Facing these problems, in this paper, we propose a novel log-based anomaly detection method named EagerLog, employing active learning to choose the logs for humans to label, thereby adding them to the knowledge source, thus enhancing the knowledge source and maintaining its quality. Our experiments on three open datasets (BGL, Thunderbird, Zookeeper) and one industrial dataset demonstrate that EagerLog can achieve 93.65% F1 score with approximately 10 labeled log sequences, surpassing existing methods by 15.32%. © 2025 IEEE.

关键词： Active Learning Anomaly Detection Log Analysis Retrieval Augmented Generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：