# Blind Robust 3D Mesh Watermarking Based on Mesh Saliency and Wavelet Transform for Copyright Protection

Mohamed Hamidi, Aladine Chetouani, Mohamed El Haziti, Mohammed El Hassouni, Hocine Cherifi

► To cite this version:

Mohamed Hamidi, Aladine Chetouani, Mohamed El Haziti, Mohammed El Hassouni, Hocine Cherifi.
Blind Robust 3D Mesh Watermarking Based on Mesh Saliency and Wavelet Transform for Copyright
Protection. Information, 2019, 10 (2), pp.67. 10.3390/info10020067. hal-04721953

HAL Id: hal-04721953

https://hal.science/hal-04721953v1

Submitted on 4 Oct 2024

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
Article

# Blind Robust 3D Mesh Watermarking Based on Mesh Saliency and Wavelet Transform for Copyright Protection

Mohamed Hamidi<sup>1,*</sup> <sup>□</sup>, Aladine Chetouani<sup>2</sup>, Mohamed El Haziti<sup>3</sup>, Mohammed El Hassouni<sup>4□</sup> and Hocine Cherifi<sup>5□</sup>

Received: 1 January 2019; Accepted: 22 January 2019; Published: 18 February 2019

<figure><img src="image_2.png" /></figure>

check for
updates

**Abstract:** Three-dimensional models have been extensively used in several applications including computer-aided design (CAD), video games, medical imaging due to the processing capability improvement of computers, and the development of network bandwidth. Therefore, the necessity of implementing 3D mesh watermarking schemes aiming to protect copyright has increased considerably. In this paper, a blind robust 3D mesh watermarking method based on mesh saliency and wavelet transform for copyright protection is proposed. The watermark is inserted by quantifying the wavelet coefficients using quantization index modulation (QIM) according to the mesh saliency of the 3D semiregular mesh. The synchronizing primitive is the distance between the mesh center and salient points in the descending order. The experimental results show the high imperceptibility of the proposed scheme while ensuring a good robustness against a wide range of attacks including smoothing, additive noise, element reordering, similarity transformations, etc.

**Keywords:** 3D mesh watermarking; mesh saliency; wavelet transform; quantization index modulation

## 1. Introduction

Due to the achieved development in telecommunication networks and digital media processing, the multimedia contents including image, audio, video, 3D objects can be easily copied and redistributed by unauthorized users. As a result, the need to protect these contents has increasingly become crucial. Digital watermarking, which consists of inserting a watermark in the host data to protect copyright, is considered as an efficient solution to overcome the above-mentioned issue [1]. Here, we consider only 3D triangular mesh as cover media and we address the robust watermarking. Three-dimensional objects are widely used in several applications such as computer aided design (CAD), virtual reality, and medical imaging. Unlike 2D images, several representation for 3D models exist, including NURBS, voxels, and meshes. However, the 3D mesh has become the standard representation because of its simplicity and usability [2]. A 3D mesh is a collection of polygonal facets that approximate a real 3D object. It has three primitives: vertices, facets, and edges. Another representation of the 3D mesh is geometry which refers to the coordinates of vertices and connectivity that describes the adjacency relations between the vertices and facets. The degree of a facet refers to

<footnote n="1">1 LRIT-CNRST URAC 29, Rabat IT Center, Faculty of Sciences, Mohammed V University in Rabat, Rabat, BP 1014, Morocco</footnote>

<footnote n="2">2 PRISME Laboratory, University of Orleans, 45100 Orléans, France; aladine.chetouani@univ-orleans.fr</footnote>

<footnote n="3">3 Higher School of Technology, Sale, BP 227, Morocco; elhazitim@gmail.com</footnote>

<footnote n="4">4 LRIT-CNRST URAC 29, Rabat IT Center, FLSH, Mohammed V University in Rabat, Rabat, BP 1014, Morocco; mohamed.elhassouni@gmail.com</footnote>

<footnote n="5">5 Laboratoire Electronique, Informatique et Image (Le2i) UMR 6306 CNRS, University of Burgundy, 21078 Dijon, France; hocine.cherifi@u-bourgogne.fr</footnote>

<footnote>* Correspondence: hamidi.mohamed24@gmail.com</footnote>
the number of its component's edges, while the number of incident edges of a vertex represents its valence. The majority of digital watermarking approaches have focused on image, video, and audio, while few works have been proposed for 3D meshes. This situation is mainly due to the difficulties encountered while manipulating the complex topology and irregular representation of 3D meshes, as well as the severity of the existing attacks. Unlike 2D images in which pixels have an intrinsic order to synchronize the watermark bits, 3D meshes have no obvious robust intrinsic ordering. Indeed, the intuitive order such as the order of vertices in the Cartesian coordinate system can be modified easily [3].

Each 3D watermarking technique should ensure a tradeoff between three main constraints [4]: imperceptibility, capacity, and robustness. Imperceptibility is the similarity between the original model and the stego model, while capacity refers to the maximum of bits that can be embedded in the 3D model. Robustness means the ability to extract the watermark bits from the stego mesh even after applying some manipulations called attacks. These latter can be divided into two main kinds. Geometric attacks such as local deformation operations, similarity transformations (translation, rotation, and uniform scaling), and signal processing manipulations that include noise addition, smoothing, and compression. Connectivity attacks include subdivision, cropping, remeshing, and simplification. Three-dimensional mesh watermarking techniques have different applications such as authentication, content enhancement, and copyright protection, among others. It is worth noticing that the proposed method focuses on copyright protection.

There are several classification criteria for 3D watermarking methods. According to the embedding domain, the existing methods can be divided into spatial [5] and transform techniques [6]. In the spatial domain, the watermark is embedded by modifying the geometry or the connectivity of the 3D mesh, while in the transform domain the watermark is inserted by altering the coefficients obtained after a certain transformation such as wavelet transform. Based on resistance to attacks, the watermarking algorithms can be classified into robust, semi-fragile, and fragile. Each kind is used in a specific application. It is well known that the robust methods are used with the aim of protecting copyright. These methods should ensure high robustness against common attacks such as signal processing attacks as well as geometric manipulations, while maintaining good imperceptibility. The proposed method is based on wavelet transform using the subdivision of Lounsbery et al. [7]. We note that such a transformation can be applied only for semi-regular meshes [3]. Several methods using wavelet transformation have been proposed [3,8,9].

Three-dimensional blind watermarking schemes have a very challenging issue, which consists of the geometric distortions causing damage to the mesh appearance. This problem can be more complex in some applications such as medical diagnostic or manufacturing, where a small modification can cause a significant difference between the original mesh and the watermarked one. The obvious way to overcome this issue is to use techniques that preserve the important regions of the 3D mesh. The importance of a vertex of a region can be different throughout the 3D surfaces for the human eye. To describe this importance, some techniques used the mesh saliency in order to define salient and non-salient regions [10–12]. Therefore, to ensure the invisibility requirement of the 3D mesh, the embedding of the watermark should not have a visual impact in the geometry of perceptual important regions. Thus, mesh saliency can provide important information and adjust the effects to the perceived quality of 3D models. In [3], Wang et al. proposed a hierarchical watermarking scheme for semi-regular meshes in which fragile, high-capacity, and robust watermarks have been embedded at different levels of resolutions using wavelet transform.

In fact, a few saliency-based watermarking methods for 3D meshes have been proposed. In [10], a 3D mesh watermarking algorithm based on the mesh saliency of Lee et al. [13] is presented. First, using the mesh saliency, perceptually conspicuous regions have been identified. Second, for each vertex, the norm is calculated and its histogram is constructed. Finally, the associated vertex norms of each bin are normalized. In [11], Son et al. presented a 3D watermarking technique aiming to preserve the appearance of the watermarked 3D mesh. The vertex norm histogram is used as a watermarking
primitive, which has been already proposed by Cho et al. [14]. Indeed, the watermark is embedded by modifying the mean or the variance of the vertex norm histogram. Recently, Medimegh et al. [12] proposed a robust and blind watermarking method for 3D meshes based on auto diffusion function (ADF). The authors extract the salient point using the (ADF), and the mesh is segmented according to these points and the watermark is inserted statistically in each region.

