A robust confirmable watermarking algorithm for 3D mesh based on manifold harmonics analysis

Owing to the manifold harmonics analysis, a?robust non-blind spectral watermarking algorithm for a?two-manifold mesh is presented, which can be confirmed by a?trusted third party. Derived from the Laplace–Beltrami operator, a?set of orthogonal manifold harmonics basis functions is first adopted to span the spectral space of the underlying three-dimensional (3D) mesh. The minimal number of the basis functions required in the proposed algorithm is also determined, which can effectively accelerate the spectrum computations. Then, to assert ownership and resist 3D mesh forging, a?digital signature algorithm is adopted to sign the watermark in the embedding phase and to verify the signature in the extraction phase, which could optimize the robust non-blind spectral watermarking algorithm framework. To improve the robustness of the embedded watermark signature, the input 3D mesh will be segmented into patches. The watermark signature bits are embedded into the low-frequency spectral coefficients of all patches repeatedly and extracted with regard to the corresponding variations of their coefficients. Extensive experimental results demonstrate the efficiency, invisibility, and robustness of the proposed algorithm. Compared with existing watermarking algorithms, our algorithm exhibits better visual quality and is more robust to resist various geometric and connectivity attacks.     

VRML animated model watermarking scheme using geometry and interpolator nodes

Distinct from image and video watermarking, a watermarking scheme for 3D animation content is required in the 3D industry market for various applications. This paper develops a watermarking scheme for copyright protection and authentication of 3D animation content. A 3D animated model generally has a hierarchical structure with a number of transform nodes of a geometry node and an interpolator node for the timeline in contrast to a 3D polygon mesh model. The proposed scheme embeds not only a robust watermark into the geometry node for copyright protection but also a fragile watermark into the position and orientation interpolators for content authentication. We named the former “robust geometry watermarking” and the latter “fragile interpolator watermarking”. The proposed scheme performs the two watermarking schemes independently to realize simultaneously robust and fragile watermarked 3D animated model. Experimental results confirm that a watermark embedded by geometry watermarking robust to many attacks from commercial 3D editing tools while a watermark embedded by interpolator watermarking fragile to the same attacks.     

一种基于小波变换的三维网格模型水印算法

提出了一种基于小波变换的强壮三维网格模型数字水印算法。首先采用一种平面参数化算法将三维网格模型映射为二维参数网格，三维网格模型表面的几何信号相应转换为二维信号，然后采用一种自适应小波水印算法加入水印。实验结果显示该水印算法能够抵抗各种几何信号处理攻击。     

基于小波矩的抗几何攻击数字图像水印算法研究

针对旋转、缩放和平移等几何攻击破坏水印检测同步,从而导致水印检测失败等问题,利用归一化图像的缩放、平移不变性及小波矩的旋转不变特性,结合奇偶量化技术,提出了一种有效抵抗几何攻击的数字图像水印新算法。首先利用图像归一化技术将原始载体映射到几何不变空间内;然后计算归一化图像的小波矩,并选取部分稳定的低阶小波矩用于水印嵌入;最后利用奇偶量化方法将水印信息嵌入到所选小波矩的不变量内。仿真实验结果表明,该图像水印方案不仅具有良好的透明性,而且具有较强的抵抗常规信号处理、几何攻击、联合攻击等能力。     

基于DFT的鲁棒三维网格模型数字水印算法

论文提出了一种基于离散傅立叶变换(DFT)的鲁棒三维网格数字水印嵌入算法,该算法首先将模型中心到顶点的长度进行DFT变换,然后通过修改DFT系数的模来嵌入水印。算法以全局特征作为嵌入对象,并且将1位水印信息分布到整个模型之中。实验结果表明该算法能够抵抗网格简化、加噪声、剪切等类型攻击以及它们的混合攻击,具有很好的鲁棒性。     

A robust watermarking scheme for 3D triangular mesh models

