一种双门限分簇协作频谱智能感知算法

基于门限值的能量检测是一种常用频谱感知技术,传统单门限能量检测方法不灵活且不准确.本文提出了一种基于双门限分簇自适应协作频谱感知算法.首先,基于噪声不确定性设置双门限值,在双门限值范围外进行硬判决,否则进行软判决.根据判决结果,基站将传感器节点划分为不同的簇.融合中心根据融合规则,设置分簇门限值,进行进一步频谱检测.仿...     

基于沃尔什-哈达玛变换和卷积编码的半脆弱水印算法

提出了一种基于沃尔什-哈达玛变换和卷积编码的半脆弱水印算法.在该算法中,对嵌入水印之前的图像进行像素块差分编码和卷积纠错编码来得到水印,并将其嵌入在沃尔什-哈达玛变换的图像能量值上;水印检测端通过检测卷积译码中产生的误码实现水印篡改定位,利用卷积译码的结果实现篡改图像的恢复.通过理论和实验分析了该算法的有效性和由此产生的误差.实验结果表明,本算法对于有损压缩具有良好的顽健性,可以精确地检测与定位篡改的图像区域,并且可以大致恢复原始图像内容.     

数字水印技术和JPEG2000编码过程的统一

本文提出了一种将数字水印技术和JPEG2000压缩编码实现过程相统一的方法。JPEG2000是新一代静止图像压缩编码标准,它是在EBCOT(优化截断嵌入式块编码)算法的基础上形成的。本文结合JPEG2000格式压缩码流的形成过程,以位平面为处理平台嵌入水印,根据需要在图像解码端检测水印,实现水印技术和编码算法的统一。与传统方法相比,该方法节省了将嵌入水印的图像进行二次压缩的运算成本,提高了检测水印的效率:充分利用了JPEG2000编码的优越性,在图像进行渐进的有损传输或在较高的压缩比时仍能有效地检测到水印,具有较高的鲁棒性。     

基于ICA的数字图像盲水印

提出了一种鲁棒的基于ICA的数字图像盲水印新方法.该方法用ICA来计算嵌入水印的变换系数,这些变换系数是统计独立的.提出一种用简单匹配滤波器就能检测出来的正交变换盲水印,并讨论了该水印的视觉掩蔽效应和检测概率估计.最后,通过一些实验验证了该算法对于普通攻击具有鲁棒性,并在性能上将之与其他变换域的水印算法做了比较.     

结合视频压缩编码的动态图像水印方案

本文提出了一种新的、结合视频压缩编码的动态图像水印方案。在嵌入水印时，充分考虑动态图像压缩编码的特性，对帧内编码帧(I帧)，将水印信息嵌入到DCT低额系数中；面对帧间编码帧(P、B帧)，结合动态补偿/离散余弦变换(MC/DCT)混合编码，把水印信息嵌入到运动补偿后的残差图象的直流成分中。同时，在水印嵌入时，采用扩频技术与多维水印相结合的方法，并通过相关检测的方法判断水印的存在。由于水印的检测是对视频码流直接实施的，不需要对压缩数据进行完全解码，从而大大降低了计算量，提高了视频数据水印的适用性。     

一种基于程序执行时间量化分析的软件水印方法

当前,应用软件面临的重要问题是不法分子通过软件剽窃、重打包等技术,将恶意负载或广告加载到合法应用软件中,并形成新软件进行发布,给用户和应用软件作者的合法权益带来威胁。为了实现对应用软件剽窃、重打包等安全风险的测评,该文提出一种基于程序执行时间量化分析的软件水印方法(SW_PET)。通过生成多种相互抵消功能的操作组,实现对水印信息的时间化编码,并植入应用软件中;在检测过程中,需要提取相应的水印信息,对照之前的时间编码对应的原始水印,比较不同操作的执行时间,判断水印相似度,进而判别原始水印的存在性,完成应用软件合法性的判断。该方法也可以与其它类型的水印信息相结合,增强水印的鲁棒性。最后,通过搭建仿真模拟器,实现对不同应用软件水印信息的比较和判断,验证该方法的有效性。     

基于纠错编码的彩色图像双水印算法研究

提出一种基于纠错编码的彩色图像双水印算法,用于版权保护和图像篡改定位与恢复。算法在图像的红色分量的频域中嵌入鲁棒水印,在绿色分量的空域中嵌入认证水印。其中,认证水印为从三个颜色分量的DCT系数中提取的二进制编码序列。为提高认证水印的安全性和定位能力．对认证水印进行纠错编码,并利用M序列对认证水印进行加密。仿真实验表明,认证水印能够检测篡改并进行恢复,版权保护水印具有较好的鲁棒性。     