In this context, the proposed method takes the full advantage of mesh saliency and (QIM) quantization to design a watermarking method robust to a wide range of attacks and ensures high imperceptibility. The proposed method is based on the visual saliency associated with wavelet coefficient vectors. The watermark bits are inserted in the original 3D mesh by quantization of wavelet coefficient vectors after carrying out one wavelet decomposition. The coefficients to be quantized are chosen based on visual saliency of the 3D mesh, while the watermarking synchronization is the distance between the mesh center and salient points. This order has been found to be robust to different attacks such as similarity transformations and elements reordering.

The rest of this paper is organized as follows. Section 2 describes the used terminologies. The proposed method is reported in Section 3 followed by a presentation of the experimental setup in Section 4. Section 5 discusses the experimental results. The paper is concluded in Section 6.

## 2. Background

### 2.1. Three-Dimensional Mesh Saliency

Generally, the visual attention of humans is directed to the salient regions of the 3D mesh. The mesh saliency used in our method is Lee et al.'s [13] scheme. The saliency of each vertex is computed by utilizing the difference in the mean curvature of the 3D model regions from those at other vertices in the neighborhood. The surface curvatures are computed; the curvature at each vertex $v$ is calculated based on Taubin's scheme [15]. We note $Curv(v)$ as the mean curvature of a 3D model at a vertex $v$. The Gaussian-weighted average of the mean curvature can be defined as

$$G(Curv(v), \sigma) = \frac{\sum_{x \in N(v, 2\sigma)} Curv(x) \exp(-\|x-v\|^2 / 2\sigma^2)}{\sum_{x \in N(v, 2\sigma)} \exp(-\|x-v\|^2 / 2\sigma^2)} \quad (1)$$

where $x$ is a mesh point and $N(v, \sigma)$ denotes the neighborhood for a vertex $v$, which represents a set of points within a Euclidean distance $\sigma$ calculated as

$$N(v, \sigma) = \{x \mid \|x - v\| < \sigma\} \quad (2)$$

The saliency $S(v)$ of a vertex $v$ is calculated as the absolute difference between the Gaussian-weighted averages computed at fine and coarse scale.

$$S(v) = |G(Curv(v), \sigma) - G(Curv(v), 2\sigma)| \quad (3)$$

Figure 1 exhibits an example of mesh saliency of a cat and vase using Lee's method [13].
<figure><img src="image_3.png" /><figcaption>**Figure 1.** Three-dimensional meshes and their corresponding mesh saliency: (left) original 3D meshes; (right) 3D mesh saliency.</figcaption></figure>

## 2.2. Quantization Index Modulation

Quantization index modulation (QIM) schemes represent a set of non-linear data hiding. Most previous research has focused on applying QIM in image, audio, and video. However, few watermarking methods based on QIM have been proposed for 3D data. With the aim of inserting a binary message composed of 0 and 1 in the 3D mesh, two quantifiers are needed. Moreover, QIM methods are simple to implement and have a small complexity. In addition, they ensure a high tradeoff between capacity and robustness.

Let $b \in (0,1)$ represent the watermark bit and $x$ the host signal to quantize. It is worth noticing that the QIM operates independently on the above-mentioned elements. Two quantizers $Q_0$ and $Q_1$ are needed to insert a watermark bit $b$ [16]. These quantizers are calculated as follows:

$$Q_b(x) = \Delta\left[\frac{1}{\Delta}(x - (-1)^b \frac{\Delta}{4}) + (-1)^b \frac{\Delta}{4}\right] \quad (4)$$

where [] refers to the rounding operation and $\Delta$ refers to the quantization step. In order to extract the watermark bits, the two quantizers are recalculated as in an embedding process. The extracted bits are calculated as follows:

$$\hat{b} = \underset{y \in \mathcal{Y}}{\operatorname{argmin}} \|y - Q_b(y)\| \quad (5)$$

where $y = Q_b(x) + n$ and $n$ refers to the noise caused by the channel.

## 2.3. Multiresolution Wavelet Decomposition

Multiresolution analysis applied to 3D meshes has been widely used in the literature since it guarantees a good tradeoff between the mesh complexity and the processing of the available resource [17]. It produces different representations of the 3D mesh starting from the low frequencies (coarse mesh) to a set of medium and high frequencies representing detailed information at different resolution levels. Each level represents the same 3D mesh but with a different complexity. The advantage of using multiresolution analysis in 3D watermarking lies in the fact that it offers several embedding locations and provides high robustness and imperceptibility requirements. In addition, such analysis renders the watermarking method useful for several applications. Indeed, the coarsest level is used to insert a robust watermark for copyright protection, a fragile watermark can be embedded into a dense mesh to ensure authentication, etc. Wavelet transformation is a common
tool for performing mesh multiresolution analysis. The mathematical formula of synthesis and wavelet analysis of 3D models was introduced by Lounsbery et al. [7]. The principle of lazy wavelet decomposition for semi-regular triangular meshes is sketched in Figure 2. One iteration of lazy wavelet transform consists of merging each of the four triangles in one triangle at low-resolution level j + 1, i.e., three of the six initial vertices are conserved in the lower resolution and so on. The prediction errors for the deleted vertices ($v_4^j, v_5^j, v_6^j$) represent the wavelet coefficients ($W_1^{j+1}, W_2^{j+1}, W_3^{j+1}$). Note that such analysis can only be applied on a dense mesh with semi-regular connectivity. Figure 3 illustrates the wavelet decomposition of a bunny mesh. The multiresolution representation of the six vertices ($v_1^j, v_2^j, v_3^j, v_4^j, v_5^j, v_6^j$) can be expressed as follows:

$$V^{j+1} = A^{j+1}V^j \qquad (6)$$

$$W^{j+1} = B^{j+1}v^j \qquad (7)$$

where $V^j = [v_1^j, v_2^j, \dots, v_k^j]^T$ refers to the vertices coordinates at resolution level j, $k^j$ represents the number of vertices at level j, and $W^{j+1} = [w_1^{j+1}, w_2^{j+1}, \dots, w_k^{j+1}]^T$ is the wavelet coefficient vector at resolution level j + 1. $t^{j+1}$ is the number of wavelet coefficient vectors at resolution level j + 1, where $t^{j+1} = k^j - k^{j+1}$. $A^{j+1}$ is a non-square matrix that represents the triangle reduction by joining four triangles into one. Non-square matrix $B^{j+1}$ produces the wavelet vectors that start from the midpoint of the edge in the lower resolution j + 1 and ends at the vertices that are deleted at the same level j + 1.

<figure><img src="image_4.png" /><figcaption>Figure 2. Illustration of the lazy wavelet mechanism applied to a triangular semiregular mesh [18].</figcaption></figure>

<figure><img src="image_5.png" /><figcaption>Figure 3. Wavelet decomposition of the semi-regular Bunny mesh: (a) dense mesh; (b) after one wavelet decomposition; (c) after two wavelet decompositions; (d) coarsest representation of Bunny.</figcaption></figure>
### 3. The Proposed Method

In this paper, a blind robust 3D mesh watermarking technique based on mesh saliency and wavelet coefficients for copyright protection is proposed. The main contribution of this work is the use of QIM quantification of the wavelet coefficients as well as mesh saliency in order to ensure both high imperceptibility and robustness to a wide range of attacks. The imperceptibility requirement is achieved by exploiting the advantages of mesh saliency in order to define the wavelet vectors to be quantized, while robustness is ensured by using the QIM scheme of the selected wavelet vectors using the distance between the vertices and the mesh center as synchronizing primitives. Firstly, multiresolution analysis is applied to the original 3D semi-regular mesh giving a series of approximation meshes and a sequence of wavelet coefficients. Next, the mesh saliency is calculated for the mesh obtained after one wavelet decomposition and salient points are extracted. The reason behind using a certain level *l* (Figure 3b) is due to the good capacity-invisibility tradeoff offered. Afterwards, the norms of wavelet coefficients of these points are quantized using QIM quantization. The principle role of the mesh saliency is to define the candidate wavelet coefficients norms to be quantified. The wavelet coefficients, which correspond to the vertices that have the biggest saliency values, are chosen and their norms are quantized. A threshold (*T*<sub>r</sub>) representing the 70% maximum values of the saliency vector was adopted for all the 3D meshes. The embedding and extracting schemes are described in Figures 4 and 5, respectively.

