• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.594-603
• /
• 2007

This paper proposes a watermarking scheme for 3D CAD design drawing. In the proposed scheme, we embed binary watermarks into line, arc, and polygon face components that are the basic component of 3D CAD design drawing. The embedding target component can be selected randomly among three components or by the component distribution in drawing. In line components, a watermark bit is embedded into the ratio of the length of a target line and an average length of lines that are connected into a target line. Furthermore, a watermark bit is embedded into a curvature radius on the basis of a center point in a arc component and also is embedded into a ratio of two sides in a polygonal face component. Experimental results verified that the proposed watermarking has the robustness against Format conversion, rotation translation, scaling, cropping, and layer cutting and also SNR of watermarked component is about 39.89-42.50 dB.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.323-326
• /
• 2002

In this paper, we propose a watermarking technique that it is possible to winnow illegal contents from scattered contents on the internet. The identification is performed using an embedded unique content ID by the watermarking technique. The proposed watermarking technique accepts A/D-D/A conversion and a lot of lossy compression such as MP3, AAC, WMA and Real Audio. Watermark robustness is enabled using group quantization, selecting watermark inserting point, and error correction code. Test results show that the correct extraction is about $90\%$ and SNR is above $50\~60dB$. The above figures means that the proposed technique is able to extract encoded information at least one more times per audio and that it is very difficult to discriminate between a watermarked audio and a original audio.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.4
• /
• pp.21-26
• /
• 2005

This paper presents a watermarking method using similarity between frames in the scene to resist to various attacks and to improve the video quality. This method inserts and detects a watermark in the frame pair every 3 frame. The experimental simulations show that the video quality is improved more than 45dB compared with previous methods and the watermark is resistant to frame drop, MPEG compression and low pass filter attacks.

• 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 Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.80-90
• /
• 2004

Watermarking algorithm for 3D mesh model using EGI distribution of each patch is proposed. The proposed algorithm divides a 3D mesh model into 6 patches to have the robustness against the partial geometric deformation. Plus, it uses EGI distributions as the consistent factor that has the robustness against the topological deformation. To satisfy both geometric and topological deformation, the same watermark bits for each subdivided patch are embedded by changing the mesh normal vectors. Moreover, the proposed algorithm does not need not only the original mesh model but also the resampling process to extract the watermark. Experimental results verify that the proposed algorithm is imperceptible and robust against geometrical and topological attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.472-484
• /
• 2004

We proposed 3D mesh watermarking algorithm using CEGI distribution. In the proposed algorithm, we divide a 3D mesh of VRML data into 6 patches using distance measure and embed the same watermark bits into the normal vector direction of meshes that mapped into the cells of each patch that have the large magnitude of complex weight of CEGI. The watermark can be extracted based on the known center point of each patch and order information of cell. In an attacked model by affine transformation, we accomplish the realignment process before the extraction of the watermark. Experiment results exhibited the proposed algorithm is robust by extracting watermark bit for geometrical and topological deformed models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11C
• /
• pp.1592-1599
• /
• 2004

In this paper, we proposed the 3D mesh watermarking using projection onto convex sets (POCS). 3D mesh is projected iteratively onto two constraint convex sets until it satisfy the convergence condition. These sets consist of the robustness set and the invisibility set that designed to embed watermark Watermark is extracted without original mesh by using the decision values and the index that watermark is embedded. Experimental results verified that the watermarked mesh have the robustness against mesh simplification, cropping, affine transformation, and vertex randomization as well as the invisibility.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.2
• /
• pp.95-100
• /
• 2007

Virtual Reality(VR) data in VR environments like Manufacturing industries are often created jointly by many creators. It is then necessary to provide protection of the joint-creatorship and the creatorship of each participating creator. This paper proposes Multiple Digital Watermarking Framework(MDWF) to solve the problem of joint-creatorship. The proposed framework, MDWF, makes use of 3D private watermarking technology and a novel key sharing protocol for joint-creatorship verification. MDWF embeds 3D private multiple watermarks for the creatorship of each participating creators in a non-overlapping manner during the creation process. After key agreement of all private keys, MDWF embeds an additional 3D private watermark for the joint-creatorship. Therefore MDWF successfully handles the creatorship dispute among creators. That is, each participation creator can prove his/her partial creatorship as well as joint-creatorship by MDWF. In addition, MDWF can solve the collusion problems because shared secret key(SSK) can be made by every users.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.691-694
• /
• 2003

This paper proposes an 3D face image watermarking method based on discrete wavelet transform(DWT). First, 3D face image are transformed by DWT and inserted gaussian watermark into frequency domain. To increase the robustness and perceptual invisibility of watermark, the proposed algorithm is combined with the characteristics of 3D face image and human visual system. The proposed method is invisible and blind watermarking which the original image is not required. Simulation results show that the proposed method is robust to the general attack such as JPEG compression, enhancement, noise, cropping, and filtering etc.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4042-4059
• /
• 2020

The development of new multimedia techniques such as 3D printing is increasingly attracting the public's attention towards 3D objects. An optimized robust and imperceptible watermarking method based on Ant Colony Optimization (ACO) and Weber Law is proposed for 3D polygonal models. The proposed approach partitions the host model into smaller sub meshes and generates a secret watermark from the sub meshes using Weber Law. ACO based optimized strength factor is identified for embedding the watermark. The secret watermark is embedded and extracted on the wavelet domain. The proposed scheme is robust against geometric and photometric attacks that overcomes the synchronization problem and authenticates the secret watermark from the distorted models. The primary characteristic of the proposed system is the flexibility achieved in data embedding capacity due to the optimized strength factor. Extensive simulation results shows enhanced performance of the recommended framework and robustness towards the most common attacks like geometric transformations, noise, cropping, mesh smoothening, and the combination of such attacks.