基于小波域的一种新颖的数字水印算法

数字水印技术中,分形编码的数字水印算法具有十分重要的实际意义。通过对灰度图像数字水印系统的研究,提出了一种新颖的基于小波变换的分形编码数字水印算法。这种算法的优点是水印能够很好地保证水印的鲁棒性,对灰度图像的数字水印投入应用具有重要意义;基于分形编码的水印嵌入,即使在图像受到较大幅度改动的情况下,仍然能够较好地实现水印的检测。     

一种基于HVS和EZW的水印算法

对Inoue提出的基于零树小波编码的水印算法进行了改进,提出了基于人眼视觉特性和零树小波编码的二值图像水印算法。该算法对图像和图像块进行分类,设置不同的视觉权值,并根据重要小波系数和纹理掩蔽函数嵌入水印。在C Builder6.0中对水印算法进行了测试。实验结果表明该算法具有较强的鲁棒性,当加入水印后的图像经过常规的信号处理后,该算法仍能够检测到水印的存在。并且该算法有较强的抵抗JPEG压缩攻击能力,对噪声、滤波等图像处理操作也取得了良好的鲁棒性。     

基于LDPC码的数字音频水印算法研究

论文提出了一种基于低密度奇偶校验(LDPC)码的音频水印算法,对水印进行编码预处理后,采用时域去直流的方法并动态改变水印幅度嵌入水印,其中利用了人耳听觉系统的感知特性,把水印加在人耳感知极限下方。通过仿真实验结果表明,该算法具有较强的鲁棒性和不可感知性,而且在水印检测时不需要原始音频信号。     

Watermark detection based on the properties of error control codes

Watermark detection is a topic which is seldom addressed in the watermarking literature. Most authors concentrate on developing novel watermarking algorithms. In a practical watermarking system, however, one must be able to distinguish between watermarked and unwatermarked documents. Many existing systems belong to the class of so called 'yes/no' watermarks, where the detector correlates the candidate image with some known sequence to determine whether a mark is present. Unfortunately, these watermarks often carry no extra information and are not very useful. On the other hand, multi-bit watermarking schemes typically use a separate reference watermark and the payload of the watermark is decoded only when this reference watermark is successfully detected in the received image. It is shown that it is not necessary to use a reference watermark for detection purposes if the watermark payload is encoded with an error control code. One can then put all the energy into the payload watermark and increase its robustness. The turbo code is used as an example of error control codes in the work presented, and simulation results using an algorithm based on the authors' previous work verifies their theory.     

基于声学心理模型的固定门限音频水印方法

提出了一种基于声学心理模型和小波包变换的的音频水印算法,适用于立体声音频信号和单声道音频信号。对于立体声音频信号,在左右声道加入不同的水印信号;对于单声道音频信号,在奇偶帧加入不同的水印信号。左声道水印通过源信号包络与一个只有版权拥有者持有的随机序列加权生成水印信号,并且通过对得出信号进行小波包和声学心理模型分析控制水印信号的强度;右声道水印信号为幅度限制在可听门限的白噪声,用来控制检测门限。得到的水印信号在时域嵌入,水印的检测无需原文件。该方法能够将检测门限控制在事先设定的范围内,具有较好的隐秘性;嵌入的水印信号能够抵抗时域的切割、加噪攻击和一般的音频变换算法。     

Blind MPEG-2 video watermarking in DCT domain robust against scaling

Watermarking techniques that need no original information during watermark detection, known as blind watermarking, are more desirable than informed ones for practical usage and convenience in watermark extraction. A blind MPEG-2 watermarking technique operating in the DCT (discrete cosine transform) domain is presented, which is generally robust against arbitrary ratio scaling, provided that turbo codes are used for error correction. The method can be directly applied to other block-DCT-based video compression techniques. The main advantage of the scheme is its simplicity, blindness and the ability to tailor the watermark payload in a trade-off with other watermark requirements. As synchronisation is automatically obtained from the frames in the scaled video itself, a connection between the source and the target video is not necessary for watermarking detection     

基于奇偶校验的块误差分散半调水印算法

