Deep Robust Reversible Watermarking

• URL: http://arxiv.org/abs/2503.02490v1
• Date: Tue, 04 Mar 2025 10:56:08 GMT
• Title: Deep Robust Reversible Watermarking
• Abstract summary: Existing Robust Reversible Watermarking (RRW) methods face complex designs, high computational costs, and poor robustness.<n>This paper proposes Deep Robust Reversible Watermarking (DRRW), a deep learning-based RRW scheme.<n>DRRW employs an encoder-noise layer-decoder framework for adaptive robustness via end-to-end training.
• Score: 34.57638608780908
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Robust Reversible Watermarking (RRW) enables perfect recovery of cover images and watermarks in lossless channels while ensuring robust watermark extraction in lossy channels. Existing RRW methods, mostly non-deep learning-based, face complex designs, high computational costs, and poor robustness, limiting their practical use. This paper proposes Deep Robust Reversible Watermarking (DRRW), a deep learning-based RRW scheme. DRRW uses an Integer Invertible Watermark Network (iIWN) to map integer data distributions invertibly, addressing conventional RRW limitations. Unlike traditional RRW, which needs distortion-specific designs, DRRW employs an encoder-noise layer-decoder framework for adaptive robustness via end-to-end training. In inference, cover image and watermark map to an overflowed stego image and latent variables, compressed by arithmetic coding into a bitstream embedded via reversible data hiding for lossless recovery. We introduce an overflow penalty loss to reduce pixel overflow, shortening the auxiliary bitstream while enhancing robustness and stego image quality. An adaptive weight adjustment strategy avoids manual watermark loss weighting, improving training stability and performance. Experiments show DRRW outperforms state-of-the-art RRW methods, boosting robustness and cutting embedding, extraction, and recovery complexities by 55.14\(\times\), 5.95\(\times\), and 3.57\(\times\), respectively. The auxiliary bitstream shrinks by 43.86\(\times\), with reversible embedding succeeding on 16,762 PASCAL VOC 2012 images, advancing practical RRW. DRRW exceeds irreversible robust watermarking in robustness and quality while maintaining reversibility.

Related papers

• RAIN: Region-Aware Inversion Network for Semantic Watermark Extraction [0.0]
  We propose a lightweight, prompt-free extractor that decomposes endpoint recovery into an image-like anchor and a noise-oriented residual.<n>The computational cost of extracting noise is lower than that of both OSI and FARI.
  arXiv  Detail & Related papers  (2026-09-14T00:07:17Z)
• FARI: Robust One-Step Inversion for Watermarking in Diffusion Models [89.29541056113442]
  Inversion-based watermarking is a promising approach to authenticate diffusion-generated images.<n>Existing approaches over-optimize internal truncation error.<n>textbfFARI is a one-step inversion framework paired with lightweight adversarial LoRA fine-tuning of the denoiser for watermark extraction.
  arXiv  Detail & Related papers  (2026-07-29T10:13:55Z)
• ResGuard: Enhancing Robustness Against Known Original Attacks in Deep Watermarking [42.919499074624895]
  Deep learning-based image watermarking commonly adopts an "Encoder-Noise Layer-Decoder" (END) architecture to improve robustness.<n>We expose a critical yet underexplored vulnerability: the Known Original Attack (KOA), where an adversary has access to multiple original-watermarked image pairs.<n>We show that even a simple residual-based removal approach, namely estimating an embedding residual from known pairs and subtracting it from unseen watermarked images, can almost completely remove the watermark.
  arXiv  Detail & Related papers  (2026-04-04T11:45:48Z)
• SiGRRW: A Single-Watermark Robust Reversible Watermarking Framework with Guiding Strategy [44.01873823230619]
  reversible watermarking (RRW) enables copyright protection for images while overcoming the limitation of distortion introduced by watermark itself.<n>We propose SiGRRW, a single-watermark RRW framework, which is applicable to both generative models and natural images.<n>The proposed framework can be deployed either as a plug-and-play watermarking layer at the output stage of generative models, or directly applied to natural images.
  arXiv  Detail & Related papers  (2026-02-22T08:48:49Z)
• OptMark: Robust Multi-bit Diffusion Watermarking via Inference Time Optimization [66.69924980864053]
  We propose OptMark, an optimization-based approach that embeds a robust multi-bit watermark into the intermediate latents of the diffusion denoising process.<n> OptMark strategically inserts a structural watermark early to resist generative attacks and a detail watermark late to withstand image transformations.<n> Experimental results demonstrate that OptMark achieves invisible multi-bit watermarking while ensuring robust resilience against valuemetric transformations, geometric transformations, editing, and regeneration attacks.
  arXiv  Detail & Related papers  (2025-08-29T15:50:59Z)
• Learning Arbitrary-Scale RAW Image Downscaling with Wavelet-based Recurrent Reconstruction [31.56360631121638]
  We propose a wavelet-based recurrent reconstruction framework to fulfill arbitrary-scale RAW image downscaling.<n>We introduce the Realistic Non-Integer RAW Downscaling (Real-NIRD) dataset, featuring a non-integer downscaling factor of 1.3$times$.<n>Our method outperforms existing state-of-the-art competitors both quantitatively and visually.
  arXiv  Detail & Related papers  (2025-07-31T03:17:10Z)
• TAG-WM: Tamper-Aware Generative Image Watermarking via Diffusion Inversion Sensitivity [68.95168727940973]
  Tamper-Aware Generative image WaterMarking method named TAG-WM.<n>This paper proposes a Tamper-Aware Generative image WaterMarking method named TAG-WM.
  arXiv  Detail & Related papers  (2025-06-30T03:14:07Z)
