Summary
The paper introduces a method to remove watermarks added by stable signature [1]. The method achieves high removal effect and good image quality compared to previous method MP [2]. The method builds on the assumption that the attacker can modify the parameters of the open-sourced watermarked latent diffusion model decoder. The approach consists of two steps: first, the method estimates a denoised latent vector for each non-watermarked image in an attacking dataset; then, it fine-tunes the decoder so that the generated images align closely with the non-watermarked images. In the encoder-aware scenario, the attacker has access to the model’s encoder, diffusion process, and denoising layers. In the encore-agnostic scenario, the attacker only has access to the denoising layers and decoder. The experiment results show that this method achieves high watermark removal rates with preserved image quality.
[1] Fernandez, P., Couairon, G., Jégou, H., Douze, M., & Furon, T. (2023). The stable signature: Rooting watermarks in latent diffusion models. In Proceedings of the IEEE/CVF International Conference on Computer Vision (pp. 22466-22477).
Strengths
1. The approach can adapt to two different access levels. It’s flexible and close to real-world settings.
2. The watermark demonstrates high quality in watermark removal tasks and preserves image quality. Although E-agnostic takes long time to fine-tune, the proposed method is model-targeted and therefore needs no additional processing time once fine-tuned.
Weaknesses
1. It seems the novelty of the method is not very apparent. The method estimates the latent z and do fine-tuning on decoder based on the loss function, which is a common method in watermarking methods, see [1].
2. It’s still not very clear to me why the encoded latent $\hat{z}^i$ can be used to approximate the true $z^i$. Although the decoded image can be similar to the original image visually, the latents $\hat{z}^i$ and $z^i$ may differ significantly. suppose the distribution of the latent after the denoising process of the diffusion model is $P$, and the distribution of the latent after the encoding of a clean image using the encoder is $P'$. $z^i$ is sampled from $P$, while $\hat{z}^i$ is sampled from $P'$. It's obvious that $P$ and $P'$ is not the same, though they may be close to each other. The fine-tuning is actually a process that tries to adapt the input distribution of the decoder to $P'$.
[1] Zhang, L., Liu, X., Martin, A. V., Bearfield, C. X., Brun, Y., & Guan, H. (2024). Robust Image Watermarking using Stable Diffusion. arXiv preprint arXiv:2401.04247.
Questions
1. Why the e-agnostic scenario takes so much time in fine-tuning? Can the authors specify the process?
2. I’m confused about the changing of evasion rate and the bitwise accuracy with respect to $\mu$, the weight of the adversarial loss. It seems contradictory that as $\mu$ increases, in terms of evasion rate and bitwise accuracy, the e-aware curve and e-agnostic curve has two different trending directions. Can the authors explain it?
3. The assumption is that the attacker can access the decoder of an open-sourced model. I’m quite confused about this setting. If the decoder can be accessed, why not just replace the decoder with the original one? It seems the application scenario of this method is not necessary in real-life? Can the authors explain it?