Benchmarking Deepart Detection
Yabin Wang, Zhiwu Huang, Xiaopeng Hong
TL;DR
This paper introduces the first deepart detection benchmark, the Deepart Detection Database (DDDB), pairing LAION-5B conarts with deeparts generated by five state-of-the-art models to study deepart detection. It defines two novel problems—once-for-all deepart detection (ODD) and continual deepart detection (CDD)—and proposes four benchmark evaluations plus four solution families. The authors show that continual learning approaches generally outperform isolated ODD methods and introduce a transformation framework based on Knowledge Distillation, Cosine Normalization, and Prompt-Tuning to rescue collapsed rehearsal-free methods in the most challenging CDD3 setting. The work provides extensive experiments with ViT backbones, data augmentation, and a copyright-identification metric, offering practical guidance for real-world deepart copyright protection and detection research.
Abstract
Deepfake technologies have been blurring the boundaries between the real and unreal, likely resulting in malicious events. By leveraging newly emerged deepfake technologies, deepfake researchers have been making a great upending to create deepfake artworks (deeparts), which are further closing the gap between reality and fantasy. To address potentially appeared ethics questions, this paper establishes a deepart detection database (DDDB) that consists of a set of high-quality conventional art images (conarts) and five sets of deepart images generated by five state-of-the-art deepfake models. This database enables us to explore once-for-all deepart detection and continual deepart detection. For the two new problems, we suggest four benchmark evaluations and four families of solutions on the constructed DDDB. The comprehensive study demonstrates the effectiveness of the proposed solutions on the established benchmark dataset, which is capable of paving a way to more interesting directions of deepart detection. The constructed benchmark dataset and the source code will be made publicly available.
