基于位平面理论和奇异值分解的鲁棒零水印算法

针对灰度图像空域算法中水印鲁棒性较差的问题,提出了一种快速、鲁棒性强的零水印算法,并将该算法用于以数字图像为载体的信息隐藏,以实现水印信息的提取和认证。首先利用位平面(BP)理论将图像解析为不同的位平面层次,构造无权值的位平面矩阵,结合各位平面非零值个数生成图像的特征矩阵;然后对特征矩阵分块操作,利用奇异值分解(SVD)生成块最大奇异值矩阵,并通过对生成矩阵二维混沌加密得到注册零水印信息。仿真实验表明,所提算法具有较强的鲁棒性,在同类算法中对抗椒盐噪声攻击的性能提高了6%,对抗常见混合攻击的性能提高了12%。     

抗几何攻击的空间域图像数字水印算法

当前已有的水印算法多数无法抵抗几何攻击, 而现有抗几何攻击的水印算法大多数只能抵抗一定程度内的几何攻击. 本文提出了一个新的抗几何攻击的图像数字水印算法. 该算法在水印嵌入时, 先对原始图像进行分块, 然后对各个子块图像根据量化策略重复嵌入相应的 1bit 水印信息; 在水印提取时, 先将含水印图像进行分块, 然后对从各个子块图像中提取出的水印信息根据多数原则判定相应子块图像所含的 1bit 水印信息. 该算法简单、快速, 所能嵌入的水印信息量大, 并且在提取水印时无需原始图像. 实验结果表明, 该算法能够有效地抵抗很大程度的几何攻击及其组合攻击, 对常规的图像处理攻击也具有很强的稳健性.     

On robustness against JPEG2000: a performance evaluation of wavelet-based watermarking techniques

With the emergence of new scalable coding standards, such as JPEG2000, multimedia is stored as scalable coded bit streams that may be adapted to cater network, device and usage preferences in multimedia usage chains providing universal multimedia access. These adaptations include quality, resolution, frame rate and region of interest scalability and achieved by discarding least significant parts of the bit stream according to the scalability criteria. Such content adaptations may also affect the content protection data, such as watermarks, hidden in the original content. Many wavelet-based robust watermarking techniques robust to such JPEG2000 compression attacks are proposed in the literature. In this paper, we have categorized and evaluated the robustness of such wavelet-based image watermarking techniques against JPEG2000 compression, in terms of algorithmic choices, wavelet kernel selection, subband selection, or watermark selection using a new modular framework. As most of the algorithms use a different set of parametric combination, this analysis is particularly useful to understand the effect of various parameters on the robustness under a common platform and helpful to design any such new algorithm. The analysis also considers the imperceptibility performance of the watermark embedding, as robustness and imperceptibility are two main watermarking properties, complementary to each other.     

基于SVD的灰度水印单色通道嵌入算法

为了更有效地进行多媒体数据的版权保护,提出了一种在真彩色宿主图像中利用奇异值分解实现的灰度水印嵌入的鲁棒算法。该算法首先利用奇异值的特征来对灰度水印图像进行编码预处理,编码后的水印信息存储为二值数字序列,并选择视觉掩蔽性高的宿主图像区域进行隐藏。为了保证水印的不可察觉性,该水印算法先提取宿主图像RGB彩色空间中的蓝色通道分量,然后选择其中具有高活动因子的图像分块作为水印的嵌入区域。用该算法对灰度水印图像进行处理,不仅实现了水印的盲提取,而且在保证隐藏灰度水印大容量生动信息的同时,对宿主图像的视觉效果影响很小。实验结果表明,该水印算法不仅较传统方法有更高的鲁棒性,而且灰度水印图像的提取结果受常见的图像处理攻击操作的影响非常小。     

用于图像认证的变容量恢复水印算法

兼顾水印嵌入容量和安全性,提出一种水印容量可变的数字图像可恢复水印算法.该算法提取2×2图像块特征生成变容量恢复水印——平滑块6比特,纹理块12比特.图像块的恢复水印基于密钥随机嵌入在其它图像块的低有效位,通过比较图像块特征与相应恢复水印重构的块特征并结合邻域特征判定图像块的真实性,变容量恢复水印用尽可能少的比特数保存足够的图像块信息,仅被嵌入一次且同时用于篡改检测与恢复,不仅有效降低了水印嵌入容量,而且提高了算法抵抗恒均值攻击的能力.实验仿真结果表明,该算法得到的含水印图像和恢复图像的质量好,且能有效抵抗拼贴攻击、恒均值攻击等已知伪造攻击.     

