• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.64-73
• /
• 2004

A robust watermarking algorithm is proposed for 3D mesh models. Watermark is inserted into the 2D image which is extracted from the target 3D model. Each Pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model. This extracted image is defined as “range image” in this paper. Watermark is embedded into the range image. Then, watermarked 3D mesh is obtained by modifying vertices using the watermarked range Image. In extraction procedure, the original model is needed. After registration between the original and the watermarked models, two range images are extracted from each 3D model. From these images. embedded watermark is extracted. Experimental results show that the proposed algorithm is robust against the attacks such as rotation, translation, uniform scaling, mesh simplification, AWGN and quantization of vertex coordinates.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.156-163
• /
• 2003

Most watermarking techniques insert watermarks into transform coefficients in the frequency domain because we can consider robust or imperceptible frequency bands against malicious attacks to remove them. However, parameterization of 3-D data is not easy because of irregular attribution of connectivity information, while 1-I) or 2-D data is regular. In this paper we propose a new watermarking scheme for 3-D polygonal mesh models in the DCT domain. After we generate triangle strips by traversing the 3-D model and transform its vertex coordinates into the DCT domain, watermark signals are inserted into mid-frequency bands of AC coefficients for robustness and imperceptibility. We demonstrate that our scheme is robust against additive random noise, the affine transformation, and geometry compression by the MPEG-4 SNHC standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1194-1202
• /
• 2007

In this paper, we proposed a blind watermarking algorithm to apply to the rapid prototyping system. The 3D mesh model is used in the step of the CAD modeling before the making of the prototype system of the rapid prototyping system. STL type mesh modeling which is used in this system reduces the error of the system and improves the accuracy of the system. In the step of the CAD modeling, some transformations which do not change the model accuracy are used, but some transformations which change the model accuracy are not used because the mesh model error is related to the accuracy of the prototype system. Most watermarking algorithms embedded a specific random noise as the watermark information into the model. These kinds of the algorithms are not proper to the 3D model watermarking. The proposed algorithm can be used for the accurate prototyping system because it does not change the model after the watermark embedding This means it can be used for the copyright marking and the data integrity.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.67-78
• /
• 2005

We proposed a blind watermarking for 3D mesh model using the patch CEGIs. The CEGI is the 3D orientation histogram with complex weight whose magnitude is the mesh area and phase is the normal distance of the mesh from the designated origin. In the proposed algorithm we divide the 3D mesh model into the number of patch that determined adaptively to the shape of model and calculate the patch CEGIs. Some cells for embedding the watermark are selected according to the rank of their magnitudes in each of patches after calculating the respective magnitude distributions of CEGI for each patches of a mesh model. Each of the watermark bit is embedded into cells with the same rank in these patch CEGI. Based on the patch center point and the rank table as watermark key, watermark extraction and realignment process are performed without the original mesh. In the rotated model, we perform the realignment process using Euler angle before the watermark extracting. The results of experiment verify that the proposed algorithm is imperceptible and robust against geometrical attacks of cropping, affine transformation and vertex randomization as well as topological attacks of remeshing and mesh simplification.

• Journal of the Korea Computer Graphics Society
• /
• v.11 no.1
• /
• pp.21-30
• /
• 2005

그래픽, 오디오, 텍스트 정보 등의 저작권 보호를 위해 사용되어오던 디지털 워터마킹은 이제 기하 정보의 저작권을 보호하는데에도 중요하게 쓰이게 되었다. 스펙트랄 영역에서의 다각형 모델에 대한 워터마킹은 여러가지 공격에 대하여 강건함을 갖는다. 우리는 기존의 스펙트랄 영역에서의 워터마킹 기법을 일반화하고 이에 기반한 새로운 방법을 제시한다. 워터마크를 삽입 할 때에 라플라시안 행렬의 고유값과 고유벡터를 찾지 않는다. 대신 스케일링 함수로 부터 얻어진 선형 작용소를 사용한다. 테스트 결과는 서로 상충되는 워터마크를 삽입하고 추출하는데 드는 비용과 공격에 대한 강건성을 어떻게 조정하였는지 보여준다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.81-92
• /
• 2006

This paper proposes a robustness watermarking for 3D mesh model based on projection onto convex sets (POCS). After designing the convex sets for robustness and invisibility among some requirements for watermarking system, a 3D-mesh model is projected alternatively onto two constraints convex sets until the convergence condition is satisfied. The robustness convex set are designed for embedding the watermark into the distance distribution of the vertices to robust against the attacks, such as mesh simplification, cropping, rotation, translation, scaling, and vertex randomization. The invisibility convex set are designed for the embedded watermark to be invisible. The decision values and index that the watermark was embedded with are used to extract the watermark without the original model. Experimental results verify that the watermarked mesh model has invisibility and robustness against the attacks, such as translation, scaling, mesh simplification, cropping, and vertex randomization.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.6
• /
• pp.131-142
• /
• 2007

In this paper, semi-fragile watermarking algorithm was proposed for the application to RP(Rapid Prototyping) system. In the case of the perceptual change or distortion of the original one, the prototype product will be affected from the process because the RP system requires the high precision measure. Therefore, the geometrical transformations like translation, rotation and scaling, the mesh order change and the file format change are used in the RP system because they do not change the basic shapes of the 3D models, but, the decimation and the smoothing are not used because they change the models. The proposed algorithm which is called semi-fragile watermarking is robust against to these kinds of manipulations which preserve the original shapes because it considers the limitations of the RP system, but fragile against to the other manipulations which change the original shapes. This algorithm does not change the model shapes after embedding the watermark information, that is, there is no shape difference between the original model and the watermarked model. so, it will be useful to authenticate the data integrity and hide the information in the field of mechanical engineering which requires the high precision measure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.256-268
• /
• 2007

In this paper, we present a watermarking method for 3-D mesh sequences. The main idea is to transform vertex norm with the identical connectivity index along temporal axis using wavelet transform and modify the distribution of wavelet coefficients in temporally high (or middle) frequency frames according to watermark bit to be embedded. All vertices are divided into groups, namely bin, using the distribution of coefficients in low frequency frames. As the vertices with the identical connectivity index over whole frames belong to one bin, their wavelet coefficients are also assigned into the same bin. Then, the watermark is embedded into the wavelet coefficients of vertex norm. Due to the use of the distribution, our method can retrieve the hidden watermark without any information about original mesh sequences in the process of watermark detection. Through simulations, we show that the proposed is flirty robust against various attacks that are probably concerned in copyright protection of 3-D mesh sequences.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.113-123
• /
• 2004

This paper presents a new collusion-secure fingerprinting scheme to embed fingerprints into three-dimensional(3-D) mesh models efficiently. In the proposed scheme, we make the same number of fingerprints as the number of customers based on the finite projective geometry, partition a 3-D mesh model related to the number of bits assigned to each fingerprint and then embed a watermark representing copyright information into each submesh to be marked. Considering imperceptibility and robustness of the watermarking algorithm we embed the watermark signal into mid-frequency DCT coefficients obtained by transforming vertex coordinates in the triangle strips which are generated from the submeshes to be marked. Experimental results show that our scheme is robust to additive random noises, MPEG-4 SNHC 3-D mesh coding, geometrical transformations, and fingerprint attacks by two traitors' collusion. In addition, we can reduce the number of bits assigned to each fingerprint significantly.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.149-159
• /
• 2008

In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.