通过打乱与混合图像令牌,消除检测器对位置和内容的依赖,提升泛化能力。
Exploring Unbiased Deepfake Detection via Token-Level Shuffling and Mixing

- 在潜空间中打乱和混合图像令牌,打破位置与内容偏见
- 在多个数据集上实现优于现有方法的检测准确率
- 适合关注深度伪造检测泛化性能的研究者
泛化问题被广泛认为是深度伪造检测中的关键挑战。以往研究多认为该问题源于不同伪造方法之间的差异,但我们的研究表明,即使在伪造无关因素发生变化时,泛化问题依然存在。本文识别出两种检测器易受过拟合的偏差:位置偏差与内容偏差。位置偏差表现为检测器过度依赖图像特定区域(如中心区域,即使无伪造);内容偏差则表现为检测器可能错误利用与伪造无关的信息(如背景、发丝)。为此,我们提出两个基于变压器潜空间令牌打乱与混合的分支:打乱分支通过重新排列图像的令牌及其对应的位置嵌入,保持局部相关性;混合分支在同标签的两个样本间随机选取并混合潜空间令牌,重构内容信息。训练过程中,通过特征空间与logit空间的对齐,结合对比损失与发散损失,使检测器获得无偏表示。我们在多个主流评估数据集上进行了充分实验,验证了该方法的有效性。
原文摘要 · Abstract (English)
The generalization problem is broadly recognized as a critical challenge in detecting deepfakes. Most previous work believes that the generalization gap is caused by the differences among various forgery methods. However, our investigation reveals that the generalization issue can still occur when forgery-irrelevant factors shift. In this work, we identify two biases that detectors may also be prone to overfitting: position bias and content bias, as depicted in Fig. 1. For the position bias, we observe that detectors are prone to lazily depending on the specific positions within an image (e.g., central regions even no forgery). As for content bias, we argue that detectors may potentially and mistakenly utilize forgery-unrelated information for detection (e.g., background, and hair). To intervene these biases, we propose two branches for shuffling and mixing with tokens in the latent space of transformers. For the shuffling branch, we rearrange the tokens and corresponding position embedding for each image while maintaining the local correlation. For the mixing branch, we randomly select and mix the tokens in the latent space between two images with the same label within the mini-batch to recombine the content information. During the learning process, we align the outputs of detectors from different branches in both feature space and logit space. Contrastive losses for features and divergence losses for logits are applied to obtain unbiased feature representation and classifiers. We demonstrate and verify the effectiveness of our method through extensive experiments on widely used evaluation datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。