VQ-based watermarking scheme with genetic codebook partition

To enhance the traditional vector quantisation (VQ) system by adding the watermarking ability, a digital image watermarking scheme, which modifies the VQ indices to carry watermark bits, is presented. This scheme partitions the main codebook into two sub-codebooks by referring to the user-key. Then, for each input vector of the cover image, a sub-codebook is selected according to the watermark bit to be embedding. The traditional VQ coding procedure is then done using the sub-codebook for the vector. Furthermore, to improve the performance of the scheme, a genetic codebook partition (GCP) procedure, which employs the genetic algorithm (GA) to find a better way to split the codebook, is proposed. It is demonstrated that the proposed methods provide faster encoding time, better imperceptibility, stronger robustness under some common attacks, and easier implementation than some related VQ-based watermarking schemes proposed in the literature.     

基于Shamir秘密共享方案的数字水印算法

数字水印已成为数字作品版权保护的一种手段,而鲁棒性和不可察觉性是其基本要求.为此,提出了一种基于Shamir秘密共享方案的数字水印算法.该算法首先将图象分成n块,并将水印信息也分成n份,然后通过DCT的相邻系数比较法,将每份水印信息嵌入到图象的相应块中,提取时,只要获得其中的任意t(≤n)份水印信息就可以恢复出原始水印.为提高提取水印图象的精度,给出了基于模糊集的改进算法.实验结果表明,该算法的隐藏效果很好,并且对单一攻击及多种复合攻击具有很好的鲁棒性.     

A robust content based audio watermarking using UDWT and invariant histogram

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 undecimated discrete wavelet transform (UDWT) and invariant histogram, we propose a new content based audio watermarking algorithm with good audible quality and reasonable resistance toward desynchronization attacks in this paper. Firstly, the undecimated discrete wavelet transform (UDWT) is performed on original host audio. Secondly, the invariant histogram is extracted from a selected wavelet coefficients range in the low frequency subband. Then, the bin of histogram is divided into many groups, each group including four consecutive bins. For each group, one watermark bit is embedded by reassigning the number of wavelet coefficients in this group of four bins. Finally, the digital watermark is embedded into the original audio signal in UDWT domain by modifying a small set of wavelet coefficients. Simulation results show that the proposed watermarking scheme is not only inaudible and robust against common signal processing operations such as MP3 compression, noise addition, and low-pass filtering etc, but also robust against the desynchronization attacks such as random cropping, time-scale modification, pitch shifting, and jittering etc.     

An optimized high payload audio watermarking algorithm based on LU-factorization

In the field of audio watermarking, reliably embedding the large number of watermarking bits per second in an audio signal without affecting the audible quality of the host audio with good robustness against signal processing attacks is still one of the most challenging issues. In this paper, a high payload, perceptually transparent and robust audio watermarking solution for such a problem by optimizing the existing problem using genetic algorithm is presented. The genetic algorithm in this paper is used to find the optimal number of audio samples required for hiding each watermarking bit. The embedding is done using the imperceptible properties of LU (lower upper) factorization in wavelet domain. This paper addresses the robustness within perceptual constraints at high payload rate in both mathematical analysis and experimental testing by representing behavior of various attacks using attack characterization. Experimental results show that the proposed audio watermarking algorithm can achieve 1280 bps capacity at an average Signal-to-noise ratio (SNR) of 31.02 dB with good robustness to various signal processing attacks such as noise addition, filtering, and compression. In addition, the proposed watermarking algorithm is blind as it does not require the original signal or watermark during extraction. The comparison of the proposed algorithm with the existing techniques also shows that the proposed algorithm is able to achieve high payload with good robustness under perceptual constraints.     

Authenticating topological integrity of process plant models through digital watermarking