Copyright protection of digital media has become an important issue in the creation and distribution of digital content. As a solution to this problem, digital watermarking techniques have been developed for embedding specific information identifying the owner in the host data imperceptibly. Most watermarking methods developed to date mainly focused on digital media such as images, video, audio, and text. Relatively few watermarking methods have been presented for 3D graphical models. In this paper we propose a robust 3D graphical model watermarking scheme for triangle meshes. Our approach embeds watermark information by perturbing the distance between the vertices of the model to the center of the model. More importantly, to make our watermarking scheme robust against various forms of attack while preserving the visual quality of the models our approach distributes information corresponds to a bit of the watermark over the entire model, and the strength of the embedded watermark signal is adaptive with respect to the local geometry of the model. We also introduce a weighting scheme in the watermark extraction process that makes watermark detection more robust against attacks. Experiments show that this watermarking scheme is able to withstand common attacks on 3D models such as mesh simplification, addition of noise, model cropping as well as a combination of these attacks.     

Blind robust watermarking schemes for copyright protection of 3D mesh objects

In this paper, two novel methods suitable for blind 3D mesh object watermarking applications are proposed. The first method is robust against 3D rotation, translation, and uniform scaling. The second one is robust against both geometric and mesh simplification attacks. A pseudorandom watermarking signal is cast in the 3D mesh object by deforming its vertices geometrically, without altering the vertex topology. Prior to watermark embedding and detection, the object is rotated and translated so that its center of mass and its principal component coincide with the origin and the z-axis of the Cartesian coordinate system. This geometrical transformation ensures watermark robustness to translation and rotation. Robustness to uniform scaling is achieved by restricting the vertex deformations to occur only along the r coordinate of the corresponding (r, /spl theta/, /spl phi/) spherical coordinate system. In the first method, a set of vertices that correspond to specific angles /spl theta/ is used for watermark embedding. In the second method, the samples of the watermark sequence are embedded in a set of vertices that correspond to a range of angles in the /spl theta/ domain in order to achieve robustness against mesh simplifications. Experimental results indicate the ability of the proposed method to deal with the aforementioned attacks.     

A pseudo-Zernike moment based audio watermarking scheme robust against desynchronization attacks

Desynchronization attack is known as one of the most difficult attacks to resist, for it can desynchronize the location of the watermark and hence causes incorrect watermark detection. It is a challenging work to design a robust audio watermarking scheme against desynchronization attacks. Based on pseudo-Zernike moment and synchronization code, we propose a new digital audio watermarking algorithm with good auditory quality and reasonable resistance toward desynchronization attacks in this paper. Firstly, the origin digital audio is segmented and then each segment is cut into two parts. Secondly, with the spatial watermarking technique, synchronization code is embedded into the statistics average value of audio samples in the first part. And then, map 1D digital audio signal in the second part into 2D form, and calculate its pseudo-Zernike moments. Finally, the watermark bit is embedded into the average value of modulus of the low-order pseudo-Zernike moments. Meanwhile combining the two adjacent synchronization code searching technology, the algorithm can extract the watermark without the help from the origin digital audio signal. Simulation results show that the proposed watermarking scheme is not only inaudible and robust against common signals processing such as MP3 compression, noise addition, resampling, re-quantization, etc., but also robust against the desynchronization attacks such as random cropping, amplitude variation, pitch shifting, jittering, etc.     

Joint reversible watermarking and progressive compression of 3D meshes

A new reversible 3D mesh watermarking scheme is proposed in conjunction with progressive compression. Progressive 3D mesh compression permits a progressive refinement of the model from a coarse to a fine representation by using different levels of detail (LoDs). A reversible watermark is embedded into all refinement levels such that (1) the refinement levels are copyright protected, and (2) an authorized user is able to reconstruct the original 3D model after watermark extraction, hence reversible. The progressive compression considers a connectivity-driven algorithm to choose the vertices that are to be refined for each LoD. The proposed watermarking algorithm modifies the geometry information of these vertices based on histogram bin shifting technique. An authorized user can extract the watermark in each LoD and recover the original 3D mesh, while an unauthorized user which has access to the decompression algorithm can only reconstruct a distorted version of the 3D model. Experimental results show that the proposed method is robust to several attack scenarios while maintaining a good compression ratio.     

