基于水印序号的抗裁剪音频数字水印算法

提出一种基于水印序号的抗裁剪音频数字水印算法.该算法在音频信号中嵌入同步码、水印序号和二值水印图像,具有如下特点:利用同步技术,能有效对抗音频信号受到的随机裁剪攻击;水印序号的嵌入,能使检测到的水印信息自动定位在图像上.仿真实验表明,该算法在抵抗加性噪声和裁剪攻击等方面达到了较高的鲁棒性.     

基于离散小波变换和人类视觉系统的数字水印算法

通过对人类视觉系统(HVS)的亮度特性、频域特性、图像类型特性的研究,提出一种基于离散小波变换和人类视觉系统数字水印算法,将秘密信息嵌入到小波变换不同的方位系数中.实现了水印信号在图像信息中的嵌入与提取,达到隐藏秘密信息的目的.实践证明该算法能提高水印的不可见性,同时具有很强的鲁棒性.     

基于内容的自适应音频水印研究综述

按照时域、变换域2种常见的水印嵌入域,对音频水印技术进行了概述;针对第2代数字水印技术,重点介绍了基于内容的音频水印算法、自适应音频水印算法以及音频水印的同步技术,对它们的优缺点进行了评析．这些算法更强调将水印信息嵌入到音频信号的重要特征上,并与各音频段的自身特点相结合,具有鲁棒性强、不可听性好和较实用等优点,是新一代水印技术发展的趋势．最后,探讨了目前音频水印领域需要解决的问题及进一步研究的方向,这些问题的解决将对网络化音乐制品的知识产权保护与安全传播提供理论和技术支持．     

抵抗线性共谋攻击的空域自适应视频水印方案

针对视频水印中存在的线性共谋攻击问题,建立了线性共谋攻击的数学模型,并根据建立的数学模型提出了抵抗线性共谋攻击的视频水印设计规则.基于该规则,提出了一种有效抵抗线性共谋攻击的视频水印方案.该方案从视频帧中自适应地选取一些互不重叠的8×8的块(子帧)作为嵌入区域,嵌入强度自适应于相应子帧的方差.实验表明,该算法在经过线性共谋、帧去除、帧插入、帧重组以及MPEG-2压缩等各种攻击后,水印提取的正确率仍可达到100%.     

一种多类多水印方案

通过分析多类多水印的特点，讨论了多类多水印的技术难点，提出一种基于小波系数分块嵌入水印的解决方案，将各类型水印归一化处理，但对每种水印单独制定自适应嵌入技术，实现3种类型7个水印的同时隐藏．仿真实验证明了该方案的有效性．     

奇异值分解算法在数字水印技术中的应用

奇异值分解算法应用于数字水印技术中,把水印信息按位置换,对宿主图像分块并做奇异值分解,在奇异值域做数学变换以重复嵌入按位置换的二值水印信息．实验结果表明,该方法既提高了水印的信息量,同时又使得水印图像具有很强的稳健性,能抵抗旋转和裁剪等多种攻击,水印的保密性与鲁棒性均有显著的提高．     

基于离散小波变换和人类视觉系统的数字水印算法

通过对人类视觉系统（HVS）的亮度特性、频域特性、图像类型特性的研究,提出一种基于离散小波变换和人类视觉系统数字水印算法,将秘密信息嵌入到小波变换不同的方位系数中．实现了水印信号在图像信息中的嵌入与提取,达到隐藏秘密信息的目的．实践证明该算法能提高水印的不可见性,同时具有很强的鲁棒性．     

基于RC4算法的多冗余数字水印技术

提出了一种数字水印技术,它把二进制水印信息按位置换,以RC4加密算法对其进行加密,对原始图像按8×8块进行DCT变换,在低频系数中嵌入加密的多冗余水印信息.实验结果证明,该算法既具有很好的安全性,能抵抗多种攻击,又具有较好的鲁棒性.     

一种基于整数小波变换的彩色图像盲水印技术

提出了一种在静止的彩色图像中嵌入盲水印的鲁棒算法,用彩色图像作为数字水印的载体,将有意义的二值图像作为水印图像,利用人类视觉系统(HVS)特性,综合考虑水印的鲁棒性和不可见性,将水印信息嵌入到小波分解的低频域(LLn),通过理论分析和实验结果证明:算法满足水印的抗JPEG压缩攻击、复杂度较低、实用性较强、对原图的影响较小,具有可行性和有效性等特点。     

一种基于块的彩色图像认证水印方法

内容认证是数字水印的主要用途之一,结合新颖的样本选取方法提出了一种有效的 彩色图像认证水印方法.水印信号为利用混沌序列生成的二值图像,水印的嵌入位置由密钥 和8×8块中的48个像素共同决定,具有非常好的安全性;水印的提取和图像认证不需要原 始图像.实验表明,该方法嵌入的水印不可见性好,对JPEG压缩、图像剪切和图像变换等处理具有很好的易碎性,适合于图像的区域认证和完整性验证.     

