MarkCleaner: High-Fidelity Watermark Removal via Imperceptible Micro-Geometric Perturbation

• URL: http://arxiv.org/abs/2602.01513v1
• Date: Mon, 02 Feb 2026 01:03:21 GMT
• Title: MarkCleaner: High-Fidelity Watermark Removal via Imperceptible Micro-Geometric Perturbation
• Abstract summary: MarkCleaner is a watermark removal framework that avoids semantic drift caused by regeneration-based watermark removal.<n>We show that MarkCleaner achieves superior performance in both watermark removal effectiveness and visual fidelity.
• Score: 37.899449138826725
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Semantic watermarks exhibit strong robustness against conventional image-space attacks. In this work, we show that such robustness does not survive under micro-geometric perturbations: spatial displacements can remove watermarks by breaking the phase alignment. Motivated by this observation, we introduce MarkCleaner, a watermark removal framework that avoids semantic drift caused by regeneration-based watermark removal. Specifically, MarkCleaner is trained with micro-geometry-perturbed supervision, which encourages the model to separate semantic content from strict spatial alignment and enables robust reconstruction under subtle geometric displacements. The framework adopts a mask-guided encoder that learns explicit spatial representations and a 2D Gaussian Splatting-based decoder that explicitly parameterizes geometric perturbations while preserving semantic content. Extensive experiments demonstrate that MarkCleaner achieves superior performance in both watermark removal effectiveness and visual fidelity, while enabling efficient real-time inference. Our code will be made available upon acceptance.

Related papers

• SpreadMark: Robust Image Watermarking via Spread-Spectrum Embedding [35.24760637584417]
  We revisit spread-spectrum embedding, a classical watermarking principle, inside a modern neural post-hoc watermarking architecture.<n>Our starting point is a measurement: in existing encoder-decoder schemes each message bit occupies only a small fraction of the image.<n> SpreadMark spreads each bit as a dense pseudo-random codeword over the whole image and recovers it by matched-filtering a learned cover-suppressed chip representation.
  arXiv  Detail & Related papers  (2026-08-04T05:52:17Z)
• Hidden in Plain Tokens: Simply Robust, Gradient-Free Watermark for Synthetic Audio [58.612001688217056]
  Inference-time watermarks for autoregressive models are unfit for continuous modalities due to discretization inconsistencies.<n>We propose an elegant solution for powerful and robust watermarking of synthetic audio.
  arXiv  Detail & Related papers  (2026-05-25T15:43:20Z)
• RecoverMark: Robust Watermarking for Localization and Recovery of Manipulated Faces [16.612226216769262]
  We propose RecoverMark, a watermarking framework that achieves robust manipulation localization, content recovery, and ownership verification simultaneously.<n>Our key insight is twofold. First, we exploit a critical real-world constraint: an adversary must preserve the background's semantic consistency to avoid visual detection.<n>Based on these insights, RecoverMark treats the protected face content itself as the watermark and embeds it into the surrounding background.
  arXiv  Detail & Related papers  (2026-02-24T07:11:40Z)
• RAVEN: Erasing Invisible Watermarks via Novel View Synthesis [35.417500510522835]
  In this work, we expose a fundamental vulnerability in invisible watermarks by reformulating watermark removal as a view synthesis problem.<n>Our key insight is that generating a perceptually consistent alternative view of the same semantic content, naturally removes the embedded watermark while preserving visual fidelity.<n>We introduce a zero-shot diffusion-based framework that applies controlled geometric transformations in latent space, augmented with view-guided correspondence attention to maintain structural consistency during reconstruction.
  arXiv  Detail & Related papers  (2026-01-13T18:59:58Z)
• Where is the Watermark? Interpretable Watermark Detection at the Block Level [15.634495620977297]
  We present a post-hoc image watermarking method that combines localised embedding with region-level interpretability.<n>Our approach embeds watermark signals in the discrete wavelet transform domain using a statistical block-wise strategy.<n>We show that our method achieves strong robustness against common image transformations while remaining sensitive to semantic manipulations.
  arXiv  Detail & Related papers  (2025-12-17T00:56:46Z)
• Diffusion-Based Image Editing: An Unforeseen Adversary to Robust Invisible Watermarks [4.138397555991069]
  Powerful diffusion-based image generation and editing models can inadvertently remove or distort embedded watermarks.<n>We present a theoretical and empirical analysis demonstrating that diffusion-based image editing can effectively break state-of-the-art robust watermarks.<n>We propose a diffusion-driven attack that uses generative image regeneration to erase watermarks from a given image.
  arXiv  Detail & Related papers  (2025-11-05T16:20:29Z)
• Character-Level Perturbations Disrupt LLM Watermarks [64.60090923837701]
  We formalize the system model for Large Language Model (LLM) watermarking.<n>We characterize two realistic threat models constrained on limited access to the watermark detector.<n>We demonstrate character-level perturbations are significantly more effective for watermark removal under the most restrictive threat model.<n> Experiments confirm the superiority of character-level perturbations and the effectiveness of the Genetic Algorithm (GA) in removing watermarks under realistic constraints.
  arXiv  Detail & Related papers  (2025-09-11T02:50:07Z)
• 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)
• Bridging Knowledge Gap Between Image Inpainting and Large-Area Visible Watermark Removal [57.84348166457113]
  We introduce a novel feature adapting framework that leverages the representation capacity of a pre-trained image inpainting model.<n>Our approach bridges the knowledge gap between image inpainting and watermark removal by fusing information of the residual background content beneath watermarks into the inpainting backbone model.<n>For relieving the dependence on high-quality watermark masks, we introduce a new training paradigm by utilizing coarse watermark masks to guide the inference process.
  arXiv  Detail & Related papers  (2025-04-07T02:37:14Z)
• Image Watermarks are Removable Using Controllable Regeneration from Clean Noise [26.09012436917272]
  A critical attribute of watermark techniques is their robustness against various manipulations.<n>We introduce a watermark removal approach capable of effectively nullifying state-of-the-art watermarking techniques.<n>Our methods offer superior visual consistency/quality and enhanced watermark removal performance compared to existing regeneration approaches.
  arXiv  Detail & Related papers  (2024-10-07T20:04:29Z)
• WMFormer++: Nested Transformer for Visible Watermark Removal via Implict Joint Learning [68.00975867932331]
  Existing watermark removal methods mainly rely on UNet with task-specific decoder branches. We introduce an implicit joint learning paradigm to holistically integrate information from both branches. The results demonstrate our approach's remarkable superiority, surpassing existing state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2023-08-20T07:56:34Z)
• Who Wrote this Code? Watermarking for Code Generation [53.24895162874416]
  We propose Selective WatErmarking via Entropy Thresholding (SWEET) to detect machine-generated text. Our experiments show that SWEET significantly improves code quality preservation while outperforming all baselines.
  arXiv  Detail & Related papers  (2023-05-24T11:49:52Z)

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.