Abstract
Systems and methods are disclosed for recovering invisible digital watermark messages from modified media using database-backed nearest-neighbor decoding. An embedding subsystem generates an n-bit binary message sampled uniformly at random, embeds the message into a media item using a watermark encoder, and stores an association between the message and a content identifier in a message database. A decoding subsystem extracts a noisy n-bit message from a candidate media item, performs a Hamming-distance nearest-neighbor search over stored messages to obtain a closest stored message and distance, and applies threshold-based decision logic to determine a match. A two-threshold policy may trigger optional visual similarity verification when the distance is intermediate. The database functions as a stochastic codebook that grows with watermarking operations and enables identification without allocating payload bits to in-message redundancy.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Anonymous, "Stochastic Codebook Nearest-Neighbor Decoding for Robust Digital Watermark Recovery", Technical Disclosure Commons, ()
https://www.tdcommons.org/dpubs_series/10607