<figure><img src="image_6.png" /><figcaption>Figure 4. The proposed embedding scheme.</figcaption></figure>

<figure><img src="image_7.png" /><figcaption>Figure 5. The proposed extraction scheme.</figcaption></figure>
### 3.1. Watermark Embedding

The first step is to do a wavelet analysis until an intermediate level *I* is reached, after applying one wavelet decomposition of the original mesh. The watermarking primitive is the wavelet coefficient in the level *I*. The watermark bits are inserted by modifying the norm wavelet coefficients associated with the sorted vertices according to a predefined order. This order is defined as the Euclidean distance between the vertices and the mesh center. Firstly, the vertices are sorted in the descending order according to their distance to the mesh gravity. Next, the salient points in the level *I* are extracted by calculating the mesh saliency using Lee et al.'s methods [13]. Afterwards, the wavelet coefficients corresponding to the salient vertices in the level *I* and their Euclidean norms are calculated. To define a salient point, a threshold $T_r$ is defined in order to choose a candidate wavelet coefficient to be altered in the embedding process. The parameter $T_r$ is here chosen as 70% maximum values of the saliency vector, which has been adopted for all 3D objects. Thus, the wavelet coefficients corresponding to the salient points are quantized using a QIM scheme. Finally, the watermarked 3D mesh is reconstructed starting from the modified wavelet coefficients norms using Equation (8) [19].

