Efficient spectral watermarking of large meshes with orthogonal basis functions
Efficient spectral watermarking of large meshes with orthogonal basis functions
复制标题
DOI：
10.1007/s00371-005-0311-5
复制
发表时间：
2005-08
期刊：
影响因子：
--
通讯作者：
Jianhua Wu;L. Kobbelt
中科院分区：
文献类型：
--
作者：
Jianhua Wu;L. Kobbelt
考虑到版权保护和所有权声明，数字水印技术已经成功地应用于音频、图像和视频等经典媒体类型，最近已被适应于新出现的多媒体数据类型3D几何模型。特别是，广泛使用的扩频方法可以通过将原始模型变换到频域并扰动最主要基函数的系数来推广到3D数据集。以往使用这种频谱水印的方法主要基于多分辨率网格分析、小波域变换或频谱网格分析。虽然它们已经对许多类型的真实世界攻击表现出很好的抵抗力，但由于其复杂的数值计算，它们往往太慢，无法处理非常大的网格。本文提出了一种新的基于径向基函数正交基函数的频谱水印方案。利用我们提出的快速基函数正交化，在观察到与其他相关方法类似的对各种攻击的持久性的同时，我们的方案的运行速度快了两个数量级，因此可以有效地对非常大的模型进行水印。
Allowing for copyright protection and ownership assertion, digital watermarking techniques, which have been successfully applied to classical media types like audio, images, and video, have recently been adapted for the newly emerged multimedia data type of 3D geometry models. In particular, the widely used spread-spectrum methods can be generalized for 3D datasets by transforming the original model to a frequency domain and perturbing the coefficients of the most dominant basis functions. Previous approaches employing this kind of spectral watermarking are mainly based on multiresolution mesh analysis, wavelet domain transformation, or spectral mesh analysis. Though they already exhibit good resistance to many types of real-world attacks, they are often far too slow to cope with very large meshes due to their complicated numerical computations. In this paper, we present a novel spectral watermarking scheme using new orthogonal basis functions based on radial basis functions. With our proposed fast basis function orthogonalization, while observing a persistence with respect to various attacks that is similar to that of other related approaches, our scheme runs faster by two orders of magnitude and thus can efficiently watermark very large models.