- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies watermarks for diffusion models that embed a message in the starting noise and detect it by inverting an image to the noise. The authors observe that, for the same prompt and message, some starting noises survive JPEG compression and added noise better than others. They also find that this can be predicted before any compression or noise is applied, because images with more fine texture tend to be recovered more accurately. The proposed method generates up to ten candidate images per message and keeps the first one that is textured enough. Across four watermarking methods, two prompt sets, and several message lengths, this raises bit accuracy by 2.8 percentage points on average under JPEG and Gaussian noise.
Critical strengths
- The method is simple and works with existing watermarking techniques. It needs no training, and it does not change how the message is embedded or detected.
- The paper introduces a novel way to improve robustness. Prior work changes how the message is embedded in the noise. This paper keeps that fixed and instead picks the initial noise, using the image's texture to predict in advance which noises will survive edits.
Critical weaknesses
- Key watermarks that also hide in the starting noise are missing. The paper doesn't check whether selection helps methods like Tree-Ring [1], WIND [2], or SEAL [3], or how they compare under the same attacks.
- Choosing images by texture changes which images the model produces, and the paper does not test whether this shifts the distribution of generated images.
- The extra robustness gain is limited and expensive. It appears only under JPEG and Gaussian noise, and costs about 7 generations per image for an average gain of 2.8 points.
References
[1] Yuxin Wen, John Kirchenbauer, Jonas Geiping, and Tom Goldstein. Tree-Ring Watermarks: Invisible Fingerprints for Diffusion Images. NeurIPS 2023.
[2] Kasra Arabi, Benjamin Feuer, R. Teal Witter, Chinmay Hegde, and Niv Cohen. Hidden in the Noise: Two-Stage Robust Watermarking for Images. ICLR 2025.
[3] Kasra Arabi, R. Teal Witter, Chinmay Hegde, and Niv Cohen. SEAL: Semantic Aware Image Watermarking. ICCV 2025.
Questions for authors
- With the same budget of 10 candidates, how does texture-based selection compare with compressing each candidate right after generating it, decoding it, and keeping the one that decodes best? How does it compare with Qi et al.'s recovery score [4]?
- Can a simple classifier separate selected images from unselected ones? How do FID and the distribution of the texture score change after selection?
- Table 5 shows the cost of different budgets and thresholds, but not their accuracy. How does accuracy change as the number of candidates goes from 1 to 10?
References
[4] Zipeng Qi, Lichen Bai, Haoyi Xiong, and Zeke Xie. Not All Noises Are Created Equally: Diffusion Noise Selection and Optimization. arXiv:2407.14041, 2024.