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

Zuyuan He

dblp:48/5072 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
8since 2021 · last 2026
0000-0002-7499-834XORCID · verified

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Security and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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.

Theoretical computer science
1 paper
Mathematical optimization · 50% Quantum computing and quantum information · 38% Graph algorithms and graph theory · 12%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › combinatorial optimization
ising machine
0.712023
20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine · Sci. China Inf. Sci. 2023
Quantum computing and quantum information › quantum computational models
quantum annealing
0.712023
20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine · Sci. China Inf. Sci. 2023
Mathematical optimization
combinatorial optimization
0.212023
20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine · Sci. China Inf. Sci. 2023
Graph algorithms and graph theory › graph cut
max-cut
0.212023
20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine · Sci. China Inf. Sci. 2023

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

quadrature · 0.7photonic spatial ising machine · 0.7
YearPublicationVenuePosition
2026 Mutual adversarial attack-based adaptive blending for face morphing
Zongyong Deng, Qiaoyun He, Qijun Zhao, Zuyuan He, Lanfei Qiao
Neurocomputing4
2025 A geometry-aware generative model for face morphing attacks
Zongyong Deng, Qijun Zhao, Libin Ye, Qiaoyun He, Zuyuan He
Knowl. Based Syst.5
2024 Hierarchical Generative Network for Face Morphing Attacks
abstract
Face morphing attacks circumvent face recognition systems (FRSs) by creating a morphed image that contains multiple identities. However, existing face morphing attack methods either sacrifice image quality or compromise the identity preservation capability. Consequently, these attacks fail to bypass FRSs verification well while still managing to deceive human observers. These methods typically rely on global information from contributing images, ignoring the detailed information from effective facial regions. To address the above issues, we propose a novel morphing attack method to improve the quality of morphed images and better preserve the contributing identities. Our proposed method leverages the hierarchical generative network to capture both local detailed and global consistency information. Additionally, a mask-guided image blending module is dedicated to removing artifacts from areas outside the face to improve the image's visual quality. The proposed attack method is compared to state-of-the-art methods on three public datasets in terms of FRSs' vulnerability, attack detectability, and image quality. The results show our method's potential threat of deceiving FRSs while being capable of passing multiple morphing attack detection (MAD) scenarios.
Zuyuan He, Zongyong Deng, Qiaoyun He, Qijun Zhao
FG1
2024 Face Morphing via Adversarial Attack-based Adaptive Blending
abstract
In this paper, we propose an innovative adversarial attack-based adaptive blending architecture (A3B) for face morphing attacks. Unlike traditional face morphing methods that evenly blend identity information using a half-half-hard strategy, we propose an approach that considers the varying importance of facial features in different regions of individuals for more precise and clear face morphing. Our method adaptively blends the latent codes of contributing subjects with a weighting mask that assigns different weights to different facial features when blending two faces to fuse their identities. The crux of our method lies in computing the weighting mask given a pair of contributing face images. This is done with the assistance of adversarial attacks, which can adaptively perturb face images to conceal or transfer identity. Owing to the adaptive blending strategy, our proposed approach achieves competitive performance on several state-of-the-art benchmark datasets. In contrast to existing methods, our approach explores the connection between adversarial attacks and morphing attacks for the first time, which generates morphed face images with plausible visual quality and simultaneously preserves the identity of contributing subjects. This novel perspective raises concerns about the potential security risks it poses to current facial recognition systems.
Qiaoyun He, Zongyong Deng, Zuyuan He, Qijun Zhao
IJCNN3
2023 Optimal-Landmark-Guided Image Blending for Face Morphing Attacks
abstract
In this paper, we propose a novel approach for conducting face morphing attacks, which utilizes optimal-landmark-guided image blending. Current face morphing attack can be categorized into landmark-based and generation-based approaches. Landmark-based methods use geometric transformations to warp facial regions according to averaged landmarks, but often produce morphed images with poor visual quality. Generation-based methods, which employ generation models to blend multiple face images, can achieve better visual quality, but are often unsuccessful in generating morphed images that can effectively evade state-of-the-art face recognition systems (FRSs). Our proposed method overcomes the limitations of previous approaches by optimizing the morphing landmarks and using Graph Convolutional Networks (GCNs) to combine landmark and appearance features. We model facial landmarks as nodes in a bipartite graph that is fully connected, and utilize GCNs to simulate their spatial and structural relationships. The aim is to capture variations in facial shape and enable accurate manipulation of facial appearance features during the warping process, resulting in morphed facial images that are highly realistic and visually faithful. Experiments on two public datasets prove that our method inherits the advantages of previous landmark-based and generation-based methods and generates morphed images with higher quality, posing a more significant threat to state-of-the-art FRSs.
Qiaoyun He, Zongyong Deng, Zuyuan He, Qijun Zhao
IJCB3
2023 Simplified single-end Rayleigh and Brillouin hybrid distributed fiber-optic sensing system
Linjing Huang, Zuyuan He
Sci. China Inf. Sci.2
2023 20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine
Xin Ye 0008, Shaomeng Wang, Xiaoxuan Yang 0002, Zuyuan He
Sci. China Inf. Sci.5
2022 Arrayed-waveguide-grating based on proton exchange and etching combined fabrication over bulk Lithium-Niobate substrate
abstract
In this paper, a method for fabricating arrayed-waveguide-grating (AWG) over bulk Lithium-Niobate (LN) substrate is presented. Design of a four-channel CWDM AWG is investigated with reduced cost due to the use of bulk LN.
Jiaxi Yuan, Jiangbing Du, Jiacheng Liu 0015, Zuyuan He
MMSP4