Connectivity-Based Watermarking Robust to Geometrical Attacks

Introduction Thegoalofdigitalwatermarkingtechniqueisto embedsomeunnoticeableinformation(calleda mark)inthecontentofmediainordertoprotect copyrightorauthenticateintegralityandverity.Many robustwatermarkingtechniqueshavesuccessfullyre sistednotonlycommonsig…     

DWT-Based Robust Color Image Watermarking Scheme

A scheme of embedding an encrypted watermark into the green component of a color image is proposed. The embedding process is implemented in the discrete wavelet transformation （DWT） domain, The original binary watermark image is firstly encrypted through scrambling technique, and then spread with two orthogonal pseudo-random sequences whose mean values are equal to zero, and finally embedded into the DWT low frequency sub-band of green components, The coefficients whose energies are larger than the others are selected to hide watermark, and the hidden watermark strength is determined by the energy ratio between the selected coefficients energies and the mean energy of the subband. The experiment results demonstrate that the proposed watermarking scheme is very robust against the attacks such as additive noise, low-pass filtering, scaling, cropping image, row （or column ） deleting, and }PEG compression.     

A semi-fragile wavelet transform watermarking scheme for content authentication of images

A novel semi-fragile watermarking scheme for the content authentication of images using wavelet transform (WT) is presented in this paper. It is tolerant to the embedded wavelet image compression methods based on WT such as embedded zerotree wavelet (EZW), set partitioning in hierarchical trees (SPIHT) and embedded block coding with optimized truncation (EBCOT) in JPEG2000 to a pre-determined bit-plane, but is sensitive to all other malicious attacks. The image features are generated from the lowest-frequency (LF) subband of the original image as the embedded watermark. The watermark is embedded into the pre-determined bit-plane by adjusting the corresponding values in the given subband. In the process of watermarking authentication, we compare the image features generated from the LF subband of the received image with the embedded watermarking information (the image features of the original image) extracted from the pre-determined bit-plane in the given subband of the received image to decide whether the image is attacked maliciously or processed acceptably (the embedded wavelet compression). The most important advantage of our watermarking scheme is that the watermark information can be extracted from the watermarked image when detecting watermark, so the received image authentication needs no information about the original image or watermark. Experimental results prove the effectiveness of our proposed watermarking scheme.     

能区分图像内容或水印篡改的自恢复脆弱水印

分析了现有算法的缺陷,提出了一种能有效区分图像内容或水印篡改的自恢复安全脆弱水印算法.该方案利用检测水印实现篡改定位和篡改区分的功能,采用恢复水印恢复被篡改的图像内容.理论分析和实验仿真均表明,所提出的算法具有很好的篡改区分、篡改定位和篡改恢复的能力,能够抵抗同步伪造攻击和密钥分析攻击.     

Novel Blind Robust Watermarking Based on Chaotic Mixing

This paper proposed a novel blind robust watermarking scheme. Multi-bits watermark is embedded in the chaotic mixed image blocks. Energy of the watermark is spread to all region of the blocks instead of some individual pixels, which entitles the watermark with imperceptibility and high robustness. A class of 1-D Markov chaotic maps is employed to perform image block mixing and watermark encryption ensures security of the system.To prove the validity of this proposed scheme, some objective comparisons with the popular spread spectrum scheme were also presented. The simulation results show that this scheme can survive processing such as high-ratio JPEG compression, Gaussian noise pollution and histogram equalization.     

A New Fragile Watermark for Image

Fragile watermarking is a method to verify the integrity and authenticity of multimedia data. A new fragile watermark for image was proposed, which can be used in image verification applications. The paper first described the above two techniques, some of which will be used in the method. Then it described the embedding and authentication process and also analyzed the method to show how it can survive some attacks. The experimental results show that the proposed method doesn‘t need the watermark or original image on authentication side. It provides more security against attack, and can localize where the temoerinlz has occurred.     

Watermarking data cubes

We propose a robust watermarking scheme and several extensions for digital right management of data cubes. The ownership information is hidden into a data cube by modifying a set of selected cell values. Its owner can use his private key to control all the watermarking parameters freely. Neither original data cube nor the watermark is required in watermark detection. Detailed analysis and extensive experiments are conducted for the proposed schemes in terms of watermark detectability, robustness and efficiency. Our results show that the scheme performs well in actual applications.     

Active approach for tamper detection with robustness to lossy compression

Active tamper detection using watermarking technique can localize the tampered area and recover the lost information. In this paper, we propose an approach that the watermark is robust to legitimate lossy compression, fragile to malicious tampering and capable of recovery. We embed the watermark bits in the direct current value of energy concentration transform domain coefficients. Let the original watermark bits be content dependent and apply error correction coding to them before embedded to the image. While indicating the tampered area, the extracted bits from a suspicious image can be further decoded and then used to roughly recover the corresponding area. We also theoretically study the image quality and bit error rate. Experimental results demonstrate the effectiveness of the proposed scheme.