$$V'(x', y', z') = \frac{\|W_C'\|}{\|W_C\|} V(x, y, z) \qquad (8)$$

where $\|W_C'\|$ and $\|W_C\|$ refers to the modified wavelet coefficient after embedding and the wavelet coefficients calculated before the watermark embedding, respectively. $V'(x', y', z')$ is the new vertex coordinate of the watermarked mesh, and $V(x, y, z)$ is the vertex coordinate of the original mesh. Figure 4 sketches the watermark insertion process, which is described in detail in Algorithm 1.

**Algorithm 1: Watermark embedding.**

**Require:** Original 3D mesh, Watermark, key_1, key_2.

**Ensure:** Watermarked 3D mesh.

1. Do wavelet analysis until an intermediate level *I* is reached.

2. Extract salient points of the 3D mesh in scale *I* using mesh saliency.

3. Find out the wavelet coefficients corresponding to the salient vertices according to the threshold $T_r$ and calculate their norms.

4. Quantify the norms of wavelet coefficients by the QIM scheme using Equation (4).

5. Reconstruct the mesh starting from the modified wavelet coefficients norms to obtain the watermarked 3D mesh.

### 3.2. Watermark Extraction

The watermark extraction is quite simple and blind. Neither the original object nor the watermark is needed in the extraction process; only the secret keys (key_1, key_2) that represent the generator of the watermark and the quantization step, respectively, are needed. First, multiresolution analysis is applied to the watermarked 3D mesh by performing wavelet decomposition until the level *I* is reached. Afterwards, the mesh saliency is carried out to the watermarked mesh and the modified wavelet coefficients are defined according to the threshold $T_r$. Next, the norms of the modified wavelet coefficients are re-quantized using the same quantizer as the embedding. Finally, the watermark bits
are extracted using Equation (5). Figure 5 illustrates the watermark extraction process that is presented in detail in Algorithm 2.

**Algorithm 2: Watermark extracting.**

**Require:** Watermarked 3D mesh, key_1, key_2.

**Ensure:** Watermark.

1. Do wavelet analysis starting from the watermarked mesh until level *I* is reached.

2. Calculate mesh saliency and extract the modified wavelet coefficients according to the threshold $T_r$.

3. Calculate the norms of the extracted wavelet coefficients and apply QIM quantization.

4. Extract the watermark bits using Equation (5).

**4. Experimental Setup**

The performance of the proposed watermarked method in terms of imperceptibility and robustness is tested on several 3D objects: Bunny (34,835 vertices, 69,666 facets), Horse (112,642 vertices, 225,280 facets), Venus (100,759 vertices, 201,514 facets), Armadillo (26,002 vertices, 52,000 facets), Rabbit (70,658 vertices, 141,312 facets), Flower (2523 vertices, 4895 facets), Vase (2527 vertices, 5004 facets), Cup (9076 vertices, 18,152 facets), Ant (7654 vertices, 15,304 facets), Bimba (8857 vertices, 17,710 facets), and Cat (3534 vertices, 6975 facets). LIRIS/EPFL General-Purpose [20] database was created in Switzerland and contains 88 models in total. It contains 4 reference models which are Armadillo, Dyno, venus and RockerArm. The subjective evaluation was done by 12 observers. The distortions that the reference mesh undergoes are smoothing and noise addition. We note that the scores are between 0 referring to good quality and 10 representing a bad quality. For each mesh, the average of the scores given by the 12 observers is computed in order to have a normalized mean opinion score (MOS). The LIRIS Masking database was created at the University of Lyon in France and contains 26 models, and the subjective evaluation was done by 11 observers [21]. Only some objects are taken from the two mentioned databases. The model sizes are provided in Table 1.

<table><caption>**Table 1.** Size of the 3D models used in the experiments.</caption><thead><tr><th>Model</th><th>Bunny</th><th>Horse</th><th>Venus</th><th>Armadillo</th><th>Rabbit</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>Size (Ko)</td><td>2448</td><td>8168</td><td>7182</td><td>2828</td><td>5039</td><td>154</td><td>155</td><td>576</td><td>482</td><td>219</td><td>577</td></tr></tbody></table>

Figure 6a,c,e show an example of three original 3D objects. The quantization step is tuned experimentally in such a way that ensures the best tradeoff between imperceptibility and robustness. To do so, extensive experiments have been conducted (see Figures 7–9) using several empirically different values of $\Delta$. We note that these experiments have been carried out for all the 3D meshes. For the brevity of space we have given only the results for 3D meshes Bimba, Horse, and Bunny. According to these results, the best found value is $\Delta = 0.10$. The parameter $T_r$, which represents the threshold used to choose the candidate wavelet coefficients, is kept at the 70% maximum value of the saliency vector. We note that the size of the used watermark in the simulations is 64 bits.

Subjective evaluation is done by human subjects, each subject provides a quality score. The MOS is the average of all the scores. Objective evaluation is done by metrics. The mean opinion score reflects the observers' opinions regarding the visual difference between the original mesh and the distorted one. The MOS values presented in Table 2 are obtained after calculating the average of scores given by the observers. For example, the MOS value of Armadillo taken from LIRIS-EPFL-Gen-Purpose [21] is 2.5. This value is obtained after averaging all the scores given by the 12 observers. The mean opinion score (MOS) values of Armadillo, Venus, and Bimba are shown in Table 2.
<table><caption>**Table 2.** Mean opinion score (MOS) for Armadillo, Venus, and Bimba objects taken from LIRIS-Mask [20] and LIRIS-EFPL-Gen-Purpose [21] databases.</caption><thead><tr><td>Object</td><td>Mean Opinion Score (MOS)</td></tr></thead><tbody><tr><td>Armadillo</td><td>2.5</td></tr><tr><td>Venus</td><td>2.917</td></tr><tr><td>Bimba</td><td>3.091</td></tr></tbody></table>

<figure><img src="image_8.png" /><figcaption>**Figure 6.** (a) Flower; (b) Watermarked Flower; (c) Vase; (d) Watermarked Vase; (e) Cup; (f) Watermarked Cup; (g) Ant; (h) Watermarked Ant; (i) Cat; (j) Watermarked Cat.</figcaption></figure>

<figure><img src="image_9.png" /><figcaption>**Figure 7.** The robustness performance in terms of correlation using several quantization steps for Bimba, Horse, and Bunny models.</figcaption></figure>

<figure><img src="image_10.png" /><figcaption>**Figure 8.** The imperceptibility performance in terms of MSDM using several quantization steps for Bimba, Horse, and Bunny models.</figcaption></figure>
<figure><img src="image_11.png" /><figcaption>Figure 9. The imperceptibility performance in terms of MRMS using several quantization steps for Bimba, Horse, and Bunny models.</figcaption></figure>

## 4.1. Evaluation Metrics

Before applying the attacks to the 3D models, different experiments were conducted to evaluate the effectiveness of the proposed method in terms of imperceptibility and robustness. The distortion introduced by the watermark insertion is compared objectively and visually. The robustness of the proposed scheme is evaluated using the normalized correlation (NC).

### 4.1.1. Imperceptibility

In order to evaluate the imperceptibility of the proposed method, several metrics were used to measure the amount of distortion introduced by the embedding process. This distortion can be measured geometrically or perceptually. The maximum root mean square error (MRMS) proposed in [22] was used to calculate the objective distortion between the original mesh and the watermarked ones.

The MRMS, which refers to the maximum between the two root mean square error (RMS) distances, is calculated by

$$d_{MRMS} = \max(d_{RMS}(M, Mw), d_{RMS}(Mw, M)) \qquad (9)$$

$$d_{RMS}(M, Mw) = \sqrt{\frac{1}{|M|} \int \int_{p \in M} d(p, Mw)^2 dM} \qquad (10)$$

where $p$ is a point on surface $M$, $|M|$ represents the area of $M$, and $d(p, Mw)$ is the point-to-surface distance between $p$ and $Mw$. It is worth noticing that surface-to-surface distance, as the MRMS metric, does not represent the visual distance between the two meshes [21]. Therefore, another perceptual metric is needed to measure the distortion caused by the watermark insertion.

The mesh structural distortion measure (MSDM) metric is chosen to measure the visual degradation of the watermarked meshes [21].

The MSDM value is equal to 0 when the original and watermarked 3D objects are identical. Otherwise, the MSDM value is equal to 1 when the objects are visually very different.

The global MSDM distance between the original mesh $M$ and the watermarked mesh $Mw$ having $n$ vertices respectively is defined by

$$d_{MSDM}(M, Mw) = \left( \frac{1}{n} \sum_{i=1}^{n} d_{LMSDM}(a_i, b_i)^3 \right)^{\frac{1}{3}} \in [0, 1). \qquad (11)$$
$d_{LMSDM}$ is the local MSDM distance between two mesh local windows a and b (in meshes M and Mw, respectively), which is defined by

$$d_{LMSDM}(a, b) = (0.4 \times \text{Curv}(a, b)^3 + 0.4 \times \text{Cont}(a, b)^3 \\ + 0.2 \times \text{Surf}(a, b)^3)^{\frac{1}{3}}. \qquad (12)$$

Curv, Cont, and Surf refers to curvature, contrast, and structure comparison functions, respectively.

### 4.1.2. Robustness

The robustness is measured using the normalized correlation (NC) between the inserted watermark and the extracted one as given by the following equation:

$$NC = \frac{\sum_{i=1}^{M} (w'_{i} - \bar{w}^{*})(w_{i} - \bar{w})}{\sqrt{\sum_{i=1}^{M} (w'_{i} - \bar{w}^{*})^{2} \cdot \sum_{i=1}^{M} (w_{i} - \bar{w})^{2}}} \qquad (13)$$

where $i \in \{1, 2, \dots, M\}$, $\bar{w}^*$ and $\bar{w}$ are the averages of the watermark bits, respectively.

## 5. Experimental Results

### 5.1. Imperceptibility

Figure 6 shows the original objects and the watermarked ones. It can be seen that the distortion is negligible and cannot be noticed by the human eye thanks to the use mesh saliency in the embedding process. This means that the imperceptibility of the proposed method is enough to make the viewer hard to distinguish the original mesh from the watermarked one. Figure 10 sketches the visual impact of the watermark caused by the watermark embedding for Bunny, Bimba, and Cat meshes. It can be seen in Figure 10 that no perceptible distortion caused by the watermark embedding exists, especially in salient regions. Besides, according to Table 3, it can be concluded that the proposed method can achieve a high imperceptibility performance in terms of MRMS, HD, and MSDM. We guess that this is achieved thanks to the exploitation of mesh saliency to minimize distortions after watermark insertion. In fact, only wavelet coefficients corresponding to salient vertices are altered. It can also be observed that imperceptibility results in terms of MRMS, HD, and MSDM are not the same for the test 3D meshes. We believe this is due to the curvature nature of each one of these 3D objects. In order to evaluate the importance of using mesh saliency in the proposed work, we compared the imperceptibility performance in terms of MRMS, HD, and MSDM without and with saliency. The obtained results for six 3D meshes are listed in Table 4. According to this table, the proposed scheme based on mesh saliency gives higher imperceptibility scores than the scheme without using saliency, which illustrates the importance of saliency to improve the imperceptibility performance of the proposed scheme especially for the MSDM, which is more correlated with human perception.

<table><caption>**Table 3.** Watermark imperceptibility measured in terms of maximum root mean square error (MRMS), HD, and mesh structural distortion measure (MSDM).</caption><thead><tr><th>Model</th><th>MRMS (10<sup>-3</sup>)</th><th>HD (10<sup>-3</sup>)</th><th>MSDM</th></tr></thead><tbody><tr><td>Flower</td><td>0.43</td><td>3.23</td><td>0.24</td></tr><tr><td>Vase</td><td>0.32</td><td>2.86</td><td>0.34</td></tr><tr><td>Cup</td><td>0.78</td><td>2.58</td><td>0.31</td></tr><tr><td>Ant</td><td>0.41</td><td>3.87</td><td>0.38</td></tr><tr><td>Cat</td><td>0.49</td><td>0.78</td><td>0.18</td></tr><tr><td>Bimba</td><td>0.31</td><td>1.41</td><td>0.12</td></tr></tbody></table>
<table><caption>**Table 4.** Watermark imperceptibility without and with saliency measured in terms of MRMS, HD, and MSDM.</caption><thead><tr><th>Model</th><th>MRMS (10<sup>-3</sup>)</th><th>HD (10<sup>-3</sup>)</th><th>MSDM</th></tr></thead><tbody><tr><td>Flower</td><td>0.84/0.43</td><td>4.88/3.23</td><td>0.78/0.24</td></tr><tr><td>Vase</td><td>0.55/0.32</td><td>4.67/2.86</td><td>0.75/0.34</td></tr><tr><td>Cup</td><td>0.09/0.78</td><td>3.22/2.58</td><td>0.81/0.31</td></tr><tr><td>Ant</td><td>0.77/0.41</td><td>3.36/3.87</td><td>0.89/0.38</td></tr><tr><td>Cat</td><td>0.95/0.49</td><td>1.8/0.78</td><td>0.28/0.18</td></tr><tr><td>Bimba</td><td>0.74/0.31</td><td>2.88/1.41</td><td>0.61/0.12</td></tr></tbody></table>

<figure><img src="image_12.png" /><figcaption>**Figure 10.** Closeups of the original and watermarked meshes: (a) Original Bunny; (b) Watermarked Bunny; (c) Original Bimba; (d) Watermarked Bimba; (e) Original Cat; (f) Watermarked Cat.</figcaption></figure>

## 5.2. Robustness

The resistance of the proposed watermarking method is tested under several attacks including element reordering, noise addition, smoothing, quantization, similarity transformations, translation, rotation, and uniform scaling) and cropping. To this end, Wang et al.'s benchmarking system has been used [23]. Figure 11 shows the Bimba object after several attacks. The robustness is measured using the normalized correlation *NC* between the extracted watermark bit and the original one.

The noise addition attack aims to add a pseudo-random noise on vertex coordinates. The robustness against this attack is primordial since it simulates the artifacts induced during mesh transmission. We added random noise to each vertex of the original 3D meshes using several intensities 0.05%, 0.10%, 0.30%, and 0.50%. Table 5 sketches the robustness results in terms of NC for six 3D
meshes. It can be seen from Table 5 that the proposed method is robust against noise addition for all the 3D test meshes.

<table><caption>**Table 5.** Watermark robustness against additive noise measured in terms of correlation.</caption><thead><tr><th>Noise Intensity</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>0.05%</td><td>1.0</td><td>1.0</td><td>0.98</td><td>0.99</td><td>0.98</td><td>1.0</td></tr><tr><td>0.10%</td><td>0.98</td><td>0.96</td><td>0.96</td><td>0.95</td><td>0.93</td><td>0.95</td></tr><tr><td>0.30%</td><td>0.86</td><td>0.88</td><td>0.86</td><td>0.92</td><td>0.91</td><td>0.90</td></tr><tr><td>0.50%</td><td>0.83</td><td>0.77</td><td>0.79</td><td>0.81</td><td>0.83</td><td>0.84</td></tr></tbody></table>

