Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zenghao Niu

dblp:367/9245 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
0009-0002-5461-6954ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Security and privacy of machine learning · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 50% Image and video processing · 50%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning
adversarial attack
1.522024
Generative Imperceptible Attack With Feature Learning Bias Reduction and Multi-Scale Variance Regularization · IEEE Trans. Inf. Forensics Secur. 2024
Boosting Adversarial Transferability across Model Genus by Deformation-Constrained Warping · AAAI 2024
Machine learning › Trustworthy machine learning › robustness
adversarial attack
0.912025
Enhancing Adversarial Transferability by Balancing Exploration and Exploitation with Gradient-Guided Sampling · ICCV 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
Enhancing Adversarial Transferability by Balancing Exploration and Exploitation with Gradient-Guided Sampling · ICCV 2025
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial transferability
0.912025
Enhancing Adversarial Transferability by Balancing Exploration and Exploitation with Gradient-Guided Sampling · ICCV 2025
Machine learning › Trustworthy machine learning › robustness › adversarial attack
transfer attack
0.912025
Enhancing Adversarial Transferability by Balancing Exploration and Exploitation with Gradient-Guided Sampling · ICCV 2025
Visual content generation and editing › face editing
facial attribute editing
0.912025
CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing · AAAI 2025
Image and video processing › image restoration
image inpainting
0.912025
CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing · AAAI 2025
Security and privacy of machine learning › adversarial attack
adversarial attacks on generative models
0.812024
Generative Imperceptible Attack With Feature Learning Bias Reduction and Multi-Scale Variance Regularization · IEEE Trans. Inf. Forensics Secur. 2024
Security and privacy of machine learning › adversarial attack
imperceptible perturbation
0.812024
Generative Imperceptible Attack With Feature Learning Bias Reduction and Multi-Scale Variance Regularization · IEEE Trans. Inf. Forensics Secur. 2024
Security and privacy of machine learning › adversarial attack
transferable adversarial attack
0.812024
Boosting Adversarial Transferability across Model Genus by Deformation-Constrained Warping · AAAI 2024

Methods — techniques the papers use, named apart from their topics

