矢量地图水印归一化相关检测的可行性分析与改进

为了使矢量地图水印检测算法具有鲁棒性和运算简单，首先分析了矢量地图归一化相关检测算法的可行性：鉴于矢量地图图形的可嵌入水印长度较短，而且其DFT系数的幅度不能较好地满足高斯分布等原因，对不同图形的水印，采用归一化相关检测方法无法确定检测阈值，因此是不可行的，同时还分析了图形简化对水印检测的影响。为使水印算法抗简化，对几何失真鲁棒及减小运算量，提出了以图形的特征点的DFT系数幅度和相位作为水印嵌人域的方法，并提出了一种以提取水印与原始水印的相关系数作为检测值的实用的检测算法。实验结果表明，该算法是鲁棒的和可行的。     

基于离散分数傅里叶变换的SVG数字水印技术

提出了一种基于离散分数傅里叶变换(DFRFT)的SVG图形水印算法,用于SVG的版权保护.将水印嵌入到SVG图形控制点坐标构造的复数信号的离散分数傅里叶变换频谱中.经实验结果验证,该算法具有较强的透明性,对于通常的图形几何变换以及局部修改攻击,均有令人满意的鲁棒性.     

二维工程图中基于分数傅里叶变换的盲水印算法

提出了一种基于二维工程图的水印算法。该方法提取二维工程图中线段的相对坐标向量,构造一维复数信号。通过分数傅里叶变换得到复数信号的变换系数,根据水印的大小和分数傅里叶变换系数的之间的关系,对变换系数的幅值进行调整来嵌入水印。该方法是盲水印算法,在提取水印时不需要原始工程图。实验表明,该算法对平移、旋转、缩放等攻击具有良好的鲁棒性,同时具有良好的安全性。     

傅立叶描述子识别物体的形状

傅立叶描述子是分析和识别物体形状的重要方法之一，利用基于曲线多边形近似的连续傅立叶变换方法计算傅立叶描述子，并通过形状的主方向消除边界起始点相位影响的方法，定义了新的具有旋转，平移和尺度不变性的归一化傅立叶描述子，与使用离散傅立叶变换和模归一化的传统傅立叶描述了相比，新的归一化傅立叶描述于同时保留了模与相位特性，因此能够更好地识别物体的形状，实验表明这种新的归一化傅立叶描述子比传统的傅立叶描述子能够更加高效，准确地识别物体的形状。     

基于分数傅里叶变换的二维工程图水印算法

提出一种基于离散分数傅里叶变换（DFRFT）的二维工程图数字水印算法。该算法分块提取工程图中线段的相对坐标线构造复值信号量,将水印嵌入复值信号量的分数傅里叶变换频谱（FRT）中。实验表明,该算法对平移、旋转、缩放、部分实体删除或添加等攻击具有良好的鲁棒性,同时具有良好的安全性。     

一种鲁棒性的2D矢量图形水印算法

为了解决空间信息网络传输和空间信息共享的版权保护问题,提出了一种具有鲁棒性的2D矢量图形的水印算法。在GIS中,矢量图形是其最基本的表达方式,常需针对2D矢量图形的大数据集进行水印嵌入处理,本方法先将空间矢量图层按照自身所含的多边形特征进行分解;对分解后的矢量多边形进行分析,选择合适的多边形的线段,在其顶点处嵌入水印;而提取水印的过程,则是对原矢量图形和水印图形进行分析,根据嵌入水印顶点的位置或坐标值得到水印信息的序列。实验结果证明,该方法对于空间信息的常规图形操作,如矢量图层的坐标变换、平移、旋转、缩放,以及图形的剪切,点的添加删除等,均具有较强的鲁棒性。     

Digital watermarking of polygonal meshes with linear operators of scale functions

Digital watermarking is already used to establish the copyright of graphics, audio and text, and is now increasingly important for the protection of geometric data as well. Watermarking polygonal models in the spectral domain gives protection against similarity transformation, mesh smoothing, and additive random noise attacks. However, drawbacks exist in analyzing the eigenspace of Laplacian matrices. In this paper we generalize an existing spectral decomposition and propose a new spatial watermarking technique based on this generalization. While inserting the watermark, we avoid the cost of finding the eigenvalues and eigenvectors of a Laplacian matrix in spectral decomposition; instead we use linear operators derived from scaling functions that are generated from Chebyshev polynomials. Experimental results show how the cost of inserting and detecting watermarks can be traded off against robustness under attacks like additive random noise and affine transformation.     