提出了一种顽健的半调水印算法。算法通过比较像素块的均值和一个图像自相关阈值的大小确定像素块的奇偶性,利用噪声平衡块误差分散方法调整像素块的奇偶性实现水印嵌入。通过像素块的奇偶性和投票策略来实现水印的盲提取。实验结果表明,与同类算法相比,提出算法能够获得较高且灵活的水印率,并能从被攻击的嵌水印图像直接提取水印,无需将其先转化成半调图,同时能够很好地抵抗各种常见攻击以及不同型号设备的打印—扫描攻击。     

Morphological watermarking

A novel method for watermark casting using mathematical morphology is presented. Ternary (three-value) signals, as suitable morphological patterns, are applied for digital image watermarking. The watermark is embedded in the spatial domain. The effectiveness of this approach as a benchmark is tested. It is proved that with proper selection of the proposed watermark, the probability of error in the detection will tend to be zero. The proposed method is very easily applied and very fast from the computational standpoint.     

Perceptual watermarking using a new Just-Noticeable-Difference model

In this paper, a new watermarking scheme based on Human Visual System (HVS) modeling is proposed. The approach consists in building computational models which take into account the most common properties of the HVS that can be exploited for watermarking. Two schemes for embedding and controlling the transparency of the watermark are presented, namely the implicit and the explicit schemes. Both schemes are designed in the framework of the pyramidal decomposition which has been shown to be a powerful tool for analyzing image through a multi-scale representation. For the first approach, a multi-scale visibility map is used to optimize the watermark embedding process. The second approach makes use of HVS properties in an explicit and more sophisticated manner that consists in tuning the watermark strength just beneath the visual detection threshold. A new JND (Just-Noticeable-Difference) model for determining this threshold is then proposed and evaluated. The obtained results provide a strong support for this new JND model.     

Performance analysis of coded M-ary orthogonal signaling usingerrors-and-erasures decoding over frequency-selective fading channels

The performance of M-ary orthogonal signaling schemes employing Reed-Solomon (RS) codes and redundant residue number system (RRNS) codes is investigated over frequency-selective Rayleigh fading channels. “Errors-and-erasures” decoding is considered, where erasures are judged based on two low-complexity, low-delay erasure insertion schemes-Viterbi's ratio threshold test (RTT) and the proposed output threshold test (OTT). The probability density functions (PDF) of the ratio associated with the RTT and that of the demodulation output in the OTT conditioned on both the correct detection and erroneous detection of M-ary signals are derived, and the characteristics of the RTT and OTT are investigated. Furthermore, expressions are derived for computing the codeword decoding error probability of RS codes or RRNS codes based on the above PDFs, The OTT technique is compared to Viterbi's RTT, and both of these are compared to receivers using “error-correction only” decoding over frequency-selective Rayleigh-fading channels. The numerical results show that by using “errors-and-erasures” decoding, RS or RRNS codes of a given code rate can achieve higher coding gain than that without erasure information, and that the OTT technique outperforms the RTT, provided that both schemes are operated at the optimum decision thresholds     

基于基矩阵排列优化算法的非规则准循环低密度奇偶校验码构造

为了提升非规则准循环低密度奇偶校验(QC-LDPC)码的误码率性能、降低构造算法的复杂度,该文提出一种基于基矩阵排列优化算法的非规则QC-LDPC码构造方法。首先,利用基于外部信息传递(EXIT)图的阈值分析算法得到满足码率和列重要求的非规则QC-LDPC码的最优度分布,然后将围长和短环数量作为新的约束条件对具有最优度分布的码集进行分析,得到具有最优度分布和最少短环数量的最优基矩阵排列结构,最后,根据得到的基矩阵对规则指数矩阵进行置零操作得到目标非规则QC-LDPC码。该构造方法相对于随机构造方法具有更低的实现复杂度,同时可以通过改变算法的参数值实现码长和码率的灵活设计。仿真结果表明,与现有的一些构造方法相比,所提方法构造的非规则QC-LDPC码在加性高斯白噪声(AWGN)信道上具有更好的误码率性能。     

数字视频广播中的压缩域水印算法

本文对数字视频广播中的水印技术进行了研究,提出了一种MPEG2码流域的视频水印算法,考虑人眼视觉特性,通过对特定位置DCT系数进行修改,以实现水印的嵌入.并且根据视频帧的不同特性,实现了检测阈值的动态选取.本文的方法,计算复杂度低,易于实现,并具有较高的鲁棒性,能够应用于拷贝控制,用户追踪等场合.