The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Robust mesh watermarking
Abstract
Watermarking provides a mechanism for copyright protection of digital media by embedding infor-mation identifying the owner in the data. The bulk of the research on digital watermarks has focused on media such as images, video, audio, and text. Robust watermarks must be able to survive a va-riety of “attacks”, including resizing, cropping, and filtering. For resilience to such attacks, recent watermarking schemes employ a “spread-spectrum ” approach — they transform the document to the frequency domain (e.g. using DCT) and perturb the coefficients of the perceptually most significant basis functions. In this paper we extend this spread-spectrum approach for the robust watermarking of arbitrary triangle meshes. Generalization of the spread spectrum techniques to surfaces presents two major challenges. First, arbitrary surfaces lack a natural parametrization for frequency-based decomposition. Our solution is to construct a set of scalar basis function over the mesh vertices using a multiresolution analysis of the mesh. The watermark is embedded in the mesh by perturbing vertices along the direction of the surface normal, weighted by the basis functions. The second challenge is that attacks such as simplification may modify the connectivity of the mesh. We use an optimization technique to resam-ple an attacked mesh using the original mesh connectivity. Results demonstrate that our watermarks are resistant to common mesh processing operations such as translation, rotation, scaling, cropping, smoothing, simplification, and resampling, as well as malicious attacks such as the insertion of noise, modification of low-order bits, or even insertion of other watermarks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
Object modelling by registration of multiple range images
Chen, Y., & Medioni, G. (1992) · Image and Vision Computing · doi:10.1016/0262-8856(92)90066-c · Cited by 3,154
Hoppe, H. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237216 · Cited by 2,817
Self-citationA signal processing approach to fair surface design
Taubin, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218473 · Cited by 1,855
Multiresolution analysis of arbitrary meshes
Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, M., & Stuetzle, W. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218440 · Cited by 1,205
Self-citationvan Schyndel, R. G., Tirkel, A. Z., & Osborne, C. F. (2002) · Proceedings of 1st International Conference on Image Processing · doi:10.1109/icip.1994.413536 · Cited by 1,139
Image-adaptive watermarking using visual models
Podilchuk, C. I., & Zeng, W. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668975 · Cited by 849
Attacks on Copyright Marking Systems
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_16 · Cited by 835
The Representation, Recognition, and Locating of 3-D Objects
Faugeras, O. D., & Hebert, M. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500302 · Cited by 795
Interactive multi-resolution modeling on arbitrary meshes
Kobbelt, L., Campagna, S., Vorsatz, J., & Seidel, H.-P. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280831 · Cited by 655
MAPS: multiresolution adaptive parameterization of surfaces
Lee, A. W. F., Sweldens, W., Schröder, P., Cowsar, L., & Dobkin, D. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280828 · Cited by 626
Maillot, J., Yahia, H., & Verroust-Blondet, A. (1993) · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · doi:10.1145/166117.166120 · Cited by 342
Progressive simplicial complexes
Popović, J., & Hoppe, H. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258852 · Cited by 327
Self-citationWatermarking three-dimensional polygonal models through geometric and topological modifications
Ohbuchi, R., Masuda, H., & Aono, M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668977 · Cited by 279
Protecting digital media content
Memon, N., & Wong, P. W. (1998) · Communications of the ACM · doi:10.1145/278476.278485 · Cited by 248
Generating ROC curves for artificial neural networks
Woods, K. S., & Bowyer, K. W. (1997) · IEEE Transactions on Medical Imaging · doi:10.1109/42.585767 · Cited by 139
Cited by
Fast exact and approximate geodesics on meshes
Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S. J., & Hoppe, H. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073228 · Cited by 502
Self-citationCoding Algorithms for 3DTV—A Survey
Smolic, A., Mueller, K., Stefanoski, N., Ostermann, J., Gotchev, A., Akar, G. B., Triantafyllidis, G., & Koz, A. (2007) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2007.909972 · Cited by 280
Differential Representations for Mesh Processing
Sorkine, O. (2006) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2006.00999.x · Cited by 253
Metadata
- Authors
- Praun, E., Hoppe, H., & Finkelstein, A.
- Venue
- Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99
- Publisher
- ACM Press
- Published
- 1999
- Pages
- 49-56
- OpenAlex
- W2113463169
- Cited by
- 321
- References
- 18
- FWCI
- 7.81
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.