矢量图形脆弱水印研究与实现*

分析了矢量图形内容完整性认证的常用方法及矢量图形数字水印研究现状。针对线状实体组成的矢量图形,提出将矢量图形中线状实体分成不同的组,以组为计算单位将水印信息嵌入在矢量图形数据中,不仅能验证矢量图形的完整性,还能将窜改的定位能力精确到组,嵌入了水印信息的矢量图形仍有使用价值;在对数据精度要求极高的情况下,可以通过数据完整性验证提取出原始矢量图形数据,更好地满足一些特殊应用的需求。     

基于复数小波域的图形水印方法

提出了一种基于复数小波域的2维矢量图形的水印算法，用于2维矢量图形的版权保护。该算法利用了Dual Tree复数小波变换的优点，将水印嵌人相对坐标线(relative coordinates line)的复数小波域中。经初步实验结果验证，该算法对于通常的图形几何变换，如平移、旋转、缩放以及局部修改攻击，均有令人满意的鲁棒性。     

基于B-spline矢量图形数字水印方法

提出了一种针对矢量图形的数字水印算法,用于矢量图形的版权保护。算法利用了B-spline良好的持续逼近曲线形状的特点,将水印嵌入到B-spline的控制点坐标中。经实验证明,该算法对于通常的图形几何变换,如平移、旋转、缩放以及局部修改攻击,均有令人满意的鲁棒性。     

A New Digital Image Watermarking Algorithm Resilient to Desynchronization Attacks

Synchronization is crucial to design a robust image watermarking scheme. In this paper, a novel feature-based image watermarking scheme against desynchronization attacks is proposed. The robust feature points, which can survive various signal-processing and affine transformation, are extracted by using the Harris-Laplace detector. A local characteristic region (LCR) construction method based on the scale-space representation of an image is considered for watermarking. At each LCR, the digital watermark is repeatedly embedded by modulating the magnitudes of discrete Fourier transform coefficients. In watermark detection, the digital watermark can be recovered by maximum membership criterion. Simulation results show that the proposed scheme is invisible and robust against common signal processing, such as median filtering, sharpening, noise adding, JPEG compression, etc., and desynchronization attacks, such as rotation, scaling, translation, row or column removal, cropping, and random bend attack, etc.     

Fragile watermarking for authenticating 3-D polygonal meshes

Designing a powerful fragile watermarking technique for authenticating three-dimensional (3-D) polygonal meshes is a very difficult task. Yeo and Yeung were first to propose a fragile watermarking method to perform authentication of 3-D polygonal meshes. Although their method can authenticate the integrity of 3-D polygonal meshes, it cannot be used for localization of changes. In addition, it is unable to distinguish malicious attacks from incidental data processings. In this paper, we trade off the causality problem in Yeo and Yeung's method for a new fragile watermarking scheme. The proposed scheme can not only achieve localization of malicious modifications in visual inspection, but also is immune to certain incidental data processings (such as quantization of vertex coordinates and vertex reordering). During the process of watermark embedding, a local mesh parameterization approach is employed to perturb the coordinates of invalid vertices while cautiously maintaining the visual appearance of the original model. Since the proposed embedding method is independent of the order of vertices, the hidden watermark is immune to some attacks, such as vertex reordering. In addition, the proposed method can be used to perform region-based tampering detection. The experimental results have shown that the proposed fragile watermarking scheme is indeed powerful.     

Differential Representations for Mesh Processing

Surface representation and processing is one of the key topics in computer graphics and geometric modeling, since it greatly affects the range of possible applications. In this paper we will present recent advances in geometry processing that are related to the Laplacian processing framework and differential representations. This framework is based on linear operators defined on polygonal meshes, and furnishes a variety of processing applications, such as shape approximation and compact representation, mesh editing, watermarking and morphing. The core of the framework is the definition of differential coordinates and new bases for efficient mesh geometry representation, based on the mesh Laplacian operator.     

