Demo Data from EDBT 2026 / reviewers in the wild / expert
Peifei Zhu
dblp:202/3984
· DBLP profile ↗
4ranked-venue papers
4as first author
3since 2021 · last 2024
0000-0002-6768-8335ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 2 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
2 papers |
Generative modeling · 100% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.8 | 1 | 2024 | Watermark-embedded Adversarial Examples for Copyright Protection against Diffusion Models · CVPR 2024 |
Security and privacy of machine learning
adversarial example |
0.8 | 1 | 2024 | Watermark-embedded Adversarial Examples for Copyright Protection against Diffusion Models · CVPR 2024 |
Image and video processing › image forensics
image forgery detection |
0.7 | 1 | 2023 | Frequency-aware GAN for Adversarial Manipulation Generation · ICCV 2023 |
Security and privacy of machine learning
adversarial attack |
0.7 | 1 | 2023 | Frequency-aware GAN for Adversarial Manipulation Generation · ICCV 2023 |
Security and privacy of machine learning › adversarial attack
adversarial example generation |
0.7 | 1 | 2023 | Frequency-aware GAN for Adversarial Manipulation Generation · ICCV 2023 |
Machine learning › Generative modeling
generative adversarial network |
0.2 | 1 | 2023 | Frequency-aware GAN for Adversarial Manipulation Generation · ICCV 2023 |
Methods — techniques the papers use, named apart from their topics
generative adversarial network · 2.0encoder-decoder architecture · 2.0perturbation loss · 1.5conditional adversarial network · 1.5GAN loss · 1.5frequency-domain features · 1.3frequency-domain feature · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Watermark-embedded Adversarial Examples for Copyright Protection against Diffusion ModelsabstractDiffusion Models (DMs) have shown remarkable capa-bilities in various image-generation tasks. However, there are growing concerns that DMs could be used to imitate unauthorized creations and thus raise copyright issues. To address this issue, we propose a novel framework that em-beds personal watermarks in the generation of adversarial examples. Such examples can force DMs to generate images with visible watermarks and prevent DMs from imitating unauthorized images. We construct a generator based on conditional adversarial networks and design three losses (adversarial loss, GAN loss, and perturbation loss) to gen-erate adversarial examples that have subtle perturbation but can effectively attack DMs to prevent copyright violations. Training a generator for a personal watermark by our method only requires 5–10 samples within 2–3 minutes, and once the generator is trained, it can generate adver-sarial examples with that watermark significantly fast (0.2s per image). We conduct extensive experiments in various conditional image-generation scenarios. Compared to ex-isting methods that generate images with chaotic textures, our method adds visible watermarks on the generated images, which is a more straightforward way to indicate copy-right violations. We also observe that our adversarial exam-ples exhibit good transferability across unknown generative models. Therefore, this work provides a simple yet powerful way to protect copyright from DM-based imitation. Peifei Zhu, Tsubasa Takahashi 0001, Hirokatsu Kataoka |
CVPR | 1 |
| 2023 | Frequency-aware GAN for Adversarial Manipulation GenerationabstractImage manipulation techniques have drawn growing concerns as manipulated images might cause morality and security problems. Various methods have been proposed to detect manipulations and achieved promising performance. However, these methods might be vulnerable to adversarial attacks. In this work, we design an Adversarial Manipulation Generation (AMG) task to explore the vulnerability of image manipulation detectors. We first propose an optimal loss function and extend existing attacks to generate adversarial examples. We observe that existing spatial attacks cause large degradation in image quality and find the loss of high-frequency detailed components might be its major reason. Inspired by this observation, we propose a novel adversarial attack that incorporates both spatial and frequency features into the GAN architecture to generate adversarial examples. We further design an encoder-decoder architecture with skip connections of high-frequency components to preserve fine details. We evaluated our method on three image manipulation detectors (FCN, ManTra-Net and MVSS-Net) with three benchmark datasets (DEFACTO, CASIAv2 and COVER). Experiments show that our method generates adversarial examples significantly fast (0.01s per image), preserves better image quality (PSNR 30% higher than spatial attacks), and achieves a high attack success rate. We also observe that the examples generated by AMG can fool both classification and segmentation models, which indicates better transferability among different tasks. Peifei Zhu, Genki Osada, Hirokatsu Kataoka, Tsubasa Takahashi 0001 |
ICCV | 1 |
| 2021 | Multi-Domain Adversarial Balancing for the Estimation of Individual Treatment Effect
Peifei Zhu, Zisheng Li, Masahiro Ogino |
ICONIP (5) | 1 |
| 2014 | Sparse decomposition learning based dynamic MRI reconstructionabstractDynamic MRI is widely used for many clinical exams but slow data acquisition becomes a serious problem. The application of Compressed Sensing (CS) demonstrated great potential to increase imaging speed. However, the performance of CS is largely depending on the sparsity of image sequence in the transform domain, where there are still a lot to be improved. In this work, the sparsity is exploited by proposed Sparse Decomposition Learning (SDL) algorithm, which is a combination of low-rank plus sparsity and Blind Compressed Sensing (BCS). With this decomposition, only sparsity component is modeled as a sparse linear combination of temporal basis functions. This enables coefficients to be sparser and remain more details of dynamic components comparing learning the whole images. A reconstruction is performed on the undersampled data where joint multicoil data consistency is enforced by combing Parallel Imaging (PI). The experimental results show the proposed methods decrease about 15~20% of Mean Square Error (MSE) compared to other existing methods. Peifei Zhu, Qieshi Zhang |
ICMV | 1 |