伪Zernike矩归一化的抗几何攻击图像水印

以改进的伪Zernike矩相关知识为基础,提出了一种改进的抗几何攻击的数字水印算法。该算法首先计算载体图像的伪Zernike矩,然后对其进行归一化处理。最后选择部分低阶矩幅值量化嵌入水印。实验结果表明该数字水印算法不仅可以抵抗常规的数字信号处理,而且较基于伪Zernike矩的抗几何攻击的数字水印算法有对旋转和缩放的联合攻击具有较好的抵抗能力。     

基于修改的Zernike矩的抗几何攻击的数字水印方法

利用图像Zernike矩的幅度具有旋转不变的性质,提出了一种抗几何攻击的图像盲水印算法.算法首先对载体图像进行分块,计算子图像的Zernike矩后将其进行正则化,对正则化后的Zernike矩进行筛选,根据水印信息对选中的Zernike矩进行修改,并对差矢量进行Zernike矩重构,通过将重构的图像在空域迭加到原始子图像中实现水印的嵌入.该算法在抽取水印时不需要原始载体图像和原始水印.实验结果表明,该算法能够抵抗旋转、缩放攻击、裁剪攻击、JPEG压缩、噪声、滤波等常规攻击.     

GPU-accelerated blind and robust 3D mesh watermarking by geometry image

The prevalence of cheap and powerful consumer level graphics accelerated hardware introduces a significant growth of 3D applications. In this paper, we have proposed a GPU-accelerated blind and robust watermarking approach to the 3D polygon meshes on the basis of the geometry image transform and image watermarking, which performs watermark embedding and detection on the basis of the geometry image derived from a spherical parametrisation of the input mesh with the help of massive-parallel processing power of the GPUs on the display card. The experimental results show that our approach is successful in at least two aspects. First, the watermark is robust, the embedded watermark survives from common geometric attacks, cropping, simplification, and re-meshing attacks. Second, with the help of parallel computations on the GPUs, the embedding and detection process is extremely fast.     

基于三维网格物体的鲁棒性盲水印方案

提出了一种基于3D网格物体的鲁棒性盲水印方案。先将3D物体模型转换到仿射不变空间，然后把顶点坐标转换到球面坐标，利用球面坐标来嵌入水印。由于在仿射不变空间下，3D物体模型不受平移、旋转和比例变换的影响，故该水印方案对于此类变化具有很强的鲁棒性。试验结果也证明了这一点，且该水印具有良好的不可见性。     

自适应于局部几何特征的三维模型水印算法

文章针对三维模型提出了一种稳健的三角网格数字水印算法,通过修改从模型中心到各顶点的向量长度来嵌入数字水印。该算法具有如下特点:以全局几何特征作为嵌入对象;将一比特的水印信息分布到整个模型之中;水印的嵌入强度自适应于模型的局部特征。实验结果表明该水印算法能抵抗网格简化攻击,噪声攻击,剪切攻击,以及它们的混合攻击,具有很高的稳健性。     

基于几何特征的鲁棒三维网格数字水印算法

文中算法首先将三维网格模型进行仿射变换,以获得模型的旋转不变性、缩放不变性;然后,将空间坐标系原点到模型顶点的距离通过一维DCT变化到频域,在频域信号上加入水印,使得嵌入的水印具有不可见性。实验结果表明：该算法不仅对仿射攻击具有较强的鲁棒性,而且对网格简化、加噪声和剪切攻击以及它们的联合攻击具有较好的鲁棒性。     

基于小波变换的三维网格物体盲水印方案

