PDF
OA 학술지
Discrete Wavelet Transform for Watermarking Three-Dimensional Triangular Meshes from a Kinect Sensor
• • ABSTRACT
Discrete Wavelet Transform for Watermarking Three-Dimensional Triangular Meshes from a Kinect Sensor
KEYWORD
Three-dimensional triangular mesh , Wavelet , Constant regularization , Correction term , Kinect sensor
• ### 1. Introduction

Research on geometric processing, three-dimensional (3D) animation, and 3D reconstruction has been growing fast due to rapid technological development. One impact from this situation is the increase in data that can be created, especially 3D data. Because data is one of the intellectual property rights, its protection is of utmost importance and watermarking is one way to protect the data. The watermarking system concept is embedded from the watermark data to the source data. Watermark data can be in a text, audio, image, or video, or in a 3D file, and source data can also be in one of these formats.

Research in watermarking has been performed for many decades. For two decades, 3D watermarking especially has been performed and rapidly developed. Kanai et al.  used multiresolution wavelet decomposition to perform digital watermarking in 3D polygons. To perform multiresolution wavelet decomposition, a lazy wavelet has been proposed. This method uses complex computation because the ratio of the wavelet coefficient vector and edges should match. If it does not match, the shape of the 3D polygon will be changed. Other research about watermarking in 3D triangular meshes includes 3D irregular meshes based on wavelet multiresolution analysis , identification of a watermarking technique that can be performed on 3D triangular mesh , and blind watermarking using oblate spheroidal harmonics .

Neviere et al. have proposed a new watermarking method for 3D triangular mesh, a constraint optimization framework to perform the watermarking . This method also uses complex computation because it needs the input that has been previously optimized and this method has not been implemented to the data from the Kinect sensor. In this study, we proposed 3D triangular mesh watermarking based on discrete wavelet transform (DWT) and selecting one of the axes from a 3D coordinate system. Although DWT has previously been used by many researchers in 3D triangular mesh watermarking, we perform another approach in order to use the DWT without performing complex computations. Our approach uses constant regularization and a correction term. We also implement this watermarking to the 3D triangular mesh from the Kinect sensor, which can be created from depth data.

This research makes the following contributions:

1) providing a simple method for watermarking 3D triangular mesh, 2) introducing constant regularization and a correction term for 3D triangular mesh, 3) implementing watermarking to the data generated from the Kinect sensor.

The organization of this paper is as follows. Section 1 introduces the watermarking of 3D triangular meshes. In Section 2, 3D triangular mesh data and text data are presented in detail. In Section 3, we describe the insertion and extraction process. Section 4 introduces a correction term for correcting the 3D triangular meshes watermarked before the extraction process. Section 5 presents the experiments and results. Finally, we present our conclusions in Section 6.

### 2. Data

Building a watermarking system requires two main types of data: source and watermark. We used depth data that has been generated from the Kinect sensor and processed it to become 3D triangular mesh. Our watermark data was the text data because it is easy for the user. The user simply enters the text directly rather than provide an image, voice, or video that represents him or her.

### 2.1 3D Triangular Mesh Data

We used the kinect sensor as equipment for data acquisition. It produces good depth data when the distance between the object and the sensor are in the range 1.2–3.5 m . To implement this watermarking system, we used a face as the object, following the previously mentioned procedures to obtain the data.

Assume we have coarse depth data that can be represented as a scalar function d(x, y), with x and y as mapping coordinates. Unfortunatelly, the depth data is still two-dimensional (2D). In order to transform 2D to 3D, we can use the following equation

By following , we can obtain the smoothness of the 3D face point cloud. Since the 3D face point cloud is not connected at each vertex, the object cannot be realized. The object can be realized if each vertex is connected by an edge to another. This connectivity is computed automatically by creating an edge between two vertices that influence each other. Finally, the object can be represented as V (x, y, z) and has a size 3 × m, where m indicates the number of vertices.

### 2.2 Text Data

In this research, text data can be created by using a mixed set of characters, numbers, or symbols. Because it is created from these components, the text data has a string data type. In order to use text data in the watermark system, it should be converted to binary data.

Assume we have text data t that has a string data type. The text data t will be converted into decimal data by using an ASCII table. After we have decimal data on each component of the text data, we can calculate binary data directly by transforming the decimals to binary. This result can be defined as T, which is a column vector that has n length binary data. Figure 1 shows this part of the process. ### 3. 3D Triangular Mesh Watermarking

Given the object as source data and the text data as watermark data, the goal of 3D triangular mesh watermarking is to embed watermark data into the source data. Thereby, it is important to adapt watermark data to the characteristics of the source data.