<figure><img src="image_13.png" /><figcaption>**Figure 11.** Original Bimba and seven attack versions: (a) the original Bimba; (b) a noise addition of 0.50%; (c) a smoothing of $\lambda = 0.1$ with 5 iterations; (d) a quantization of 9 bits; (e) similarity transformation; and (f) a cropping ratio of 10.0.</figcaption></figure>

The robustness performance of the proposed method was also tested against smoothing attack. This is a common operation aiming to remove the noise caused by the generation of the mesh. The smoothing applied to the watermarked 3D meshes is Laplacian smoothing [15] with a fixed deformation factor ($\lambda = 0.1$) with several amounts of iterations (5, 10, 30, and 50). Table 6 highlights the robustness evaluation of the proposed method in terms of NC. According to Table 6, it can be seen that our method can achieve high performance against this attack. Even with 50 iterations, the obtained NC values for the six objects are above 0.88.

The robustness performance has been investigated for element reordering attack in which the vertex/facets are reordered. It clearly appears from Table 7 that the method shows good robustness against element reordering manipulation for the three types of this attack presented in Wang et al.'s benchmark [23].
<table><caption>**Table 6.** Watermark robustness against Laplacian smoothing ($\lambda$ = 0.1) measured in terms of correlation.</caption><thead><tr><th>Number of Iterations</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>5</td><td>1.0</td><td>0.99</td><td>1.0</td><td>0.99</td><td>1.0</td><td>1.0</td></tr><tr><td>10</td><td>1.09</td><td>0.99</td><td>0.98</td><td>1.0</td><td>0.98</td><td>0.98</td></tr><tr><td>30</td><td>0.99</td><td>0.97</td><td>0.93</td><td>0.95</td><td>0.94</td><td>0.94</td></tr><tr><td>50</td><td>0.93</td><td>0.92</td><td>0.91</td><td>0.88</td><td>0.90</td><td>0.95</td></tr></tbody></table>

<table><caption>**Table 7.** Watermark robustness against element reordering measured in terms of correlation.</caption><thead><tr><th>Elements Reordering</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>Element Reordering 1</td><td>1.0</td><td>1.0</td><td>1.0</td><td>1.0</td><td>1.0</td><td>1.0</td></tr><tr><td>Element Reordering 2</td><td>0.99</td><td>0.98</td><td>1.0</td><td>0.97</td><td>1.0</td><td>0.99</td></tr><tr><td>Element Reordering 3</td><td>1.0</td><td>1.0</td><td>0.97</td><td>1.0</td><td>1.0</td><td>0.99</td></tr></tbody></table>

Quantization is a common operation used mainly in mesh compression. The watermarked 3D meshes have undergone this attack with several parameters (11 bits, 10 bits, 9 bits, 8 bits, and 7 bits), and the robustness performance in terms of normalized correlation is presented in Table 8. According to these results, it can be concluded that our method is able to withstand quantization attack. Table 9 presents the robustness comparison between Jeongho's method and the proposed method in terms of bit error rate (BER). It can be seen from Table 9 that the proposed method outperforms the scheme in [11].

<table><caption>**Table 8.** Watermark robustness against quantization measured in terms of correlation.</caption><thead><tr><th>Quantization</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>11 bits</td><td>1.0</td><td>1.0</td><td>1.0</td><td>1.0</td><td>1.0</td><td>1.0</td></tr><tr><td>10 bits</td><td>1.0</td><td>1.0</td><td>0.99</td><td>1.0</td><td>0.97</td><td>1.0</td></tr><tr><td>9 bits</td><td>0.99</td><td>0.99</td><td>0.97</td><td>0.99</td><td>1.0</td><td>0.98</td></tr><tr><td>8 bits</td><td>0.95</td><td>0.94</td><td>0.93</td><td>0.94</td><td>0.96</td><td>0.96</td></tr><tr><td>7 bits</td><td>0.83</td><td>0.83</td><td>0.81</td><td>0.82</td><td>0.82</td><td>0.91</td></tr></tbody></table>

<table><caption>**Table 9.** Results of comparison with the robustness of Son et al.'s [11] method measured in terms of BER against quantization.</caption><thead><tr><th>Quantization</th><th>[11]</th><th>Our Method</th></tr></thead><tbody><tr><td>7 bit</td><td>0.23</td><td>0.14</td></tr><tr><td>8 bit</td><td>0.15</td><td>0.09</td></tr><tr><td>9 bit</td><td>0.14</td><td>0.06</td></tr><tr><td>10 bit</td><td>0.03</td><td>0.02</td></tr><tr><td>11 bit</td><td>0.01</td><td>0.01</td></tr></tbody></table>

Similarity transformation is a common attack that every robust technique should be able to resist. It includes rotation, translation, and uniform scaling and their combination while keeping the mesh shape intact. Table 10 sketches the NC values after carrying out three types of similarity transformations. It can be remarked that the watermark is robust against these attacks regardless of the used 3D mesh.

Subdivision is one of the most used geometric attacks that objects can undergo. It consists of adding vertices and edges to the 3D mesh in order to obtain a modified version of a higher visual quality containing more details. The 3D test meshes were exposed to three typical subdivision schemes using one iteration. It includes a loop scheme, a midpoint scheme, and a $\sqrt{3}$ scheme. Table 11 presents the obtained results in terms of NC after applying the schemes mentioned before. According to Table 11, it can be observed that our method is quite robust to subdivision attacks for the three scheme and for all the 3D meshes used in the experiments. In addition, all the NC values are above 0.9.
Cropping attack is considered one of the most severe attacks that 3D can suffer from. This manipulation consists of cutting one part or several parts of the 3D mesh. This attack has been applied to the 3D objects using different ratios (10, 30, and 50). As depicted in Table 12, it can be concluded that the resistance of the proposed method against this attack shows relative weakness. We believe that this is due to the fact that the cropped regions could contain salient points that have been used to choose the wavelet coefficients to be quantized.

<table><caption>**Table 10.** Watermark robustness against similarity transformations measured in terms of correlation.</caption><thead><tr><th>Similarity Transformations</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>Similarity Transformation 1</td><td>1.0</td><td>0.97</td><td>1.0</td><td>0.98</td><td>1.0</td><td>0.99</td></tr><tr><td>Similarity Transformation 2</td><td>0.98</td><td>0.96</td><td>1.0</td><td>0.98</td><td>1.0</td><td>1.0</td></tr><tr><td>Similarity Transformation 3</td><td>0.99</td><td>0.99</td><td>1.0</td><td>1.0</td><td>0.98</td><td>0.94</td></tr></tbody></table>

<table><caption>**Table 11.** Watermark robustness against subdivision measured in terms of correlation.</caption><thead><tr><th>Subdivision</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>Loop iter 1</td><td>1.0</td><td>1.0</td><td>1.0</td><td>0.98</td><td>0.98</td><td>0.99</td></tr><tr><td>Midpoint iter 1</td><td>0.94</td><td>0.90</td><td>0.91</td><td>0.92</td><td>0.95</td><td>0.96</td></tr><tr><td>Sqrt3 iter 1</td><td>0.99</td><td>0.97</td><td>0.96</td><td>0.99</td><td>1.0</td><td>0.98</td></tr></tbody></table>

<table><caption>**Table 12.** Watermark robustness against cropping measured in terms of correlation.</caption><thead><tr><th>Cropping</th><th>Flower</th><th>Vase</th><th>Cup</th><th>Ant</th><th>Cat</th><th>Bimba</th></tr></thead><tbody><tr><td>10</td><td>0.55</td><td>0.59</td><td>0.64</td><td>0.61</td><td>0.68</td><td>0.52</td></tr><tr><td>30</td><td>0.45</td><td>0.32</td><td>0.37</td><td>0.41</td><td>0.38</td><td>0.34</td></tr><tr><td>50</td><td>0.32</td><td>0.15</td><td>0.17</td><td>0.22</td><td>0.24</td><td>0.19</td></tr></tbody></table>