A reversible watermarking scheme for two-dimensional CAD engineering graphics based on improved difference expansion

Difference expansion is widely used in reversible watermarking for raster images, but it cannot be applied to data with low correlation, due to its large distortion. In this paper, an improvement is made to difference expansion technology to make it suitable for two-dimensional (2D) computer-aided design (CAD) engineering graphics. Based on improved difference expansion (IDE), a reversible watermarking scheme for 2D CAD engineering graphics is proposed. First, all vertices of the 2D CAD engineering graphics are extracted, and then the relative coordinates of these vertices are calculated. Finally, the encrypted watermark is embedded into the scale factor of the relative coordinates by using IDE technology. Experimental results show that the proposed scheme has a large capacity, good imperceptibility, and is robust against operations such as transformation, rotation, and equal scaling.     

3D网格数字水印研究进展

数字水印技术可用于CAD领域中的产品和数据的版权保护,还可以用来提高协同设计中信息的安全性．全面综述了当前国内外3D多边形网格数字水印技术的研究状况,从水印算法的鲁棒性、复杂性和嵌入位置等不同角度概括了典型的3D网格水印算法,并提出其中存在的问题．最后,对该领域未来可能的研究方向和研究重点进行了展望．     

RDWT domain statistical watermark detector using FRHFMs magnitudes and bivariate Cauchy-Rayleigh distribution

Imperceptibility, robustness and data payload, which are complimentary to each other, are widely considered as the three main properties vital for any image watermarking systems. It is a challenging work to design a statistical model-based multiplicative watermarking scheme for achieving the tradeoff among three main properties. In this paper, we propose a novel statistical image watermarking scheme by modeling local redundant discrete wavelet transform (RDWT) and fast Radial harmonic Fourier moments (FRHFMs) magnitudes with bivariate Cauchy-Rayleigh distribution. Our image watermarking scheme consists of two parts, namely, embedding and detection. In the embedding process, RDWT is firstly performed on the host image and RDWT highpass subbands are divided into non-overlapping blocks. Then FRHFMs are computed on RDWT coefficient blocks. And finally, the watermark signal is inserted into robust RDWT-FRHFMs magnitudes through a non-linear multiplicative approach. In the detection process, robust local RDWT-FRHFMs magnitudes are firstly modeled by employing bivariate Cauchy-Rayleigh distribution, which can capture accurately both marginal distributions and strong dependencies of local RDWT-FRHFMs magnitudes. Statistical model parameters are then estimated effectively by the method of logarithmic cumulants (MoLC) approach. And finally, an image watermark detector for multiplicative watermarking is developed using bivariate Cauchy-Rayleigh model and locally most powerful (LMP) test. Also, we utilize the bivariate Cauchy-Rayleigh model to derive the closed-form expressions for the watermark detector. After performance testing and comparison with the experimental results of existing methods, the proposed statistical image watermarking method has achieved relatively ideal results in terms of robustness, imperceptibility and data payload.

     

文本水印向量模型的研究

文章把文本的偶数行的移位值作为向量的分量而构成一个数字文本水印的水印向量,给出了水印向量的嵌入与检测方法,讨论了盗版者对水印向量的伪造攻击,最后解决了如何辨识出伪造攻击的问题。     

Jointly Verifying Ownership of an Image Using Digital Watermarking

The current image watermarking schemes only involve one key, thus can not resolve the problem of joint ownership. This paper proposes two totally new algorithms that make use of a secret sharing scheme in cryptography to address this problem. The first one applies Shamir's (2,2) threshold scheme to the watermarking algorithm. A watermark, which is a gaussian distributed random vector determined by two keys, is embedded to selected coefficients in all middle bands in the wavelet domain of an image, so that only when the two keys are put together can the ownership be verified. The second algorithm is a modification of the first one. Three random watermarks are embedded to middle bands in the wavelet domain of an image. For the watermark detection, two thresholds are set, so the watermark detector can verify partial ownership as well as full ownership. Experimental results show that both algorithms have the desired properties such as invisibility, reliable detection and robustness against a wide range of imaging processing operations.