用语义层面的对抗增强,让小数据训练的GAN也能生成高质量图像。
Adversarial Semantic Augmentation for Training Generative Adversarial Networks under Limited Data
- 在语义特征空间中寻找可迁移的方向,实现更自然的数据增强
- 在少样本数据下,生成图像质量显著提升,优于传统增强方法
- 计算开销极低,适合实际部署和各类生成任务
生成对抗网络(GAN)近年来在图像合成方面取得显著进展,但通常需要大量数据,数据有限时性能会明显下降。为改善低数据场景下的合成效果,现有方法采用多种数据增强技术扩充训练集,但这些方法可能泄露或改变数据分布。为此,本文提出对抗性语义增强(ASA),在语义层面而非图像层面扩充数据。具体地,利用真实与生成图像的语义特征协方差矩阵,识别有意义的变换方向,如改变人脸背景或表情。同时,推导对抗损失的上界,并通过优化该上界实现隐式语义增强,避免冗余采样且引入可忽略的计算开销。在少样本与大规模数据集上的大量实验表明,本方法在不同数据条件下均持续提升生成质量,可视化与分析结果也显示其良好泛化能力。
原文摘要 · Abstract (English)
Generative adversarial networks (GANs) have made remarkable achievements in synthesizing images in recent years. Typically, training GANs requires massive data, and the performance of GANs deteriorates significantly when training data is limited. To improve the synthesis performance of GANs in low-data regimes, existing approaches use various data augmentation techniques to enlarge the training sets. However, it is identified that these augmentation techniques may leak or even alter the data distribution. To remedy this, we propose an adversarial semantic augmentation (ASA) technique to enlarge the training data at the semantic level instead of the image level. Concretely, considering semantic features usually encode informative information of images, we estimate the covariance matrices of semantic features for both real and generated images to find meaningful transformation directions. Such directions translate original features to another semantic representation, e.g., changing the backgrounds or expressions of the human face dataset. Moreover, we derive an upper bound of the expected adversarial loss. By optimizing the upper bound, our semantic augmentation is implicitly achieved. Such design avoids redundant sampling of the augmented features and introduces negligible computation overhead, making our approach computation efficient. Extensive experiments on both few-shot and large-scale datasets demonstrate that our method consistently improve the synthesis quality under various data regimes, and further visualized and analytic results suggesting satisfactory versatility of our proposed method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。