Process plant models, which feature their intrinsical complex topological relation, are important industrial art works in the field of Computer-Aided Design (CAD). This paper investigates the topology authentication problem for process plant models. Compared with the widely studied watermarking based geometrical information protection and authentication techniques for traditional mechanical CAD drawings, topology authentication is still in its infancy and offers very interesting potentials for improvements. A semi-fragile watermarking based algorithm is proposed to address this interesting issue in this paper. We encode the topological relation among joint plant components into the watermark bits based on the hamming code. A subset of the model’s connection points are selected as mark points for watermark embedding. Then those topology sensitive watermark bits are embedded into selected mark points via bit substitution. Theoretical analysis and experimental results demonstrate that our approach yields a strong ability in detecting and locating malicious topology attacks while achieves robustness against various non-malicious attacks.     

A Novel Watermarking Scheme for Secure Relational Databases

ABSTRACT

Digital watermarking for relational databases emerged as a candidate solution to provide copyright protection and tamper detection and to maintain the integrity of data. Sectors such as defense, finance, and human resources require reliable schemes, especially for data alteration and integrity checking. Many watermarking techniques have been proposed in the literature to address the above-mentioned problems subject to their limitations on numeric attributes. However, these techniques do not yield satisfactory results in the case of small numeric values. To overcome these limitations, we have proposed a watermarking scheme in which the third most significant bit of numeric and nonnumeric attributes is replaced with the watermark bit without loss of originality. The proposed scheme must be suitable for the above-mentioned sectors, including commercial banks where fraud and forgery cases are common.     

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.     

A robust rotation resilient video watermarking scheme based on the SIFT

This paper proposes a blind and robust video watermarking algorithm for copyright protection of the video in the wavelet transform. The watermark bit is embedded by modifying two random high frequency coefficients in the first level discrete wavelet transform of the frames of the video. The watermark is encrypted before embedding by using the cat map for better security. During the watermark extraction phase, it is verified whether the video is attacked by rotation attack. Frame restoration against rotation attack is done based on matching at least two feature points each generated by the scale invariant feature transform in the original video frame and the watermarked one. The angle between the two lines formed by joining these feature points is used to restore the video frames to the original position. Experimental results show the imperceptibility and robustness of the proposed method against variety of attacks. It is especially robust against rotation attack in comparison with other popular watermarking methods. Normalized Correlation, Structural Similarity Index and Peak Signal-to-Noise-Ratio are nearly 100%, 1, above 48 dB respectively against the various attacks.     

基于空间转换网络的视频盲水印方法

提出并实现了一种基于空间转换网络(STN)的视频盲水印方法。针对目前视频水印 不能同时抵抗噪声、压缩等信号处理攻击和缩放、剪切等几何攻击的问题,设计一个子块水印 嵌入机制,并依赖 STN 确定水印嵌入子块区域以及空间变换系数。选择变换域中的中频系数作 为嵌入通道,通过空间变换系数矫正旋转和缩放后的图像已获得鲁棒视频水印方法。实验结果 表明,基于 STN 的视频盲水印方法具有较高的视觉隐蔽性以及较强的稳定性和鲁棒性,同时嵌 入水印容量达到 256 位以上。     

A source coding scheme for authenticating audio signal with capability of self-recovery and anti-synchronization counterfeiting attack

Authenticating the veracity and integrity of digital media content is the most important application of fragile watermarking technique. Recently, fragile watermarking schemes for digital audio signals are developed to not only detect the malicious falsification, but also recover the tampered audio content. However, they are fragile against synchronization counterfeiting attack, which greatly narrows the applicability of audio watermarking schemes. In this paper, a novel source coding scheme for authenticating audio signal based on set partitioning in hierarchical trees (SPIHT) encoding and chaotic dynamical system with capability of self-recovery and anti-synchronization counterfeiting attack is proposed. For self-recovery feature, the compressed version of audio signal generated by SPIHT source coding and protected against maliciously tampering by repeated coding is embedded into the original audio signal. Besides, for robustness against synchronization counterfeiting attack feature, based on the position and content of audio section, check bits are generated by Hash algorithm and chaotic sequence, and taken as part of fragile watermark. Simulation results show the self-embedding audio authentication scheme is recoverable with proper audio quality, and it has capability against synchronization counterfeiting attack.

     

