摘要
针对现有数字水印算法中存在的抵抗联合攻击能力差、水印提取准确率不高等问题,提出了一种基于分块快速傅里叶变换(FFT)的二重循环数字水印算法.先进行图像大小归一化,对其进行分块FFT变换,在每个图像块的FFT系数中通过大小关系调制嵌入若干比特水印,水印按照二重循环嵌入.提取时从任何一个包括所有水印的图像部分中,直接通过判断FFT系数的大小关系来提取水印.实验结果表明,该算法能抵抗滤波加噪等常规信号处理攻击,JPEG压缩等压缩攻击,旋转、缩放、平移等全局几何攻击和裁剪、拼贴等特殊攻击以及它们的联合攻击,并且误码率低,接近0.
To solve the problems of resisting to joint attacks and the low extraction accuracy rate that exist in present digital watermarking algorithms, a block fast fourier transtorm （FFT） based on digital watermarking algorithm was proposed. The algorithm normalized the image size and modified the values of blocked FFT coefficients according to the watermark. Watermark was embedded in accordance with the dual circulation. When extracting, the values of FFT coefficients indicated the watermark. Experimental results show that this algorithm can increase resistance to noise filtering and other conventional signal processing attacks; JPEG compression; rotation, translation and scaling attack; cropping and splicing attacks; and their combined attack. The bit error rate is almost 0.
出处
《北京工业大学学报》
EI
CAS
CSCD
北大核心
2012年第11期1694-1697,1715,共5页
Journal of Beijing University of Technology
基金
北京市自然科学基金资助项目(4113068)
北京市教育委员会科技发展计划重点资助项目(KZ201210005007)
中央高校基本科研业务费专项资金资助项目(2012JBM041)
关键词
数字水印
鲁棒性
几何攻击
裁剪攻击
digital watermark
robustness
rotation scaling and translation （RST） attack
croppingattack