### 5.3. Comparison with Alternative Methods

To further evaluate the performance of the proposed method, we compare it with methods [3,11,12,14,24] in terms of imperceptibility and robustness. It can be seen from Table 13 that the proposed method outperforms the imperceptibility of the schemes [14,24], and [11] in terms of MRMS and MSDM. In addition, the imperceptibility performance in terms of the HD of the proposed technique is compared to the scheme [12].

<table><caption>**Table 13.** Imperceptibility comparison with Cho's [14], Rolland-Neviere's [24] and Jeongho Son's [11] schemes measured in terms of MRMS and MSDM for the Horse model.</caption><thead><tr><th>Method</th><th>MRMS (10<sup>-3</sup>)</th><th>MSDM</th></tr></thead><tbody><tr><td>[14]</td><td>3.17</td><td>0.3197</td></tr><tr><td>[24]</td><td>1.48</td><td>0.2992</td></tr><tr><td>[11]</td><td>2.90</td><td>0.3197</td></tr><tr><td>Proposed method</td><td>0.38</td><td>0.2254</td></tr></tbody></table>

From Table 14, it can be highlighted that the proposed method achieves good imperceptibility performance. The reported results in terms of MRMS and HD illustrates the invisibility of the proposed method. Moreover, our scheme outperforms Wang et al.'s [3] scheme for MRMS and HD for the three objects Venus, Horse, and Rabbit.

Table 15 sketches the imperceptibility comparison with [14] and [12] schemes in terms of the Hausdorff distance for Bunny, Venus, and Horse models. As depicted in Table 15, the proposed technique achieves good results since all the obtained HD values are less than 1.71. Moreover, the proposed method outperforms Cho et al.'s [14] and Medimegh et al.'s [12] schemes. In addition, as depicted in Table 16, the proposed method shows high robustness to different attacks including
noise addition and smoothing, and outperforms the schemes in [14] and [12], except with respect to cropping attack, Medimegh et al.'s scheme [12] shows high robustness compared to our method. We believe that this is due to the redundant insertion of the watermark in several patches.

<table><caption>**Table 14.** Imperceptibility comparison with Wang et al.'s [3] method measured in terms of MRMS and MSDM for Horse and Venus models.</caption><thead><tr><th>Object</th><th>Venus</th><th>Horse</th><th>Rabbit</th></tr></thead><tbody><tr><td>MRMS (10<sup>-3</sup>)</td><td>1.21/0.72</td><td>0.64/0.62</td><td>1.12/0.54</td></tr><tr><td>HD (10<sup>-3</sup>)</td><td>5.87/2.18</td><td>2.65/1.86</td><td>3.99/3.63</td></tr></tbody></table>

<table><caption>**Table 15.** Imperceptibility comparison with Cho's [14], and Medimegh's [12] schemes measured in terms of HD.</caption><thead><tr><th>Object</th><th>Method</th><th>Hausdorff Distance (×10<sup>-3</sup>)</th></tr></thead><tbody><tr><td rowspan="3">Bunny</td><td>[14]</td><td>0.73</td></tr><tr><td>[12]</td><td>0.41</td></tr><tr><td>Our method</td><td>0.36</td></tr><tr><td rowspan="3">Venus</td><td>[14]</td><td>2.50</td></tr><tr><td>[12]</td><td>3.90</td></tr><tr><td>Our method</td><td>1.71</td></tr><tr><td rowspan="3">Horse</td><td>[14]</td><td>3.21</td></tr><tr><td>[12]</td><td>2.90</td></tr><tr><td>Our method</td><td>1.57</td></tr></tbody></table>

<table><caption>**Table 16.** Robustness comparison with Cho's [14], and Medimegh's [12] schemes measured in terms of NC.</caption><thead><tr><th>Attack</th><th>[14]</th><th>[12]</th><th>Our Method</th></tr></thead><tbody><tr><td>No attacks</td><td>1.0</td><td>1.0</td><td>1.0</td></tr><tr><td>Noise 0.10%</td><td>1.0</td><td>1.0</td><td>1.0</td></tr><tr><td>Smoothing</td><td>0.88</td><td>0.87</td><td>1.0</td></tr><tr><td>Cropping 10%</td><td>0.2</td><td>1.0</td><td>0.66</td></tr></tbody></table>

It can be seen in Figure 12 that the proposed scheme shows high robustness to several attacks including noise addition, quantization, and smoothing. Moreover, our methods achieve high robustness compared to Cho's method [14] in terms of normalized correlation.

The robustness of our method in terms of normalized correlation (NC) was compared to Wang et al.'s [3] method for noise addition, quantization, and smoothing attacks with different parameters. For noise addition, three amplitudes were used in the comparison. Quantization was applied with 9 bits, 8 bits, and 7 bits. Regarding smoothing attack, a watermarked rabbit has undergone this process using a fixed deformation factor $\lambda = 0.10$ with different iteration numbers. Figure 13 highlighted the obtained results for the Rabbit object. It can be observed from Figure 13 that the proposed method shows high robustness compared to Wang's method in terms of NC for noise addition, quantization, and smoothing. Moreover, as depicted in Table 17, the proposed method is able to withstand a smoothing attack, and the obtained results in terms of BER show the superiority of our method compared to Son's method [11]. Tables 18–20 show the quality and robustness comparison with Wang et al.'s method [3] against noise addition, quantization, and smoothing for Venus and Horse, respectively. The quality evaluation metrics used in the comparison are MRMS, HD, and MSDM, while the robustness is evaluated using NC.

Regarding noise addition, Horse and Venus were chosen as comparison meshes, and three amplitudes were used in the comparison 0.05%, 0.25%, and 0.5%. According to Table 18, it can be
concluded that our method is robust against noise and outperforms the obtained results of Wang's method in terms of robustness (NC) and quality (MRMS, HD, and MSDM).

<figure><img src="image_14.png" /><figcaption>**Figure 12.** The robustness comparison of Cho's method [14] with the proposed method in terms of NC for the Bunny model against several attacks: A: noise 0.1%; B: noise 0.3%; C: noise 0.5%; D: quantization of 9 bits; E: quantization of 8 bits; F: quantization of 7 bits; G: smoothing (0.3, 10 iterations); H: smoothing (0.3, 30 iterations); I: smoothing (0.3, 50 iterations).</figcaption></figure>

<figure><img src="image_15.png" /><figcaption>**Figure 13.** The results of the robustness comparison of Wang's method [3] with the proposed method in terms of NC for the Bunny model against several attacks: A: noise 0.05%; B: noise 0.25%; C: noise 0.5%; D: quantization of 9 bits; E: quantization of 8 bits; F: quantization of 7 bits; G: smoothing (0.1, 10 iterations); H: smoothing (0.1, 30 iterations); I: smoothing (0.1, 50 iterations).</figcaption></figure>

<table><caption>**Table 17.** Results of robustness comparison with Son et al.'s [11] method measured in terms of BER against smoothing.</caption><thead><tr><td>Smoothing</td><td>[11]</td><td>Our Method</td></tr></thead><tbody><tr><td>0</td><td>0.15</td><td>0.10</td></tr><tr><td>10</td><td>0.24</td><td>0.16</td></tr><tr><td>30</td><td>0.45</td><td>0.28</td></tr><tr><td>50</td><td>0.58</td><td>0.41</td></tr></tbody></table>
<table><caption>**Table 18.** Quality and robustness comparison with Wang et al.'s scheme [3] against noise addition measured in terms of MRMS, HD, MSDM, and NC.</caption><thead><tr><th>Model</th><th>Noise</th><th>NC</th><th>MRMS (10<sup>-3</sup>)</th><th>HD (10<sup>-3</sup>)</th><th>MSDM</th></tr></thead><tbody><tr><td rowspan="3">Venus</td><td>0.05%</td><td><strong>0.97</strong>/0.85</td><td><strong>0.16</strong>/0.17</td><td><strong>0.58</strong>/0.62</td><td><strong>0.12</strong>/0.28</td></tr><tr><td>0.25%</td><td><strong>0.88</strong>/0.59</td><td><strong>0.36</strong>/0.84</td><td><strong>0.81</strong>/3.15</td><td><strong>0.26</strong>/0.70</td></tr><tr><td>0.50%</td><td><strong>0.78</strong>/0.31</td><td><strong>0.41</strong>/1.67</td><td><strong>2.23</strong>/6.25</td><td><strong>0.38</strong>/0.83</td></tr><tr><td rowspan="3">Horse</td><td>0.05%</td><td><strong>0.98</strong>/0.96</td><td><strong>0.18</strong>/0.11</td><td><strong>0.37</strong>/0.41</td><td><strong>0.17</strong>/0.23</td></tr><tr><td>0.25%</td><td><strong>0.92</strong>/0.50</td><td><strong>0.35</strong>/0.55</td><td><strong>1.3</strong>/2.03</td><td><strong>0.32</strong>/0.64</td></tr><tr><td>0.5%</td><td><strong>0.77</strong>/0.08</td><td><strong>0.79</strong>/1.10</td><td><strong>2.98</strong>/4.07</td><td><strong>0.39</strong>/0.78</td></tr></tbody></table>