提出了一种基于小波变换的3D网格物体鲁棒性盲水印方案.首先将3D物体模型转换到仿射不变空间,抽取三维物体重心到顶点的距离生成一个一维的离散信号;将该离散信号进行小波变换,改变其高频系数以嵌入水印,然后经过小波逆变换生成带水印的3D物体模型.在仿射不变空间下,实现了3D物体模型对平移、旋转、比例变换的鲁棒性,采用小波变换使3D模型具有很强的水印不可见性以及一定的噪声鲁棒性.试验结果表明,该方法不仅对于旋转、平移、比例变换具有很强的鲁棒性,而且具有良好的水印不可见性.     

A Frequency-Domain Approach to Watermarking 3D Shapes

This paper presents a robust watermarking algorithm with informed detection for 3D polygonal meshes. The algorithm is based on our previous algorithm [ 22 ] that employs mesh‐spectral analysis to modify mesh shapes in their transformed domain. This paper presents extensions to our previous algorithm so that (1) much larger meshes can be watermarked within a reasonable time, and that (2) the watermark is robust against connectivity alteration (e.g., mesh simplification), and that (3) the watermark is robust against attacks that combine similarity transformation with such other attacks as cropping, mesh simplification, and smoothing. Experiment showed that our new watermarks are resistant against mesh simplification and remeshing combined with resection, similarity transformation, and other operations..     

面向3D网格模型的多重数字水印算法

为了解决单盲水印网格算法难以抵抗多种攻击的问题,提出一种鲁棒的3D网格模型的多重数字水印算法.该算法分别对3D网格模型的顶点信息和拓扑信息嵌入2种不同类型的单鲁棒性水印,从而使模型既能抵抗大面积的剪切攻击,又能抗击一定强度的噪声攻击;且在水印提取时不需要原始模型信息.实验结果表明,该算法能有效地提高水印抗平移、旋转、缩放、非均匀缩放、剪切、噪声和顶点乱序等攻击的能力.     

Hierarchical Watermarking of Semiregular Meshes Based on Wavelet Transform

This paper presents a hierarchical watermarking framework for semiregular meshes. Three blind watermarks are inserted in a semiregular mesh with different purposes: a geometrically robust watermark for copyright protection, a high-capacity watermark for carrying a large amount of auxiliary information, and a fragile watermark for content authentication. The proposed framework is based on wavelet transform of the semiregular mesh. More precisely, the three watermarks are inserted in different appropriate resolution levels obtained by wavelet decomposition of the mesh: the robust watermark is inserted by modifying the norms of the wavelet coefficient vectors associated with the lowest resolution level; the fragile watermark is embedded in the high resolution level obtained just after one wavelet decomposition by modifying the orientations and norms of the wavelet coefficient vectors; the high-capacity watermark is inserted in one or several intermediate levels by considering groups of wavelet coefficient vector norms as watermarking primitives. Experimental results demonstrate the effectiveness of the proposed framework: the robust watermark is able to resist all common geometric attacks even with a relatively strong amplitude; the fragile watermark is robust to content-preserving operations, while being sensitive to other attacks of which it can also provide the precise location; the payload of the high-capacity watermark increases rapidly along with the number of watermarking primitives.      

网格分割的3维网格模型非盲水印算法

目的 信息技术的发展使得面向3维模型版权保护的问题越来越突出,提出一种新的基于网格分割的3维网格模型非盲水印算法。方法 首先使用基于形状直径函数的网格分割算法对3维网格模型进行有意义的网格分割,然后计算每个分块的鲁棒重心并以此为中心将模型由直角坐标系转换到球面坐标系,最后通过调制每个顶点范数的分布来嵌入水印,在水印检测阶段使用非盲检测的方法提取水印。结果 针对目前基于网格分块的水印算法的网格分割不一致以及对分割边界依赖性过强等问题,引入基于形状直径函数的网格分割算法并在重对齐、重采样过程中加入待检测模型与原始模型分块匹配过程以保证网格分割的一致性,并且选取分块的顶点范数的分布作为水印嵌入基元,使得算法能够有效地减弱对分割边界的依赖性。结论 实验结果表明,该算法可以有效抵抗平移、旋转、缩放、噪声、细分、简化、剪切等常见的攻击以及多种攻击的联合攻击。