There are two main steps in the 3D triangular mesh watermarking procedure: The first is the insertion process, in which the text data embeds into the object as shown in Figure 1. The second is the extraction process, in which the text data is extracted from the watermarked object as shown in Figure 2. ### 3.1 Insertion Process

To simplify the explanation, we mention again the object that can be represented as V (x, y, z) and the binary value of the text data, represented as T. Because 3D triangular meshes are very susceptible to changes in the value of vertices as small as possible, we need a method that can maintain the shape even though the binary value of text data T has been successfully embedded. We introduce DWT, selecting one of the coordinate axes and constant regularization to solve this problem.

Defined the column vector is one of the coordinate axes that has been selected and has a size 1 × m. Following , we compute the approximation coefficients and the detail coefficients from using DWT one level decomposition. A detailed explanation is as follows: can be produced from the downsampling result of the convolution between and a high pass filter coefficient with the downsampling factor is two. can be produced from the downsampling result of the convolution between and the low pass filter coefficient with the downsampling factor is two.

DWT has an impact in that where the decomposition level is greater, it will reduce the insertion space. Because of this reason, we used one level decomposition of DWT in our research. Before inserting the text data into the object, there are two main steps that should be required. The first step is that the size of T should match the insertion space. In the other words, nm/2. The second step is constant regularization. Constant regularization is needed to maintain the shape of the object. The following equation describes the constant regularization

where Tn is binary value in T at index n. In our experiment, we used C1and C2, which equal 0.005 and 0.001, respectively.

Because human eyes are sensitive to dents, it is important to maintain the shape of watermarked object so that it looks similar to the original object. In addition, much information from is contained in . Because of these reasons, we select as an insertion area; besides, there is no important information contained in .

To perform the insertion process , we sum each of the detailed coefficients with each of the constant regularizations

where is the watermarked detail coefficient of DWT.

After the insertion process finishes, the next step is watermarked object reconstruction. To perform this process, we should do inverse DWT using and . This result can be represented as and we can use to the following equation

where Vw(x, y, z) is the watermarked object.

### 3.2 Extraction Process

Assume we have a watermarked object that has been repaired using a correction term .The goal from the extraction process is to extract the text data from the watermarked data. Because our watermarking system is nonblind, we need the original object V (x, y, z) to perform it. The first step in the extraction process performs DWT to V (x, y, z) and . From this process, we have an approximation coefficient and the detail coefficient from V (x, y, z) is also an approximation coefficient and detail coefficient from Vwct (x, y, z). By using this information and also following Eqs. (5) and (6), we can determine the values at the insertion area and the binary data of the text data.

where is equal to ∆W ≠ 0, and is the mean value of .

Now, we have a set binary value of . A goal of the next step is text data reconstruction. In a similar way to the previous method, we will first convert the binary value, into a decimal value and we can then determine the text data, , by converting the decimal value to the character (string data type) using the ASCII table.

### 4. Correction Term

Attacks on a watermarked object is a reasonable condition. This is possible if a user wants to cheat on a person’s work. In order to solve this problem, the watermarking system should have a robust performance. Consider this problem: we introduce the correction term before the extraction process. This correction term satisfies each type of geometric attack. The types of geometric attacks that are proposed in this research are rotation, scale, and translation attacks.

The type of geometric attack should be known first before the correction term process. The procedure of this process is as follows. First, we investigate the rotation attack. We perform a comparison between the vertices from the original object and the vertices from the watermarked object that has been previously attacked. We also investigate the length of the result from each vertex comparison. If we can detect the result of a different length from each vertices comparison, we can determine a rotation attack.

The second procedure investigates a scale attack. To investigate this attack, we divide the vertices of the each axis from the watermaked object with the original one; we then compare the results to each other. We can determine a scale’s factor if we can detect these comparison results. If the two investigations previously cannot be known, we assume that the attack is a translation attack. A translation factor can be determined by using vertices subtraction between Vwattack(x, y, z) and V (x, y, z).

After we detect the type of attack, we can perform the correction term. The following equation describes the correction term of the rotation attack. The goal of the correction term in the rotation attack is to find the angle that influenced the watermarked object. This problem can be solved by using the least squared method. Assume that the watermarked object that has been attacked is Vwattack(x, y, z), and the axis rotation that has been detected before is xaxes. Therefore, the equation to perform the correction term for the rotation attack is

where Vwattack(y), Vwattack(z), V (y), and θ are the vertices in the yaxes of the watermarked object, vertices in the zaxes of the watermarked object, vertices in the yaxes of the original object, and the angle of the rotation attack, respectively.

In addition, there are three basic rotation matrices [Rx (θ), Ry (θ), Rz (θ)] in the 3D coordinate system and we can use the rotation matrix to repair the watermarked object from the attack.

