- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes FLYMARK, a training-free watermarking framework for 3D Gaussian Splatting (3DGS) scenes that embeds ownership evidence directly into the stored scene parameters rather than relying on a separately trained encoder, decoder, or rendered views. The method uses the photoreceptor layout of a published fly connectome as a fixed, public, and reproducible carrier geometry. A virtual observer orbits the scene and computes cone-wise apparent luminance from the stored Gaussian centers, colors, and opacities. A keyed, dithered quantization-index modulation scheme redundantly encodes message bits across these observations, while majority voting enables deterministic extraction without a learned decoder.
To realize the watermark, FLYMARK formulates a sparse bounded least-squares problem that modifies only the existing degree-zero color parameters under hard per-channel linear-RGB constraints. The method preserves Gaussian positions, point counts, covariances, opacities, and higher-order spherical harmonics bit-identically. The authors evaluate FLYMARK on synthetic and real 3DGS scenes using a configuration fixed before evaluation, measuring clean bit recovery, visual fidelity, robustness to model-domain transformations, and separation between matched and wrong keys. The reported results demonstrate high bit accuracy and visual fidelity, robustness to the evaluated transformations, and effective wrong-key separation. An additional natural-image experiment is conducted to show that the retinal carrier and keyed QIM design can also support bounded watermarking of ordinary 2D images.
Critical strengths
-
Training-independent and potentially long-term verifiable watermarking. A key strength is that the watermark is embedded directly into the released 3DGS parameters and can be extracted without a separately trained encoder or decoder. This makes the ownership evidence less dependent on specific training artifacts or proprietary embedding models, potentially allowing the watermark to remain verifiable over the long term and to be integrated with existing 3DGS training and asset-generation pipelines.
-
Effective parameter-space design with strong preservation properties. The proposed bounded least-squares formulation modifies only the degree-zero color parameters while preserving geometry, opacities, covariances, and higher-order appearance parameters bit-identically. This provides a practical balance between watermark embedding, visual fidelity, and preservation of the original 3DGS representation.
Critical weaknesses
-
The experimental evaluation appears incomplete. Lines 280–283 state that the method is evaluated on eight NeRF-Synthetic scenes and nine Mip-NeRF 360 scenes, but the main paper provides only three qualitative examples in Fig. 3 (Lego, Hotdog, and Bonsai). No additional qualitative results are provided, and I could not find supplementary materials. More representative visual results are needed to support the claims and demonstrate the method's generalization.
-
The ablation study needs to be more comprehensive. Please provide ablation results for each major design component, including cone activation, keyed QIM, and parity voting. For example, why is cone activation preferable to alternative activation strategies? Why is keyed QIM used instead of other coding mechanisms, and what is the performance improvement? Similarly, what is the contribution of parity voting? These ablations should include both quantitative and qualitative results, together with an analysis of model complexity and runtime.
-
The claim that the watermark preserves 3DGS geometry requires stronger evidence. Although the abstract claims that the method preserves the geometry of the Gaussian Splatting representation, the current evaluation appears to focus mainly on appearance-based metrics. Please provide geometric evaluation, such as reconstructed geometry compared with the ground truth or rendered depth comparisons and quantitative depth/geometric metrics, to substantiate this claim.
-
Several important technical details remain unclear. For example, the paper should explain the motivation and implementation of repeated readout, the purpose and mechanism of parity voting, and how cone activation and keyed QIM are defined and implemented. More details about the relevant feature representations, dimensions, and tensor shapes would also improve the reproducibility and clarity of the method.
-
Robustness and practical deployment need further clarification. How robust is the proposed watermark to noise or perturbations applied to the Gaussian Splatting parameters? If it is not robust to certain perturbations, the corresponding limitations and failure cases should be clearly discussed. In addition, please clarify whether watermark embedding and extraction must be performed jointly with the Gaussian Splatting training of a specific scene, or whether the method can be directly applied to an already-trained 3DGS scene without retraining.
-
Evaluation on more complex 3DGS scenes would strengthen the generalization claim. It would be valuable to evaluate the method on larger and more complex scenes, such as Tanks and Temples or larger Mip-NeRF 360 scenes, including challenging indoor and outdoor environments. This would provide stronger evidence that the proposed watermarking method generalizes beyond relatively small or simple scenes.
Questions for authors
-
Can the authors clarify whether the reported evaluation is complete? The paper states that eight NeRF-Synthetic and nine Mip-NeRF 360 scenes are evaluated, but only three qualitative examples are shown in the main paper. Are additional qualitative results or supplementary materials available that demonstrate the method across the full set of evaluated scenes?
-
What is the contribution of each major design component to the final performance? In particular, how much do cone activation, keyed QIM, repeated readout, and parity voting contribute individually? Are there ablations comparing these choices with reasonable alternatives?
-
Can the authors provide evidence supporting the claim that the proposed method preserves 3DGS geometry? Since the current evaluation appears to focus mainly on appearance-based metrics, how does the geometry or depth of the watermarked scene compare with the original scene quantitatively and qualitatively?
-
Can the authors clarify the practical deployment setting of FLYMARK? Can the method be applied directly to an already-trained 3DGS scene by embedding and subsequently extracting the watermark, or must watermark embedding be integrated into the scene-specific Gaussian Splatting training process?
-
How robust is the watermark to parameter-space perturbations or common modifications of a 3DGS model? In particular, what types and magnitudes of noise, pruning, quantization, or other model transformations can the watermark tolerate before reliable extraction fails?
10 comments
Response to Reviewer xjxG (2/4)
W2 / Q2. Component contributions, alternatives and cost
1) “why is cone activation preferable to alternative activation strategies?”
Cone activation provides a local angular measurement that pools multiple Gaussians rather than selecting a single element. Dividing by the cone membership count makes it an average rather than a sum that grows directly with that count. Most importantly, with memberships and opacities fixed, the mean opacity-weighted luminance is linear in the Gaussian color shifts. This gives the sparse linear measurement operator used by the bounded color solve in original Sections 3.3–3.5 and C.3. The same functional can be recomputed directly from stored model parameters, without rendering or a learned decoder.
Original Table 1 compares a parameter-space alternative, SpatialHash-QIM, which replaces cone grouping with keyed spatial assignment under the same message length and color budget.
2) “What is the contribution of each major design component to the final performance? In particular, how much do cone activation, keyed QIM, repeated readout, and parity voting contribute individually? Are there ablations comparing these choices with reasonable alternatives?”
Original Table 4 reports the following component comparisons on Lego, Chair, Ficus and Materials with key 17. All variants below use the same 0.02 per-channel linear-RGB edit bound; the measured fidelity is shown alongside bit accuracy.
| Variant | Bit accuracy | Direct PSNR (dB) |
|---|---|---|
| Full method | 100.00% | 46.02 |
| One orbit stop | 89.06% | 50.13 |
| No keyed dither | 91.41% | 46.29 |
Cone activation. Across ten scenes and three keys in original Table 1, cone activation gives 99.27% bit accuracy and 44.21 dB direct PSNR, versus 83.12% and 44.41 dB for keyed spatial assignment.
Keyed QIM. The no-keyed-dither control in original Table 4 isolates the dither component of keyed QIM: bit accuracy decreases from 100.00% to 91.41%, a difference of 8.59 percentage points. For an alternative coding mechanism, revised Section F.6, Table 19 matches the carrier, orbit, eligibility, bounded solve, color budget and RMS target displacement for QIM and blind additive spread spectrum. The control follows the standard SS formulation reviewed in Section II of [r3] and decodes by centered correlation of received readings with keyed signs. Neither decoder requires unmarked luminance readings. Clean bit accuracy is 100.00% for FlyMark and 70.31% for the blind additive control. On these four scenes, mean bit-accuracy Macro-AUC over the ten registered attack families is 0.8978 for FlyMark and 0.6895 for blind additive SS. Full-test direct PSNR is 46.02 dB and 45.93 dB, respectively.
Repeated readout. Extraction repeats the cone-activation computation on the received model. The orbit-stop ablation in original Table 4 tests the contribution of collecting these observations at multiple orbit locations: reducing the orbit from 24 stops to one lowers bit accuracy from 100.00% to 89.06%, a difference of 10.94 percentage points.
Parity voting. Each observation's integer parity gives a binary decision, and majority aggregation combines the repeated decisions. The same-marked-asset control in revised Section F.6, Table 19 compares one uniformly selected eligible observation per bit with all-vote majority aggregation. Expected bit accuracy is 64.84% with a single observation and 100.00% with majority aggregation, a gain of 35.16 percentage points. This comparison changes only decoding, not the marked model.
3) “These ablations should include both quantitative and qualitative results”
Revised Section F.5, Figure 7 shows matched outputs and equal-size amplified differences for the full, one-stop, no-dither and spatial-assignment variants on all four component-study scenes. Revised Section F.6, Figure 8 provides the corresponding QIM/additive comparison.
4) “an analysis of model complexity and runtime”
Revised Section F.5, Table 18 reports the actual design sizes and recorded CPU costs on those same four scenes. Median embedding time is 62.41 s for the full method, 2.48 s for one stop, 59.72 s without dither and 61.62 s for additive coding. All variants configure eight CPU threads. One stop reduces mean matrix nonzeros from approximately 850,000 to 35,000; removing dither or changing to additive coding preserves the design size.
All these variants have zero learned decoder parameters. Revised Table 5 and Section B report implementation costs and count all required decoder weights, including frozen feature encoders. Extraction constructs one spatial index per orbit stop and then performs cone queries, arithmetic and votes, without rendering or neural inference.
Response to Reviewer xjxG (3/4)
W3 / Q3. Geometry and depth preservation
1) “Can the authors provide evidence supporting the claim that the proposed method preserves 3DGS geometry?”
The preservation claim concerns embedding-induced change relative to the original reconstruction. Original Section 3.1, Equation (1), Section 3.5, Section 4.2.1 and Section C.3 specify the structural contract, degree-zero-only writes and field-level checks. We have independently repeated the serialized-field comparison on all 51 scene/key assets across eight Synthetic and nine real scenes. Count, positions, scales, rotations, opacity and every non-DC SH coefficient are exactly unchanged, as reported in revised Section I.3.
2) “how does the geometry or depth of the watermarked scene compare with the original scene quantitatively and qualitatively?”
We render the color-independent depth defined in revised Section I.3 at three fixed views each of Lego, Hotdog and Bonsai. Across nine pairs and 5,946,228 valid pixel comparisons, MAE, RMSE and maximum absolute depth error are zero; complete depth and accumulated-opacity arrays are bit-identical. Revised Section I.3, Figure 18 displays the measured depths and differences and defines the valid-opacity mask.
W4. Repeated readout, parity and tensor shapes
1) “the motivation and implementation of repeated readout”
Repeat readout evaluates the same cone-luminance functional on the received model to obtain the post-embedding readings. It supplies the measurements to the decoder using the public carrier and orbit, without rendering. Original Sections 3.3 and 3.6 and revised Section C.2 specify this computation.
2) “the purpose and mechanism of parity voting”
Rounding a keyed normalized reading gives an integer; its even or odd parity encodes one binary vote. Majority aggregates the eligible votes assigned to each message bit with a deterministic tie rule. Original Section 3.6 and revised Section C.2 distinguish this observation-level decision from aggregation across repeated observations.
3) “how cone activation and keyed QIM are defined and implemented.”
Cone activation averages the opacity-weighted luminance of its member Gaussians: , where and . Keyed QIM generates from the key and chooses the nearest point whose integer parity equals the assigned message bit. These points form the targets for the bounded color solve, as defined in original Sections 3.4–3.5.
4) “More details about the relevant feature representations, dimensions, and tensor shapes would also improve the reproducibility and clarity of the method.”
The numerical objects are explicit parameter arrays. Original Sections 3.2–3.6 and Section C.1–C.3 define luminance, membership, sparse realization, parity and majority. Revised Section C.4 adds the shapes: for Gaussians, centers and linear RGB are , opacity is length , and the directions form . The stops produce readings, with the same indexing for eligibility, dither and target arrays. Flattened observation index modulo message length assigns each observation to a bit. With eligible observations and writable color shifts, the realization matrix is sparse , and the unknown shift vector has length .
Response to Reviewer xjxG (1/4)
We thank the reviewer for the detailed feedback and suggestions for clarifying the evaluation and method.
We have uploaded the revised manuscript, with changes marked in red. Below, we respond to each question.
“Can the authors clarify whether the reported evaluation is complete and whether additional qualitative results or supplementary materials are available that demonstrate the method across the full set of evaluated scenes?”
Original Table 2 and Section B.1, Table 6 report held-out Synthetic and all nine Mip-NeRF 360 scenes, with their evaluation roles. The original submission also includes three registered views each of Lego, Hotdog and Bonsai in original Section H, Figures 7–9, beyond the examples in Figure 3. The Supplementary Materials contain the implementation and reproduction README.
To make full visual coverage easy to inspect, revised Section H, Figures 12–17 now adds all 23 evaluated scenes: eight NeRF Synthetic, nine Mip-NeRF 360 and six Tanks and Temples scenes, each with a reference, marked output and amplified difference. Cameras and crops match within each comparison, with bit accuracy and displayed-view PSNR annotated. These figures are integrated into the revised PDF.