<table><caption>**Table 19.** Results of quality and robustness comparison with Wang et al.'s scheme [3] against quantization measured in terms of MRMS, HD, MSDM, and NC.</caption><thead><tr><th>Model</th><th>Parameter</th><th>NC</th><th>MRMS (10<sup>-3</sup>)</th><th>HD (10<sup>-3</sup>)</th><th>MSDM</th></tr></thead><tbody><tr><td rowspan="3">Venus</td><td>9 bits</td><td><strong>0.96</strong>/0.93</td><td><strong>0.18</strong>/0.93</td><td><strong>0.31</strong>/1.95</td><td><strong>0.17</strong>/0.49</td></tr><tr><td>8 bits</td><td><strong>0.93</strong>/0.70</td><td><strong>0.76</strong>/1.85</td><td><strong>2.4</strong>/3.90</td><td><strong>0.23</strong>/0.66</td></tr><tr><td>7 bits</td><td><strong>0.81</strong>/0.63</td><td><strong>1.65</strong>/3.70</td><td><strong>4.1</strong>/7.80</td><td><strong>0.28</strong>/0.79</td></tr><tr><td rowspan="3">Horse</td><td>9 bits</td><td><strong>0.97</strong>/0.61</td><td><strong>0.31</strong>/0.68</td><td><strong>1.87</strong>/1.95</td><td><strong>0.19</strong>/0.44</td></tr><tr><td>8 bits</td><td><strong>0.89</strong>/0.25</td><td><strong>0.51</strong>/1.35</td><td><strong>1.02</strong>/3.90</td><td><strong>0.24</strong>/0.60</td></tr><tr><td>7 bits</td><td><strong>0.78</strong>/0.17</td><td><strong>1.1</strong>/2.70</td><td><strong>3.21</strong>/7.80</td><td><strong>0.13</strong>/0.73</td></tr></tbody></table>

<table><caption>**Table 20.** Results of quality and robustness comparison with Wang et al.'s scheme [3] against Laplacian smoothing ($\lambda$ = 0.1) measured in terms of MRMS, HD, MSDM, and NC.</caption><thead><tr><th>Model</th><th>Iterations</th><th>NC</th><th>MRMS (10<sup>-3</sup>)</th><th>HD (10<sup>-3</sup>)</th><th>MSDM</th></tr></thead><tbody><tr><td rowspan="3">Venus</td><td>10</td><td><strong>1.0</strong>/0.74</td><td><strong>0.31</strong>/0.27</td><td><strong>1.87</strong>/5.65</td><td><strong>0.14</strong>/0.15</td></tr><tr><td>30</td><td><strong>0.98</strong>/0.71</td><td><strong>0.66</strong>/0.68</td><td><strong>3.95</strong>/9.75</td><td><strong>0.23</strong>/0.27</td></tr><tr><td>50</td><td><strong>0.93</strong>/0.62</td><td><strong>0.73</strong>/1.01</td><td><strong>5.54</strong>/12.20</td><td><strong>0.31</strong>/0.34</td></tr><tr><td rowspan="3">Horse</td><td>10</td><td><strong>0.99</strong>/0.95</td><td><strong>0.19</strong>/0.21</td><td><strong>3.98</strong>/5.67</td><td><strong>0.14</strong>/0.15</td></tr><tr><td>30</td><td><strong>0.96</strong>/0.50</td><td><strong>0.33</strong>/0.54</td><td><strong>4.16</strong>/9.97</td><td><strong>0.16</strong>/0.23</td></tr><tr><td>50</td><td><strong>0.92</strong>/0.35</td><td><strong>0.68</strong>/0.80</td><td><strong>8.87</strong>/12.95</td><td><strong>0.24</strong>/0.28</td></tr></tbody></table>

For quantization attack, 9 bits, 8 bits, and 7 bits are the parameters used in the comparison, respectively. It can be seen from Table 19 that the proposed method is able to withstand quantization attack for Venus and Horse 3D meshes. In addition, Table 19 shows high robustness and imperceptibility performances compared to Wang et al.'s [3] scheme. Moreover, the robustness comparison with Son et al.'s method sketched in Table 9 demonstrates the superiority of the proposed method.

For comparison purposes, Venus and Horse models have undergone Laplacian smoothing using $\lambda$ = 0.10 with 10, 30, and 50 iterations. The robustness and imperceptibility performances were evaluated using NC, MRMS, HD, and MSDM. In Table 20, it can be observed that the proposed technique exhibits superiority over Wang's method in terms of robustness. Moreover, the quality performance illustrates the superiority of the proposed method in terms of MRMS, HD, and MSDM. Table 21 presents the robustness comparison with Cho's method [14] in terms of NC for the Bunny object. According to Table 21, it can be seen that our method shows good robustness against noise, quantization, smoothing, and simplification. Moreover, the proposed method outperforms Cho et al.'s method in terms of the mentioned attacks. It can be seen in Table 22 that the proposed method outperforms Nakazawa et al.'s method in a wide range of attacks including noise addition, quantization, smoothing, and simplification.

In sum, the majority of the previous proposed 3D watermarking schemes based on saliency give good performance in terms of imperceptibility due to the use of this perceptual characteristic. However, they generally show weakness in several attacks since they used a spatial domain to
embed the watermark. The novelty of the proposed method is that it gives good results for both imperceptibility and robustness thanks to the exploitation of the advantages of QIM quantification of wavelets and mesh saliency.

<table><caption>**Table 21.** Results of robustness comparison with Cho et al.'s [14] method measured in terms of NC for the Bunny model.</caption><thead><tr><th>Attack</th><th>Parameters</th><th>[14]</th><th>Our Method</th></tr></thead><tbody><tr><td rowspan="3">Noise</td><td>0.1%</td><td>0.87</td><td>0.99</td></tr><tr><td>0.3%</td><td>0.51</td><td>0.90</td></tr><tr><td>0.5%</td><td>0.18</td><td>0.84</td></tr><tr><td rowspan="3">Quantization</td><td>9-bit</td><td>0.94</td><td>0.99</td></tr><tr><td>8-bit</td><td>0.88</td><td>0.95</td></tr><tr><td>7-bit</td><td>0.39</td><td>0.89</td></tr><tr><td rowspan="3">Smoothing</td><td>(10, 0.03)</td><td>0.75</td><td>0.92</td></tr><tr><td>(30, 0.03)</td><td>0.57</td><td>0.88</td></tr><tr><td>(50, 0.03)</td><td>0.46</td><td>0.71</td></tr><tr><td rowspan="4">Simplification</td><td>32.11%</td><td>0.94</td><td>0.98</td></tr><tr><td>51.44%</td><td>0.77</td><td>0.85</td></tr><tr><td>70.79%</td><td>0.58</td><td>0.71</td></tr><tr><td>90.65%</td><td>0.38</td><td>0.46</td></tr></tbody></table>