• Saliency-Aware Diffusion Reconstruction for Effective Invisible Watermark Removal [18.47018538990973]
  This paper introduces a novel Saliency-Aware Diffusion Reconstruction framework for watermark elimination on the web. SADRE disrupts embedded watermarks by injecting targeted noise into latent representations guided by saliency masks. A reverse diffusion process ensures high-fidelity image restoration, leveraging adaptive noise levels determined by watermark strength.
  arXiv  Detail & Related papers  (2025-04-17T10:15:10Z)
• Decouple to Reconstruct: High Quality UHD Restoration via Active Feature Disentanglement and Reversible Fusion [77.08942160610478]
  Ultra-high-definition (UHD) image restoration often faces computational bottlenecks and information loss due to its extremely high resolution. We propose a Controlled Differential Disentangled VAE that discards easily recoverable background information while encoding more difficult-to-recover degraded information into latent space. Our method effectively alleviates the information loss problem in VAE models while ensuring computational efficiency, significantly improving the quality of UHD image restoration, and achieves state-of-the-art results in six UHD restoration tasks with only 1M parameters.
  arXiv  Detail & Related papers  (2025-03-17T02:55:18Z)
• SuperMark: Robust and Training-free Image Watermarking via Diffusion-based Super-Resolution [27.345134138673945]
  We propose SuperMark, a robust, training-free watermarking framework.<n>SuperMark embeds the watermark into initial Gaussian noise using existing techniques.<n>It then applies pre-trained Super-Resolution models to denoise the watermarked noise, producing the final watermarked image.<n>For extraction, the process is reversed: the watermarked image is inverted back to the initial watermarked noise via DDIM Inversion, from which the embedded watermark is extracted.<n>Experiments demonstrate that SuperMark achieves fidelity comparable to existing methods while significantly improving robustness.
  arXiv  Detail & Related papers  (2024-12-13T11:20:59Z)
• AdaRevD: Adaptive Patch Exiting Reversible Decoder Pushes the Limit of Image Deblurring [14.101870441572618]
  This paper proposes a pioneering work, Adaptive Patch Exiting Reversible Decoder (AdaRevD) Our reversible structure gradually disentangles high-level degradation degree and low-level blur pattern. Experiments show that our AdaRevD pushes the limit of image deblurring, achieving 34.60 dB in PSNR on GoPro dataset.
  arXiv  Detail & Related papers  (2024-06-13T14:06:12Z)
• DDR: Exploiting Deep Degradation Response as Flexible Image Descriptor [54.90762380689283]
  We present Deep Degradation Response ( DDR), a method to quantify changes in image deep features under varying degradation conditions. Extensive evaluations demonstrate the versatility of DDR as an image descriptor, with strong correlations observed with key image attributes. DDR serves as an effective unsupervised learning objective in image restoration tasks, yielding notable advancements in image deblurring and single-image super-resolution.
  arXiv  Detail & Related papers  (2024-06-12T16:26:56Z)
• Beware of Aliases -- Signal Preservation is Crucial for Robust Image Restoration [20.607361871965157]
  We show that simply providing alias-free paths in state-of-the-art reconstruction transformers supports improved model robustness at low costs on the restoration performance. We do so by proposing BOA-Restormer, a transformer-based image restoration model that executes downsampling and upsampling operations partly in the frequency domain to ensure alias-free paths along the entire model while potentially preserving all relevant high-frequency information.
  arXiv  Detail & Related papers  (2024-06-11T16:42:17Z)
• LIR: A Lightweight Baseline for Image Restoration [4.187190284830909]
  The inherent characteristics of the Image Restoration task are often overlooked in many works. We propose a Lightweight Baseline network for Image Restoration called LIR to efficiently restore the image and remove degradations. Our LIR achieves the state-of-the-art Structure Similarity Index Measure (SSIM) and comparable performance to state-of-the-art models on Peak Signal-to-Noise Ratio (PSNR)
  arXiv  Detail & Related papers  (2024-02-02T12:39:47Z)
• Wide Flat Minimum Watermarking for Robust Ownership Verification of GANs [23.639074918667625]
  We propose a novel multi-bit box-free watermarking method for GANs with improved robustness against white-box attacks. The watermark is embedded by adding an extra watermarking loss term during GAN training. We show that the presence of the watermark has a negligible impact on the quality of the generated images.
  arXiv  Detail & Related papers  (2023-10-25T18:38:10Z)
• Knowledge Distillation based Degradation Estimation for Blind Super-Resolution [146.0988597062618]
  Blind image super-resolution (Blind-SR) aims to recover a high-resolution (HR) image from its corresponding low-resolution (LR) input image with unknown degradations. It is infeasible to provide concrete labels of multiple degradation combinations to supervise the degradation estimator training. We propose a knowledge distillation based implicit degradation estimator network (KD-IDE) and an efficient SR network.
  arXiv  Detail & Related papers  (2022-11-30T11:59:07Z)
• Progressively Guided Alternate Refinement Network for RGB-D Salient Object Detection [63.18846475183332]
  We aim to develop an efficient and compact deep network for RGB-D salient object detection. We propose a progressively guided alternate refinement network to refine it. Our model outperforms existing state-of-the-art approaches by a large margin.
  arXiv  Detail & Related papers  (2020-08-17T02:55:06Z)
• Blur, Noise, and Compression Robust Generative Adversarial Networks [85.68632778835253]
  We propose blur, noise, and compression robust GAN (BNCR-GAN) to learn a clean image generator directly from degraded images. Inspired by NR-GAN, BNCR-GAN uses a multiple-generator model composed of image, blur- Kernel, noise, and quality-factor generators. We demonstrate the effectiveness of BNCR-GAN through large-scale comparative studies on CIFAR-10 and a generality analysis on FFHQ.
  arXiv  Detail & Related papers  (2020-03-17T17:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.