Source-linked AI summary

Robust Invisible Video Watermarking with Attention

Kevin Alex Zhang, Lei Xu, Alfredo Cuesta-Infante, Kalyan Veeramachaneni

arXiv:1909.01285v1cs.MMcs.CV

TL;DR

Video watermarking must hide messages without visible distortion while remaining recoverable after redistribution and common processing, goals that existing methods rarely achieve together. RivaGAN uses an attention-based architecture with adversarial training for robust multi-bit embedding, achieving near-perfect accuracy with minimal visual distortion and robustness to scaling, cropping, and compression.

  • Problem

    Video watermarking seeks invisible, recoverable messages, but existing techniques rarely achieve invisibility and robustness together, especially under video processing.

  • Method

    RivaGAN uses an attention-based mechanism and multiple adversarial networks in an end-to-end deep learning architecture for robust video watermarking.

  • Results

    Near perfect accuracy was achieved when hiding an arbitrary 32-bit watermark with minimal visual distortion and robustness to scaling, cropping, and compression.

  • Takeaways & Limitations

    Attention-based architectures are robust to common video processing operations and outperform concatenation-based approaches.

Abstract

from arXiv · show

The goal of video watermarking is to embed a message within a video file in a way such that it minimally impacts the viewing experience but can be recovered even if the video is redistributed and modified, allowing media producers to assert ownership over their content. This paper presents RivaGAN, a novel architecture for robust video watermarking which features a custom attention-based mechanism for embedding arbitrary data as well as two independent adversarial networks which critique the video quality and optimize for robustness. Using this technique, we are able to achieve state-of-the-art results in deep learning-based video watermarking and produce watermarked videos which have minimal visual distortion and are robust against common video processing operations.

1 Introduction

Effective video watermarking must be both invisible and robust, but existing techniques rarely achieve both simultaneously. This paper therefore targets a deep learning-based, multi-bit process designed to satisfy both requirements.

  • Video watermarking aims to remain invisible while surviving redistribution and modification.Frame-independent perturbations can cause visible flickering, while geometric processing may destroy classical watermarks.
  • Existing techniques rarely achieve invisibility and robustness at the same time.
  • The paper proposes a deep learning-based, multi-bit video watermarking process targeting robustness and invisibility.

2 Related Work

Watermarking and steganography hide information within other media, with prior work spanning spatial, frequency-domain, compression-based, and motion-vector methods. Deep learning has shown promise for related hiding tasks, but deep-learning video watermarking remains an open problem addressed here with attention and multiple adversaries.

  • Watermarking and steganography both hide information within another medium, but steganography focuses on secretly embedding data.
  • Image-based watermarking operates on frames independently, whereas video-based methods exploit temporal information.
  • Classical approaches modify pixels, transform coefficients, compression formats, or motion vectors to embed watermarks.
  • Deep learning has produced promising image steganography results, while deep-learning video watermarking remains an open problem.
  • The paper proposes an end-to-end robust video watermarking model using multiple adversaries and a novel attention mechanism.

3 RivaGAN

RivaGAN targets robust, invisible multi-bit video watermarking with an attention-based encoder–decoder and two adversarial networks. Its attention mechanism allocates data dimensions across pixels, while adversarial training addresses visual quality and watermark removal.

  • Two adversarial networks complement the encoder and decoder: a critic evaluates video quality, while an adversary attempts to remove the watermark.The encoder embeds the watermark and the decoder extracts it.
  • The attention module learns a probability distribution over data dimensions at each pixel, producing a compact representation that selects bits according to image content.The resulting attention mask is shared by the encoder and decoder.
  • Attention-based representations bias hiding toward content less affected by transformations, yielding faster convergence and better performance than concatenation or multiplication approaches.The paper specifically connects this design to robustness against scaling, compression, and cropping.
  • The encoder reduces the data dimensions to one attention-weighted value per pixel, concatenates this tensor with the image, and generates a bounded residual watermark.The residual perturbation is constrained to ±0.01 per pixel.
  • The decoder predicts all data bits at every location, weights predictions by the attention mask, and averages them to recover the watermark.Because attention is applied to the watermarked video, decoding does not require the original source video.

4 Experiments and Results

Experiments on Hollywood2 evaluate watermark recovery, visual quality, robustness to processing, and human detectability. Attention-based models outperform concatenation-based approaches while preserving near-invisible video quality.

  • Evaluation setup: On Hollywood2, the evaluation measures watermark accuracy and video quality after MJPEG compression, cropping, and scaling.The dataset contains over 2500 clips totaling more than 20 hours, and Table 2 reports quality and recovery under these conditions.
  • Comparison: Attention-based models outperform concatenation-based models and remain more robust to compression, cropping, and scaling.This advantage holds both without explicit noise layers and when noise layers are used.
  • Watermark recovery: Above 95% accuracy is achieved for decoding the 32-bit watermark when the watermarked video is transmitted without modification.Cropping and scaling noise layers raise recovery to approximately 99% under the corresponding operations.
  • Human detectability: Human workers are only slightly better than random guessing when distinguishing source from watermarked videos.The experiment uses source-watermarked pairs for all 884 test videos, while Table 3 reports detection rates by model.
  • Human detectability: The critic model produces watermarked videos with a detection rate 5% lower than baseline models.This provides evidence that the critic module reduces watermark visibility.

5 Additional Insights

Additional analyses examine where the encoder places watermark residuals, how attention distributes bit effects, and how Hamming vector pairs affect optimization. These analyses link the architecture to spatially distributed perturbations, content-dependent bit encoding, and faster convergence.

  • Residual masks: Encoder-generated residual values appear fairly evenly distributed across video frames.Figure 3 visualizes the residual masks added to the source video to produce the watermarked output.
  • Attention mechanism: Difference masks are computed by embedding a fixed tensor, flipping one bit, and visualizing |W1 − W2| between the resulting watermarked videos.This procedure identifies the regions affected by a particular bit.
  • Attention mechanism: Flipping different bits produces significantly different difference masks with attention, whereas masks are virtually identical without attention.Bright regions mark pixels changed by flipping a single bit in the data tensor.
  • Training stability: Without Hamming vector pairs, a model trained with a high learning rate fails to converge within a reasonable number of epochs.Figure 5 compares training loss under otherwise matched architecture, learning rate, and optimizer settings.
  • Training stability: Including Hamming vector pairs in the same batch produces significantly faster convergence and higher test accuracy at a high initial learning rate.The authors hypothesize that these pairs generate less noisy gradients than simple random sampling.

6 Conclusion

The paper introduces attention-based architectures for data hiding and demonstrates video watermarking with near-perfect recovery and minimal visual distortion. The approach is also reported as easier to train, more memory-efficient, and robust to common video processing operations.

  • Conclusion: The proposed attention-based architectures use less memory, are easier to train, and are robust to scaling, cropping, and compression.The paper presents them as a new class of architectures for steganography and watermarking.
  • Conclusion: The system achieves near-perfect accuracy with minimal visual distortion when embedding an arbitrary 32-bit watermark into video files.The conclusion identifies this result as evidence of effectiveness on the video watermarking task.
Loading 1909.01285v1…