- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introducrd DiM, a dimension-aware framework that categorizes deep watermarking methods by encoding and extraction dimensionalities (1D, 2D, and 3D). The authors instantiate DiM in video watermarking to support local embedding, tamper localization, and temporal order recovery. Experiments compare different dimensional configurations and baselines across spatial, temporal, and compression distortions.
Critical strengths
-
Novel perspective: This paper provides an novel perspective for organizing watermarking functionalities through embedding and extraction dimensionalities. The insight that cross-dimensional mappings can support different function is interesting. The framework is intuitive and has potential value as a design guideline.
-
Comprehensive experiments. The experimental evaluation is comprehensive, covering global and local watermarking, tamper localization, visual quality, and robustness under various distortions, which show the effectiveness of this paper.
Critical weaknesses
-
Unclear contribution of dimensionality versus richer supervision: Moving from 1D to 2D/3D mappings also introduces additional structural information and stronger localization supervision. Therefore, it is unclear whether the observed improvements stem from the proposed dimension-aware principle or simply from the additional task-specific information. Controlled ablation studies that separate these factors would help clarify the contribution of dimensionality itself.
-
Incomplete validation of temporal order recovery: As described in Appendix C, long videos are divided into 8-frame clips for processing. However, the paper does not explain how temporal ordering is preserved or recovered across different clips. For example, if a 128-frame video is divided into 16 clips, recovering the correct frame order within each clip does not necessarily recover the original order of the 16 clips. Can the proposed method handle such cross-clip permutations? If so, how is this achieved, and what is the corresponding sequence-level recovery accuracy?
-
Incomplete computational cost analysis across dimensional mappings: Although Table 6 reports inference throughput (FPS), the computational costs of different dimensional mappings remain unclear. Since these configurations use different network components, their model sizes and computational requirements may differ significantly. Could the authors report the parameter counts, inference time for each mapping? This would help assess whether the comparisons are computationally fair.
Questions for authors
See weaknesses.
3 comments
Most of my concerns are solved, I have raised my score.
Thank You for Your Positive Feedback!
Thank you so much for your positive feedback! It encourages us a lot.
We appreciate your recognition that our rebuttal addressed your main concerns. We fully agree that these clarifications are important, and we will incorporate the additional explanations and results into the revision.
Dear Reviewer x8wE, thank you very much for your careful review of our paper and constructive comments. We are encouraged by your positive comments on our novel and intuitive perspective, its potential value as a watermarking design guideline, and our comprehensive evaluation of watermarking functionality, visual quality, and robustness. We hope the following responses can clarify potential misunderstandings and alleviate your concerns.
W1. Definition of dimensionality and payload representation
A1: There may be a misunderstanding regarding the meaning of dimensionality in DiM. We clarify it from the following two aspects.
1. Dimensionality includes the corresponding payload representation
As stated in the Abstract (Lines 15–17) and Introduction (Lines 45–47), DiM represents watermark information as payloads of different dimensionalities, including 1D binary messages, 2D spatial masks, and 3D spatiotemporal structures. Therefore, the additional structural information you mention is part of the 3D payload representation itself, rather than an independent addition outside the dimensional mapping.
2. Additional ablation with M1,1
We additionally evaluate an M1,1 baseline using the same MaskWM backbone. Compared with M1,1, M1,3 introduces a 3D payload representation at the extraction stage, thereby realizing a mapping from a low-dimensional space to a high-dimensional space. As shown below, M1,3 achieves substantially higher extraction accuracy under local embedding, supporting the effectiveness of this mapping.
W2. Frame-order recovery for long videos
A2:
1. Watermark encoding versus the temporal-protection protocol
Temporal protection has two layers:
Watermark encoding and extraction. This layer embeds and recovers frame-identity information.
Temporal-protection protocol. This layer organizes the codes, authenticates frame identities, and reconstructs temporal order for a particular application.
DiM focuses on the first layer through multi-channel-mask encoding and does not bind the mechanism to a single application protocol. For example, a coarse-grained protocol may assign codes at the 8-frame-clip level, whereas a key-frame protocol may assign distinct codes only to selected frames.
2. Exact sequence recovery on 100-frame videos
To evaluate complete order recovery directly, we use a more challenging frame-wise protection protocol on 100-frame videos.
Clip processing. Following Appendix C, each video is processed as a set of 8-frame clips.
Within-clip recovery. Multi-channel masks recover frame identities and order within each clip.
Across-clip recovery. Because the same within-clip codes may be reused across clips, we use temporal continuity between neighboring frames and clip boundaries, measured by MSE, to infer clip grouping and clip order.
Strict success criterion. A video is counted as correct only if all 100 frames are recovered in the exact original order.
Under this strict criterion, the exact sequence-level ordering accuracy is 98.78%.
W3. Parameter counts and inference time
A3:
1. Parameter counts
The parameter counts of each component are summarized below. Across the DiM mappings, the encoder and decoder have the same reported parameter counts, while the mask prediction network differs.
2. Inference time
Table 6 already reports inference efficiency in FPS, calculated as the number of processed frames divided by the elapsed time. For clarity, we convert these values into average processing time per frame, using tframe=1000/FPS in milliseconds.