← 研踪 PaperTrailarXiv:2611.10858 · v1
Beyond Bit Matching: Orthogonal Watermarks for Collusion-Resistant Image Fingerprinting
首次提交 2026-11-08 01:11
版本更新 2026-11-08 01:11
雷达观测 2026-11-10 11:14
摘要
Image fingerprinting assigns each distributed copy a user-specific watermark for source tracing. Averaging collusion is a central threat: several recipients can average their differently marked copies to suppress each individual mark. Discrete bit-string watermarks are especially vulnerable because averaging drives bit evidence toward ambiguous decisions. We introduce \textbf{VectorMark}, which maps user keys to near-orthogonal high-dimensional unit vectors and identifies colluders by cosine similarity to the extracted watermark direction. Under ideal averaging of vector keys, the normalized average preserves a cosine signal of order for each colluder, while unrelated keys remain concentrated near zero. The spherical geometry of random directions gives a shifted-Beta null distribution for cosine similarities, enabling analytic per-key false-positive-rate control after validation on unwatermarked images. VectorMark uses a neural watermark encoder and centered extractor trained with JND masking and a progressive curriculum for photometric, geometric, and collusion robustness. Experiments on MS-COCO, OpenImages, and AI-generated images show that VectorMark maintains robust watermark attribution under photometric and geometric distortions, and achieves the best strict all-colluder detection among evaluated methods, while preserving high visual quality. Our code is publicly available: https://github.com/nurlanov-zh/VectorMark
作者备注:Accepted at NeurIPS 2026
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-08 01:11 · 最新观测版本
Beyond Bit Matching: Orthogonal Watermarks for Collusion-Resistant Image Fingerprinting
Image fingerprinting assigns each distributed copy a user-specific watermark for source tracing. Averaging collusion is a central threat: several recipients can average their differently marked copies to suppress each individual mark. Discrete bit-string watermarks are especially vulnerable because averaging drives bit evidence toward ambiguous decisions. We introduce \textbf{VectorMark}, which maps user keys to near-orthogonal high-dimensional unit vectors and identifies colluders by cosine similarity to the extracted watermark direction. Under ideal averaging of vector keys, the normalized average preserves a cosine signal of order for each colluder, while unrelated keys remain concentrated near zero. The spherical geometry of random directions gives a shifted-Beta null distribution for cosine similarities, enabling analytic per-key false-positive-rate control after validation on unwatermarked images. VectorMark uses a neural watermark encoder and centered extractor trained with JND masking and a progressive curriculum for photometric, geometric, and collusion robustness. Experiments on MS-COCO, OpenImages, and AI-generated images show that VectorMark maintains robust watermark attribution under photometric and geometric distortions, and achieves the best strict all-colluder detection among evaluated methods, while preserving high visual quality. Our code is publicly available: https://github.com/nurlanov-zh/VectorMark
查看此版本解读 →查看此版本原文 ↗