On the Need for Signal-Coherent Watermarks

Digital watermarking has been introduced in the 1990s as a complementary technology for copyright protection. In an effort to anticipate hostile behavior of adversaries, the research community is constantly introducing new attacks to benchmark watermarking systems. In this paper, we present a generic attack strategy based on block replacement. As multimedia content is often highly repetitive, the attack exploits signal's self-similarities to replace each signal block with another, perceptually similar one. Guided by the principles of the proposed attack framework, we implemented three attack algorithms for different types of multimedia content: video shots, audio tracks and still images. Finally, considering the effectiveness of the proposed algorithms, we identify the properties that a watermark should have to counter this attacking strategy.     

Robust multi bit and high quality audio watermarking using pseudo-random sequences

A robust multi bit and high quality audio watermarking technique in time domain is proposed in this paper. Watermarking is a technique used to label digital media by hiding copyright or other information into the underlying data. The watermark must be imperceptible and undetectable by the user and should be robust to various types of distortion. To enhance the robustness and taper-resistance of the embedded watermark, in this paper a multi bit technique is employed. Instead of embedding one bit into an audio frame, multiple bits can be embedded into each audio sub-frame. For attackers, since they do not know the parameters, this significantly reduces the possibility of unauthorized bit detection and removal of watermark. In real-time watermarking applications, robustness is not the only factor that plays an important role. The other factor that plays a very an important role is computational complexity. In general, audio file is transmitted in compressed form. Real-time watermark embedding must take into account this compressed form, because first decompressing the data, adding a watermark and then recompressing the data is computationally too demanding. In this paper, we propose robust and low complexity audio watermarking algorithm. To evaluate the performance of the proposed audio watermarking algorithm, subjective and objective quality tests including bit error rate (BER) and signal-to-noise ratio (SNR) were conducted. Compared to traditional one bit embedding algorithm, the proposed algorithm gives highly recovery rate after attack by commonly used audio data manipulations, such as low pass filtering, requantization, resampling, and MP3 compression.     

时空特征分析结合随机密钥的压缩域数字视频水印嵌入和提取方法

针对现有水印嵌入和提取算法对滤波、压缩和噪声条件较为敏感的问题,提出了一种鲁棒的基于时空特征的压缩域数字视频水印嵌入和提取方法。提出的框架由一个公共密钥和一个私有密钥组成,用于阻止自我共谋攻击。算法对视频进行时空分析,并从压缩视频的时空特征中提取公共密钥,在本质上具有鲁棒性。首先,利用一个随机密钥从事先选取的块集合中选取候选块,进而确保水印框架的安全;然后基于压缩视频的时空特征选取出适合嵌入水印的4×4子块;最后,利用非零量化系数嵌入水印位。该水印框架允许视频位速率有限增加,并且降低了计算的开销。实验结果显示,相比其他几种对比方法,提出的方法具有较强的鲁棒性和安全性。     

一种基于m序列的关系数据库鲁棒水印算法

提出一种关系数据库水印算法,适用于数值型数据的版权保护.以连接多项式数组为密钥生成m序列,分别作为水印信号和水印嵌入策略控制信号;根据密钥和元组主键连接值的散列运算确定水印嵌入位置;通过修改数值属性低位数值的奇偶性嵌入水印,克服了常用的最低有效位重置算法易产生病态结果的缺点.水印的嵌入满足数据库动态更新的同步要求,水印的检测无需原始数据库参与.理论分析和实验表明,该算法运算开销合理,具有良好的隐蔽性和安全性,对常见的水印攻击具有良好的鲁棒性.     

基于陷阱策略的音频数字水印新方法

数字水印已经成为实现多媒体版权保护的一项重要技术.提出在嵌入鲁棒性水印的同时考虑攻击的行为特征,辅以陷阱策略抵制各种攻击.水印以量化音频DCT系数的方式嵌入,在提取时针对攻击的行为特征以不同方式提取水印.算法嵌入的水印为一幅二值图像,能抵制随机裁剪、AD及DA转换、低通滤波等去同步型攻击,提取的水印可以直接分辨.与cocktail水印方法相比,所提方法的鲁棒性高,提取水印时不需要原始音频.实验结果说明我们的音频水印方法十分有效.