We propose utilizing MHA in image watermarking to allocate watermarks across various regions based on relevance. The figure illustrates the decomposition of the cover image and watermark into vectors which are then embedded with positional embeddings. These vectors are then processed through an MHA layer, computing attention scores between patches from one image (as queries) and the other (as keys), facilitating understanding between the cover image and the watermark. These scores are then utilized to identify optimal watermark embedding locations.
(Left) A sample 128x128x3 cover image from our subset of the imagenet validation set. (Right) The watermark generated by resizing, isolating the first channel and binarizing the pixels which range from 0 to 255, to 0 or 1, based on the threshold 128 (half of 255).
Figure illustrating the pixels affected by the embedding process for each case by showcasing the difference between the cover image and their respective marked image.
We perform an experiment to test the tolerance of our proposed scheme against increasing levels of noises. As expected the performance decreases steadily with an increase in the degree of noise.
Dasgupta, A. and Zhong, X., 2023. Robust Image Watermarking based on Cross-Attention and Invariant Domain Learning. arXiv preprint arXiv:2310.05395.