<table><caption>**Table 22.** Results of robustness comparison with Nakazawa et al.'s [10] method measured in terms of NC for the Bunny model.</caption><thead><tr><th>Attack</th><th>Parameters</th><th>[10]</th><th>Our Method</th></tr></thead><tbody><tr><td rowspan="3">Noise</td><td>0.1%</td><td>0.75</td><td>0.99</td></tr><tr><td>0.3%</td><td>0.5148</td><td>0.90</td></tr><tr><td>0.5%</td><td>0.111</td><td>0.84</td></tr><tr><td rowspan="3">Quantization</td><td>9-bit</td><td>0.77</td><td>0.99</td></tr><tr><td>8-bit</td><td>0.61</td><td>0.95</td></tr><tr><td>7-bit</td><td>0.32</td><td>0.89</td></tr><tr><td rowspan="3">Smoothing</td><td>(10, 0.03)</td><td>0.73</td><td>0.92</td></tr><tr><td>(30, 0.03)</td><td>0.55</td><td>0.88</td></tr><tr><td>(50, 0.03)</td><td>0.39</td><td>0.71</td></tr><tr><td rowspan="4">Simplification</td><td>32.11%</td><td>0.80</td><td>0.98</td></tr><tr><td>51.44%</td><td>0.61</td><td>0.85</td></tr><tr><td>70.79%</td><td>0.33</td><td>0.71</td></tr><tr><td>90.65%</td><td>0.17</td><td>0.46</td></tr></tbody></table>

## 6. Conclusions

In this paper, a blind robust 3D mesh watermarking method based on visual saliency and wavelet coefficient vectors for copyright protection is proposed. The proposed method takes the full advantage of jointing mesh saliency and QIM quantization of wavelet coefficients to ensure both high imperceptibility and robustness. The robustness requirement is achieved by quantifying the wavelet coefficients using the QIM scheme, while the imperceptibility performance is ensured by adjusting the embedding process according to the visual saliency. The experimental results demonstrate that the proposed scheme yields a good tradeoff between the imperceptibility and robustness requirements. Moreover, experimental simulations show that the proposed method outperforms the existing methods against the majority of the attacks. Future work will focus on improving the robustness against severe attacks such as cropping and remeshing using the weights of the saliency mesh in order to embed more data.
**Author Contributions:** Conceptualization, A.C.; Methodology, H.C.; Software, M.H.; Supervision, M.E.H. (Mohamed El Haziti), M.E.H. (Mohammed El Hassouni) and H.C.; Writing—original draft, M.H.; Validation, A.C.

**Funding:** This research received no external funding.

**Conflicts of Interest:** The authors declare no conflict of interest.

## References

1. Praun, E.; Hoppe, H.; Finkelstein, A. Robust mesh watermarking. In Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA, 8–13 August 1999; ACM Press/Addison-Wesley Publishing Co.: New York, NY, USA, 1999; pp. 49–56.

2. Wang, K.; Lavoué, G.; Denis, F.; Baskurt, A. Three-dimensional meshes watermarking: Review and attack-centric investigation. In *International Workshop on Information Hiding*; Springer: Berlin/Heidelberg, Germany, 2007; pp. 50–64.

3. Wang, K.; Lavoué, G.; Denis, F.; Baskurt, A. Hierarchical watermarking of semiregular meshes based on wavelet transform. *IEEE Trans. Inf. Forensics Secur.* **2008**, *3*, 620–634. [CrossRef]

4. Hou, J.U.; Kim, D.G.; Lee, H.K. Blind 3D Mesh Watermarking for 3D Printed Model by Analyzing Layering Artifact. *IEEE Trans. Inf. Forensics Secur.* **2017**, *12*, 2712–2725. [CrossRef]

5. Bors, A.G. Watermarking mesh-based representations of 3D objects using local moments. *IEEE Trans. Image Process.* **2006**, *15*, 687–701. [CrossRef] [PubMed]

6. Valette, S.; Prost, P. Wavelet-based multiresolution analysis of irregular surface meshes. *IEEE Trans. Vis. Comput. Graph.* **2004**, *10*, 113–122. [CrossRef] [PubMed]

7. Lounsbery, M.; DeRose, T.D.; Warren, J. Multiresolution analysis for surfaces of arbitrary topological type. *ACM Trans. Graph.* **1997**, *16*, 34–73. [CrossRef]

8. Kim, M.S.; Valette, S.; Jung, H.Y.; Prost, R. Watermarking of 3D irregular meshes based on wavelet multiresolution analysis. In *International Workshop on Digital Watermarking*; Springer: Berlin/Heidelberg, Germany, 2005; pp. 313–324.

9. Hamidi, M.; El Haziti, M.; Cherifi, H.; Aboutajdine, D. A robust blind 3-D mesh watermarking based on wavelet transform for copyright protection. In Proceedings of the 2017 IEEE International Conference on Advanced Technologies for Signal and Image Processing (ATSIP’2017), Fez, Morocco, 22–24 May 2017.

10. Nakazawa, S.; Kasahara, S.; Takahashi, S. A visually enhanced approach to watermarking 3D models. In Proceedings of the 2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP), Darmstadt, Germany, 15–17 October 2010; pp. 110–113.

11. Son, J.; Kim, D.; Choi, H.Y.; Jang, H.U.; Choi, S. Perceptual 3D Watermarking Using Mesh Saliency. In *Proceedings of the 2017 International Conference on Information Science and Applications, Macau, China*, 20–23 March 2017; Springer: Singapore, 2017; pp. 315–322.

12. Medimegh, N.; Samir, B.; Mohamed, A.; Naoufel, W. 3D mesh watermarking using salient points. In *Multimedia Tools and Applications*; Springer: New York, NY, USA, 2018; pp. 1–23.

13. Lee, C.H.; Varshney, A.; Jacobs, D.W. Mesh saliency. *ACM Trans. Graph.* **2005**, *24*, 659–666. [CrossRef]

14. Cho, J.-W.; Prost, R.; Jung, H.-Y. An oblivious watermarking for 3D polygonal meshes using distribution of vertex norms. *IEEE Trans. Signal Process.* **2007**, *55*, 142–155. [CrossRef]

15. Taubin, G. Estimating the tensor of curvature of a surface from a polyhedral approximation. In Proceedings of the ICCV 1995, Cambridge, MA, USA, 20–23 June 1995; p. 902.

16. Vasic, B.; Vasic, B. Simplification resilient LDPC-coded sparse-QIM watermarking for 3D-meshes. *IEEE Trans. Multimed.* **2013**, *15*, 1532–1542. [CrossRef]

17. Dodgson, N.; Floater, M.S.; Sabin, M. (Eds.) *Advances in Multiresolution for Geometric Modelling*; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2006.

18. Kanai, S.; Date, H.; Kishinami, T. Digital watermarking for 3D polygons using multiresolution wavelet decomposition. In Proceedings of the Sixth IFIP WG, Helsinki, Finland, 10–13 December 1998; Volume 5, pp. 296–307.

19. Wang, K.; Luo, M.; Bors, A.G.; Denis, F. Blind and robust mesh watermarking using manifold harmonics. In Proceedings of the 2009 16th IEEE International Conference on Image Processing (ICIP), Cairo, Egypt, 7–10 November 2009; pp. 3657–3660.
20. Lavoué, G. A local roughness measure for 3D meshes and its application to visual masking. *ACM Trans. Appl. Percept.* **2009**, *5*, 21. [CrossRef]

21. Lavoué, G.; Gelasca, E.D.; Dupont, F.; Baskurt, A.; Ebrahimi, T. Perceptually driven 3D distance metrics with application to watermarking. In *Applications of Digital Image Processing XXIX*; International Society for Optics and Photonics: Bellingham, WA, USA, August 2006; Volume 6312, p. 63120L.

22. Cignoni, P.; Rocchini, C.; Scopigno, R. Metro: Measuring error on simplified surfaces. In *Computer Graphics Forum*; Wiley Online Library: Hoboken, NJ, USA, 1998; Volume 17, pp. 167–174.

23. Wang, K.; Lavoué, G.; Denis, F.; Baskurt, A.; He, X. A benchmark for 3d mesh watermarking. In Proceedings of the 2010 Shape Modeling International Conference (SMI), Aix-en-Provence, France, 21–23 June 2010; pp. 231–235.

24. Rolland-Neviere, X.; Doërr, G.; Alliez, P. Triangle surface mesh watermarking based on a constrained optimization framework. *IEEE Trans. Inf. Forensics Secur.* **2014**, *9*, 1491–1501. [CrossRef]

<figure><img src="image_16.png" /></figure>

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).