Watermaking three-dimensional polygonal models

Ohbuchi, Ryutarou; Masuda, Hiroshi; Aono, Masaki

doi:10.1145/266180.266377

Cited by 185 publications

(93 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Some of these algorithms are spatial approaches and the embedding process modifies the vertices positions and geometrical invariants. The earliest 3D watermarking algorithms were proposed by Ohbuchi et al [13]. A variety of techniques in the spatial domain such as Triangle Similarity Quadruple method (TSQ) were suggested.…”

Section: Related Workmentioning

confidence: 99%

Euclidean Distance Distortion Based Robust and Blind Mesh Watermarking

Amar¹,

Trabelsi²,

Dey³

et al. 2016

IJIMAI

View full text Add to dashboard Cite

-The three-dimensional (3D) polygonal meshes are recently widely used in several domains, which necessitate the realistic visualization of the objects. Moreover, there is an urgent need to protect the 3D data properties for preventing unauthorized reproduction. The 3D digital watermarking technology is one of the best solutions to protect data from piracy during transmission through the internet. The current work proposed a novel robust watermarking scheme of polygonal meshes for copyright protection purposes. The proposed algorithm is based on the characteristics of the mesh geometry to embed a sequence of data bits into the object by slightly adjusting the vertex positions. Furthermore, the proposed method used a blind detection scheme. The watermarked model is perceptually indistinguishable from the original one and the embedded watermark is invariant to affine transformation. Through simulations, the quality of the watermarked object as well as the inserted watermark robustness against various types of attacks were tested and evaluated to prove the validity and the efficiency of our algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Euclidean Distance Distortion Based Robust and Blind Mesh Watermarking

Amar¹,

Trabelsi²,

Dey³

et al. 2016

IJIMAI

View full text Add to dashboard Cite

show abstract

“…In the first article on 3D model watermarking in 1997 Ohbuchi et al (1997b), one solution to the localization problem called indexed localization was given, and this has also been employed by many later 3D model watermarking algorithms such as Yeo and Yeung (1999); Benedens and Busch (2000); Benedens (2000); Cayre et al (2004); Chou and Tseng (2006); Wang and Hu (2009). Methods of this kind divide the watermark into several parts, give each part of the watermark a subscript, and embed each part the of watermark together with its subscript and a marker.…”

Section: Accepted M Manuscriptmentioning

confidence: 99%

“…A compromise scheme is called local localization by Ohbuchi et al (1997b). This scheme divides the vertices into groups, acting as global localization within each group, and acting as indexed localization between groups.…”

Section: Accepted M Manuscriptmentioning

confidence: 99%

Optimization approach for 3D model watermarking by linear binary programming

Wang

2010

Computer Aided Geometric Design

View full text Add to dashboard Cite

Watermarking algorithms provide a way of hiding or embedding some bits of information in a watermark. In the case of watermarking a 3D model, many algorithms employ a so-called indexed localization scheme. In this paper, we propose an optimization framework with two new steps for such watermarking algorithms to improve their capacity and invisibility. The first step is to find an optimal layout of invariant units to improve capacity. The second step is to rearrange the correspondence between the watermark units and the invariant units to improve invisibility. Experimental tests show that by using this framework, the capacity and invisibility of watermarking algorithms can be greatly improved.

show abstract

“…The challenge is to design 3-D digital watermarks that are unobtrusive (transparent), robust, and space efficient (capacity) [3]. The unobtrusive requirement means that the embedded watermark should not interfere with the intended use of a model, which may imply imperceptibility.…”

mentioning

confidence: 99%

Roughness-Adaptive 3-D Watermarking Based on Masking Effect of Surface Roughness

Kim

Barni

Tan

2010

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Abstract-We present a method to improve watermark robustness by exploiting the masking effect of surface roughness on watermark visibility. Our idea is to adapt watermark strength to local surface roughness based on the knowledge that human eyes are less sensitive to changes on a rougher surface patch than those on a smoother surface. In order to quantify human sensitivity to surface roughness of polygonal meshes, we conducted a rigorous psychovisual experiment to obtain human watermark detection thresholds as a function of surface roughness. The results can be used to adaptively select watermark strength according to local surface roughness during the watermark embedding process. To test our idea, we applied it to the modified versions of two popular 3-D watermarking methods, one proposed by Benedens and one by Cayre and Macq. Experimental results showed that our approach improves watermark robustness as compared to the original algorithms. Further analyses indicated that the average watermark strength allowed by our roughness-adaptive method was larger than that by the original Benedens's and Cayre and Macq's methods while ensuring watermark imperceptibility. This was the main reason for the improved robustness observed in our experiments. We conclude that exploiting the masking property of human vision is a viable way to improve the robustness of 3-D watermarks, and can potentially be applied to other 3-D digital watermarking techniques.Index Terms-Masking effect, polygonal mesh, robustness, roughness-adaptive 3-D watermarking, surface roughness.

show abstract

Watermaking three-dimensional polygonal models

Cited by 185 publications

References 10 publications

Euclidean Distance Distortion Based Robust and Blind Mesh Watermarking

Euclidean Distance Distortion Based Robust and Blind Mesh Watermarking

Optimization approach for 3D model watermarking by linear binary programming

Roughness-Adaptive 3-D Watermarking Based on Masking Effect of Surface Roughness

Contact Info

Product

Resources

About