The remaining correction terms are for the scale and translation attacks. We can use the division between Vwattack(x, y, z) and a scale that has been previously known as a correction term for the scale’s attack. For the translation attack, we can use the adding operation between the Vwattack(x, y, z) and the translation factor. The result from the correction term can be symbolized as Vwct(x, y, z).

### 5. Experiment

To represent characters, symbols, and numbers in text data, we used “Fd19?!” as text data. In order to determine the performance of the system, we performed a testing scheme using three scenario. The first scenario is a testing of the system using a rotation attack; the second scenario is a testing of the system using the scale’s attack. The last one is a testing system using a translation attack. The processes were carried out on a 2.4 GHz Intel core i3 processor with 2 GB memory.

### 5.1 Performance Parameters

Performance of the system was evaluated in terms of the vertices error rate (VER) and bit error rate (BER), defined as follows:

where i = 1, ⋯ , number of vertices and n = 1, ⋯ , number of bit. The number of vertices that we used in this system are 57786 for Obj1 and 60183 for Obj2. The number of bit is 42 bits. We compared the results based on the type of the DWT. We used Haar, Daubechies, and Symlets one level decomposition as the type of DWT and also we compared the result by using correction term and does not use correction term.

### 5.2 Performance Evaluation

In this experiment, we used a single attack, not a blending attack, to perform the attack. The sample of the angle that influence in xaxes of the 3D coordinate system for a rotation attack are a 30, 90, and 180. For the sample of source data, we used two kinds of 3D triangular mesh, Obj1 and Obj2. The scale factors that we used in this experiment for a scale’s attack are 0.5, 0.7, and 2, respectively. The translation attack was also performed in our system. For our translation attack, the translation coefficients are 0.001, 0.01, and 0.1, respectively. However, there is no limitation on angle selection, scale factor, and the translation coefficient, because the value of each factor is in the normal value of the attack.

From Table 1, the Haar DWT by using correction term produces the VER, which has a smaller result than the other type of DWT. Because the Haar DWT is the simplest type of DWT, it does not need a complex computation to perform it. The result of the extraction process, which is extremely good, is caused by a correction term, which is performed before extraction process and without correction term, which is affected by the attacks vertex will contain a value that can distort the shape of the object. The BER values show this result. Performance comparisons

### 6. Conclusions

This paper presents a simple method for 3D triangular mesh watermarking produced from a Kinect sensor. The key idea of this research is how to implement the DWT to perform 3D triangular mesh watermarking that does not have complex computation. By performing constant regularization and a correction term, the watermarking can be successful. It also produced a significant result for the VER and BER. Haar DWT is a type of DWT that produces the smallest value for the VER.

Because this research performed a single attack, future research should perform a blending attack. The simple and robust method of blind watermarking also can be performed for future research because in our research, we performed non-blind watermarking.

참고문헌
OAK XML 통계
이미지 / 테이블
• [ ] • [ Figure 1. ]  Insertion process of the 3D triangular mesh watermarking. • [ Figure 2. ]  Extraction process of the 3D triangular mesh watermarking. • [ ] • [ ] • [ ] • [ ] • [ ] • [ ] • [ ] • [ ] • [ ] • [ Table 1. ]  Performance comparisons (우)06579 서울시 서초구 반포대로 201(반포동)
Tel. 02-537-6389 ｜ Fax. 02-590-0571 ｜ 문의 : oak2014@korea.kr
{"ft_lang_label":"__label__en","ft_lang_prob":0.9273939,"math_prob":0.95149773,"size":10999,"snap":"2023-40-2023-50","text_gpt3_token_len":2232,"char_repetition_ratio":0.16189177,"word_repetition_ratio":0.013201321,"special_character_ratio":0.19274479,"punctuation_ratio":0.097077765,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9856084,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-10-02T14:21:36Z\",\"WARC-Record-ID\":\"<urn:uuid:ae12429b-799b-4634-99df-67749a84727d>\",\"Content-Length\":\"150453\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:09fe658f-a3f8-4f45-b30e-546830aac3d1>\",\"WARC-Concurrent-To\":\"<urn:uuid:841bc6fc-db40-4d9c-b1ab-4c47a0c745ea>\",\"WARC-IP-Address\":\"124.137.58.137\",\"WARC-Target-URI\":\"https://oak.go.kr/central/journallist/journaldetail.do?article_seq=17088\",\"WARC-Payload-Digest\":\"sha1:673BVEGYZ45MWJ532IOJFKZQFTPHXQ3S\",\"WARC-Block-Digest\":\"sha1:NBO7RDGCGSZTEOZ6P2YBXXU5XEVIMMGO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233511000.99_warc_CC-MAIN-20231002132844-20231002162844-00592.warc.gz\"}"}