momentum-based attack · 0.9gradient-guided sampling · 0.9frequency guidance · 0.9diffusion model · 0.9causality-aware condition adapter · 0.9MI-FGSM · 0.9variance regularization · 0.8model augmentation · 0.8input transformation · 0.8feature manipulation · 0.8elastic deformation · 0.8
YearPublicationVenuePosition
2025 CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing
abstract
For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional fine-tuning 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. Our codes will be made publicly available.
Xiaole Xian, Xilin He, Zenghao Niu, Junliang Zhang, Weicheng Xie 0001, Siyang Song, Zitong Yu, LinLin Shen
AAAI3
2025 Enhancing Adversarial Transferability by Balancing Exploration and Exploitation with Gradient-Guided Sampling
abstract
Adversarial attacks present a critical challenge to deep neural networks' robustness, particularly in transfer scenarios across different model architectures. However, the transferability of adversarial attacks faces a fundamental dilemma between Exploitation (maximizing attack potency) and Exploration (enhancing cross-model generalization). Traditional momentum-based methods over-prioritize Exploitation, i.e., higher loss maxima for attack potency but weakened generalization (narrow loss surface). Conversely, recent methods with inner-iteration sampling over-prioritize Exploration, i.e., flatter loss surfaces for cross-model generalization but weakened attack potency (suboptimal local maxima). To resolve this dilemma, we propose a simple yet effective Gradient-Guided Sampling (GGS), which harmonizes both objectives through guiding sampling along the gradient ascent direction to improve both sampling efficiency and stability. Specifically, based on MI-FGSM, GGS introduces inner-iteration random sampling and guides the sampling direction using the gradient from the previous inner-iteration (the sampling's magnitude is determined by a random distribution). This mechanism encourages adversarial examples to reside in balanced regions with both flatness for cross-model generalization and higher local maxima for strong attack potency. Comprehensive experiments across multiple DNN architectures and multimodal large language models (MLLMs) demonstrate the superiority of our method over state-of-the-art transfer attacks. Code is made available at https://github.com/anuin-cat/GGS.
Zenghao Niu, Weicheng Xie 0001, Siyang Song, Zitong Yu, Feng Liu 0013, LinLin Shen
ICCV1
2025 Frequency Restoration and Modality Enforcement towards Resisting-corruption Multimodal Sentiment Analysis
abstract
For Multimodal Sentiment Analysis (MSA), previous methods concentrate on designing sophisticated fusion strategies and performing representation learning across heterogeneous modalities, aiming to leverage multimodal signals to detect human sentiment. However, these approaches fail to address the long-standing issue of corrupted modal details in videos, which may be caused by the challenge of the excessive loss of emotionally relevant semantics resulted from the degradation of detailed information. In this work, we aim to improve the robustness capacity of resisting corruption in MSA, by introducing a Hierarchical Frequency Restoration and Adaptive Modality Enforcement (HFR-AME) approach. The HFR-AME progressively recovers blurred detailed cues in each modality while enhancing the discriminative power of modal representations. Specifically, to reconstruct distinct frequency band features, we propose to equip the HFR module with a key component called the Frequency Multimodal UNet (FM-UNet), so as to utilize complementary modal features as conditions. This meticulous restoration process, performed from low to high frequency, facilitates the comprehensive recovery of intricate details. Meanwhile, to adaptively integrate these diverse frequency features, we introduce the AME module to enhance the beneficial modal frequencies while suppressing irrelevant ones, with the goal of strengthening the restored modal representations. Extensive experiments show our HFR-AME outperforms state-of-the-art methods on the CMU-MOSI and CMU-MOSEI datasets, improving 7-class accuracy by 0.5% and 0.6%, respectively. Further analysis also confirms its cross-lingual generalization and competitive computational efficiency. Our code is made available at https://github.com/nianhua20/HFR-AME .
Weicheng Xie 0001, Haijian Liang, Zenghao Niu, Xianxu Hou, Siyang Song, Zitong Yu, LinLin Shen
ACM Trans. Multim. Comput. Commun. Appl.3
2024 Boosting Adversarial Transferability across Model Genus by Deformation-Constrained Warping
abstract
Adversarial examples generated by a surrogate model typically exhibit limited transferability to unknown target systems. To address this problem, many transferability enhancement approaches (e.g., input transformation and model augmentation) have been proposed. However, they show poor performances in attacking systems having different model genera from the surrogate model. In this paper, we propose a novel and generic attacking strategy, called Deformation-Constrained Warping Attack (DeCoWA), that can be effectively applied to cross model genus attack. Specifically, DeCoWA firstly augments input examples via an elastic deformation, namely Deformation-Constrained Warping (DeCoW), to obtain rich local details of the augmented input. To avoid severe distortion of global semantics led by random deformation, DeCoW further constrains the strength and direction of the warping transformation by a novel adaptive control strategy. Extensive experiments demonstrate that the transferable examples crafted by our DeCoWA on CNN surrogates can significantly hinder the performance of Transformers (and vice versa) on various tasks, including image classification, video action recognition, and audio recognition. Code is made available at https://github.com/LinQinLiang/DeCoWA.
Qinliang Lin, Zenghao Niu, Xilin He, Weicheng Xie 0001, Yuanbo Hou, LinLin Shen, Siyang Song
AAAI3
2024 Generative Imperceptible Attack With Feature Learning Bias Reduction and Multi-Scale Variance Regularization
abstract
Existing studies have shown that malicious and imperceptible adversarial samples may significantly weaken the reliability and validity of deep learning systems. Since gradient-based attack algorithms may result in higher generation latency or demand large computation overhead, generative attack methods are frequently considered. However, the effectiveness and imperceptibility are still the main concerns for these generative attacks, 1) biased feature learning may occur, i.e., these algorithms may generate undesirable feature perturbations for samples that are less likely to be successfully attacked; 2) the produced perturbation noises may be easily perceived by human eyes. To this end, we propose a novel generative attack by manipulating the feature update. The proposed algorithm has two main merits, 1) our Bias-reduced Feature Manipulation (BrFM) that differentiates the hard-to-attack (Hard2Attack) and easy-to-attack (Easy2Attack) features, can avoid the possible learning shortcut for different difficulties of features in attack process, by customizing perturbations for Hard2Attack features to make them behave oppositely to those of benign features; 2) our Multi-scale Variance Regularization (MsVR) can reduce the unnatural transitions of perturbations in mask edges and flat areas with low contrast, while simultaneously trading off a reasonable attack capacity. Extensive experiments on the datasets of Caltech-101 and Imagenette in terms of the attack success rate and four imperceptibility metrics, show the effectiveness of our attack paradigm over the related state-of-the-art generative attack methods. Our codes will be made publicly available.
Weicheng Xie 0001, Zenghao Niu, Qinliang Lin, Siyang Song, LinLin Shen
IEEE Trans. Inf. Forensics Secur.2