METR: Image Watermarking with Large Number of Unique Messages

August 15, 2024 ยท Entered Twilight ยท ๐Ÿ› CREAI@ECAI

๐Ÿ’ค TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .github, .gitignore, .gitmodules, CITATION.cff, LICENSE, README.md, plots, pyproject.toml, reproducibility.md, requirements.dev.txt, requirements.txt, schema, scripts, setup.py, src

Authors Alexander Varlamov, Daria Diatlova, Egor Spirin arXiv ID 2408.08340 Category cs.LG: Machine Learning Cross-listed cs.CR, cs.CV Citations 1 Venue CREAI@ECAI Repository https://github.com/deepvk/metr โญ 21 Last Checked 1 month ago
Abstract
Improvements in diffusion models have boosted the quality of image generation, which has led researchers, companies, and creators to focus on improving watermarking algorithms. This provision would make it possible to clearly identify the creators of generative art. The main challenges that modern watermarking algorithms face have to do with their ability to withstand attacks and encrypt many unique messages, such as user IDs. In this paper, we present METR: Message Enhanced Tree-Ring, which is an approach that aims to address these challenges. METR is built on the Tree-Ring watermarking algorithm, a technique that makes it possible to encode multiple distinct messages without compromising attack resilience or image quality. This ensures the suitability of this watermarking algorithm for any Diffusion Model. In order to surpass the limitations on the quantity of encoded messages, we propose METR++, an enhanced version of METR. This approach, while limited to the Latent Diffusion Model architecture, is designed to inject a virtually unlimited number of unique messages. We demonstrate its robustness to attacks and ability to encrypt many unique messages while preserving image quality, which makes METR and METR++ hold great potential for practical applications in real-world settings. Our code is available at https://github.com/deepvk/metr
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning