- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper addresses the problem of recovering invisible image watermarks after geometric transformations, where rotation and scaling can cause alignment changes and interpolation-induced loss of message-bearing information. The authors argue that correcting alignment alone is insufficient because the correct watermark must remain distinguishable from competing message identities after geometric resampling.
The proposed method consists of three main components: (1) a Fourier–Mellin-inspired feature representation with orbit-based matching that provides invariance to integer circular shifts in feature space without explicitly estimating geometric alignment; (2) an interpolation-compatible codebook that excludes vulnerable Nyquist-frequency components to reduce message degradation under fractional feature shifts; and (3) a two-stage, per-image embedding optimization that first balances residual energy and message separation, then improves perceptual quality at fixed residual energy while protecting message margins under a predefined geometric transformation.
The authors evaluate the framework on a closed-set identification task involving 64 watermark IDs, using COCO, AMBER, and DIV2K datasets and nine baseline configurations. The proposed method achieves over 99.5% mean ID recovery across all evaluated transformation conditions, including rotation, scaling, translation, and JPEG compression. Additional ablation studies examine the contributions of the spectral codebook constraint and perceptual refinement with geometric-margin protection.
Critical strengths
-
Well-motivated problem and theoretically grounded approach: The paper identifies an important limitation of alignment-based watermark recovery: geometric resampling can remove message-bearing information even when alignment is corrected. The proposed interpolation-compatible codebook is motivated by mathematical analysis of fractional shifts, providing a clear connection between the identified problem and the proposed solution.
-
Strong experimental performance across multiple geometric transformations: The proposed method achieves over 99.5% mean ID recovery across all evaluated conditions on COCO, AMBER, and DIV2K. Particularly notable is its performance under combined rotation, scaling, translation, and JPEG compression, where it achieves 99.75% accuracy on COCO validation compared with 64.10% for WAM+SyncSeal. These results demonstrate strong robustness within the evaluated transformation settings.
-
Meaningful ablation studies supporting the proposed components: The paper investigates the effectiveness of excluding fragile Nyquist-frequency components and the two-stage embedding strategy. The codebook ablation demonstrates improved off-grid recovery, while the refinement experiments show that perceptual distortion can be substantially reduced without sacrificing recovery when geometric margins are protected. These experiments provide useful evidence supporting the proposed design choices.
-
Joint consideration of watermark robustness and perceptual quality: Rather than focusing exclusively on recovery accuracy, the method explicitly balances message separability, residual energy, and perceptual distortion. The two-stage optimization provides a structured approach to improving visual quality while maintaining watermark recovery under the selected geometric transformations.
Critical weaknesses
-
Limited geometric robustness evaluation: Although the paper focuses on geometrically robust watermarking, the experiments primarily consider rotation, scaling, and limited translation under controlled synthetic transformations. Other important geometric distortions, such as perspective transformations, shearing, and substantial cropping, are not evaluated. These transformations are common in real-world image capture and editing scenarios. Therefore, the reported results do not fully establish robustness beyond the evaluated geometric settings.
-
Limited message capacity and scalability: The main experiments consider only 64 watermark IDs, equivalent to 6 bits of information. Although Appendix E.1 extends the evaluation to 128 and 256 IDs, acceptance coverage decreases as the message space increases. For example, coverage under continuous rotation-scale transformations drops from 91.60% for the jointly trained 64-ID reference to 73.24% for the reoptimized 256-ID codebook. This raises concerns about scalability to larger message spaces and practical applications requiring substantially longer watermark identifiers.
-
Gap between theoretical analysis and practical geometric transformations: The theoretical results establish desirable properties under a specified feature-space interpolation operator. However, actual geometric transformations involve pixel-space interpolation, which does not necessarily satisfy the same assumptions. Although the authors provide supporting empirical results, a quantitative analysis connecting the theoretical guarantees to the observed robustness under pixel-space resampling would strengthen the technical contribution.
-
Insufficient evaluation under broader image-processing and adversarial attacks: The paper evaluates JPEG compression and its combination with geometric transformations, but does not provide comprehensive experiments involving noise, blur, brightness changes, repeated compression, or adaptive adversarial watermark removal. While these attacks extend beyond the primary geometric focus, evaluating them would help establish the practical robustness and limitations of the proposed framework.
-
Limited justification and independent validation of the rejection threshold: The authors use a fixed threshold of 0.04 and report zero incorrectly accepted watermark IDs across the evaluated conditions. Although threshold sensitivity is discussed, the threshold was selected during development, and the authors acknowledge that all evaluation datasets were inspected during the project. Since a large score difference does not necessarily guarantee a correct prediction, validation on a strictly held-out dataset would provide stronger evidence of threshold generalization.
-
High computational cost of watermark embedding: Although decoding is efficient, the proposed method requires per-image optimization involving 1,000 Adam steps in the first stage and 150 additional steps in the second stage. The paper does not provide a sufficiently detailed comparison of end-to-end embedding costs against encoder-based watermarking approaches. This raises concerns about computational scalability for applications requiring watermarking of large image collections.
Questions for authors
-
Geometric transformation generalization: The paper evaluates rotation, scaling, and translation, but does not consider perspective transformations, shearing, or substantial cropping. How would the proposed method handle these transformations, particularly in real-world camera capture scenarios? Can the authors provide additional experiments or discuss the expected limitations?
-
Message capacity and scalability: The primary evaluation considers 64 IDs, while Appendix E.1 extends the codebook to 256 IDs with decreasing acceptance coverage. What motivates the selection of 64 IDs as the main evaluation setting? How would the method scale to significantly larger message spaces, such as 16-bit or 32-bit identifiers, while maintaining robustness and perceptual quality?
-
Comparison with higher-capacity watermarking methods: Existing watermarking approaches can support considerably longer binary payloads. Since this paper evaluates closed-set identification rather than arbitrary bit-sequence recovery, could the authors clarify how the proposed approach compares with higher-capacity watermarking methods in terms of the capacity–robustness–distortion trade-off?
-
Theoretical guarantees versus practical transformations: The theoretical analysis establishes norm and inner-product preservation under a specified feature-space interpolation operator. However, actual geometric transformations involve pixel-space resampling. Could the authors quantify the discrepancy between ideal fractional feature shifts and the features extracted from geometrically transformed images?
-
Rejection threshold selection: The authors use a rejection threshold of 0.04, selected during development. Could they clarify the calibration procedure and explain how this threshold generalizes to unseen datasets and transformations? In particular, how does the method handle incorrect predictions with a score margin above 0.04, and what is the resulting trade-off between identification accuracy and acceptance coverage?
-
Robustness against other image-processing attacks: The paper evaluates JPEG compression and geometric transformations, but does not comprehensively examine noise, blur, brightness or contrast adjustments, and repeated compression. Could the authors provide additional evaluations to determine whether the proposed message separability is preserved under these common processing operations?
-
Novelty relative to existing methods: The proposed framework builds upon established Fourier–Mellin representations, group-invariant matching, interpolation theory, and margin-based optimization. Could the authors more explicitly distinguish the methodological contributions from these existing techniques and clarify the advantages of their approach over other learned transformation-invariant watermarking frameworks?
3 comments
Thank you for the response. Some of my concerns have been addressed. However, my overall rating remains unchanged, as it reflects my assessment of the paper.
Response to reviewer ttvF followup
Thank you for re-reading our response. We understand that the additional experiments address only part of your concerns.
In the revised paper, we have narrowed our claims rather than presenting the new results as evidence of unrestricted robustness. Section 4.5 now distinguishes exact invariance to integer circular feature shifts from empirical pixel-space robustness, and explicitly excludes shear, anisotropic scaling, mirroring, and camera recapture from the supported scope. We also present Proposition A.3 as a conservative diagnostic bound, add quality–robustness curves with operating-point-specific threshold calibration, report the embedding cost, and label the 1,024-candidate results as a pilot study. Performance with 16/32-bit identifiers and robustness to adaptive attacks remain unverified.
We recognize that limitations remain. If there is a specific technical issue that is decisive for your rating, we would appreciate the opportunity to address it. We hope the additional evidence and clarified scope make the paper’s contribution and limitations clearer, and that you might reconsider your assessment in light of the revised version.
Response to Reviewer ttvF
Thank you for the detailed review. We answer each point with new measurements.
Protocol. COCO val, 5,000 hosts × 3 models unless stated. acc = top-1 ID accuracy; coverage = acceptance at η=0.04; FAR = acceptance on unwatermarked images.
W1/Q1, W4/Q6: beyond the paper's conditions
FAR is 0.09–0.41%, and wrong acceptances are ≤ 5/15,000 per tested condition. On never-used ImageNet val, noise, blur, JPEG50, resizing, crop-resize, occlusion, translation and the two composites tested give 99.7–100% acc, with no wrong acceptance. Scope (Q1). The readout is exactly invariant to integer circular feature shifts; robustness to pixel-space transforms is evaluated empirically. Shear, anisotropic scaling and mirroring lie outside the modelled group and are not handled (e.g. 18% acc at shear 10°). §4.5 will state this boundary, and camera recapture is left to future work. Regeneration (500 × 3), acc vs. best baseline: VAE-256 93.6 vs. 79.6; img2img 0.1 98.1 vs. 96.4; VAE-512 99.9 vs. 100. At stronger img2img (0.2–0.3), MBRS is ahead. Adaptive white-box removal is not evaluated.
W3/Q4: theory vs. pixel-space resampling
We measured the discrepancy directly on real resampling. (i) The single-branch residual ϵ=∥Φa(Ay)−TδΦa(y)∥: the learned correction lowers its median 1.5–2.2× vs. the base frontend, and ϵ correlates positively with the decoded gap drop in all 57 strata (median Spearman ≈ 0.16). (ii) For the full 11-mask decoder, Prop. A.3 guarantees an unchanged prediction if Γ>2RcdH, where dH is the orbit-Hausdorff distance between feature sets (a sufficient condition). At our operating point the measured median dH values (≈ 0.2–0.4) make this bound conservative. (iii) The bound is nonetheless predictive: the ratio of 2dH to the untransformed image's full-decoder true-ID gap predicts wrong-or-rejected outputs with stratified AUC 0.925 (ε alone: 0.74). The revision adds this analysis to §3.2.
W5/Q5: threshold
η was set on COCO development data and frozen. On never-used ImageNet val (1,000 × 3), coverage is 99.2–99.4% clean, 93–95% offgrid and 91–93% full-angle, with no wrong acceptance. The calibration procedure also transfers: per-model thresholds calibrated on unwatermarked COCO to FAR ≤ 10−3 (η = 0.029–0.055), applied unchanged to ImageNet, give FAR ≤ 0.1% on clean and 90°-rotated unwatermarked hosts; no wrong acceptance was observed across the 19 watermarked conditions. Fig. 4b–c gives the accuracy–coverage trade-off; we will add the ImageNet curve.
W2/Q2/Q3: capacity
Why 64: registry identification; a fixed set lets 32–256-bit methods compete on one task. Larger M. Appending templates to the frozen 64-ID codebook without re-embedding keeps old images at 91.6–98.9% acc across 19 conditions for M=1024 (unchanged η). Re-optimised codebooks (pilot, one model) of up to 1,024 candidates, evaluated on 512 hosts carrying IDs 0–511, keep 97.7–100% acc. The coverage drop you note comes from the fixed η: gaps shrink as competitors densify. At App. E.1's η=0.023, the 1,024-candidate codebook reaches 86.7–100% coverage, with no wrong acceptance and 0/2,560 unwatermarked acceptances in this batch. 16/32-bit: 216 IDs is unmeasured, and 232 exceeds an exhaustive closed-set readout. Trade-off (Q3): with residuals scaled per image toward a target LPIPS of 0.01 (approximate after 8-bit quantisation), ours leads on geometry + JPEG composites: acc ≈ 99% vs. 68–87% for a 64-bit CASIAL re-implementation and 45–86% for the best of six bit-payload baselines. In all corresponding comparisons, the 95% paired-host bootstrap confidence intervals for the differences lie above zero (jo6p W1). Bit-payload methods remain preferable for arbitrary bit strings.
W6: cost
Embedding takes 12.9 s/image on an A100, far slower than an encoder; image-to-decision takes 11.5 ms. The method targets registration-time marking (see jo6p W4).
Q7: novelty
We do not claim Fourier–Mellin, max-filtering or trigonometric interpolation. Our contributions are: (1) Eq. 3 and Prop. 3.1 turn interpolation loss into a codebook constraint: the Nyquist-free subspace is the largest on which fractional shifts preserve norms and inner products (Table 2). (2) An orbit score exactly invariant to integer feature shifts, with no pose estimation. (3) Margin protection on the half-bin view during refinement (Table 3: offgrid coverage 94.1 vs. 67.4 / 68.9%).