检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京石油化工学院计算机系,北京102617 [2]北京化工大学信息科学与技术学院,北京100029
出 处:《北京石油化工学院学报》2008年第4期37-41,共5页Journal of Beijing Institute of Petrochemical Technology
基 金:北京市教委科技发展计划面上项目;项目:KM200510017006;北京市属市管高等学校人才强教计划资助项目
摘 要:鲁棒音频水印算法应该能够抵抗多种典型攻击,但目前具有这种综合性能的算法还很少。在详细分析时域数据受到攻击前后的分布基础上,发现了数据统计均值呈现出良好的不变特性,且数据直方图4个连续Bin样本关系总是保持在±5%之内。提出了基于概率统计特征的通用数据选择方法,适用于正态分布数据的水印隐藏要求。然后,利用直方图4个连续Bin样本的稳定关系原理,设计了基于统计特征的水印嵌入和提取算法。实验结果表明:该算法除了能抵抗MP3、重采样、重量化和规一化攻击外,还完全能够抵抗4k低通滤波、105%至70%的基频不变TSM、以及10%和200%的重采样TSM攻击,而且在10%至250%的范围内容完全抵抗音量缩放攻击。此外,建立的步长调配因数有助于进一步提高隐藏效果。Few audio watermarking algorithms are robust to most of the audio attacks today. Based on the data distribution in time domain before and after attacking on the audio, it is clear that the mean shows good invariant statistical feature. The relation of four consecutive bins in a histogram keeps within ±5%. Then, a general data selection approach, which meets the demands of normal distribution data, is created for the watermark hiding. Furthermore, an audio watermarking algorithm of embedding and extracting is designed with statistical features of the stable relation of four consecutive bins. Experimental results show that the algorithm can resist on attacks of low pass filtering to 4 kHz, pitch invariant TSM changes from 105% to 70%, and resample TSM changes from 10% to 200%. The algorithm can also resist on the attack of amplifying change of ±30%, along with strong robustness to the common attacks of MP3 compression, re-sampling, re-quantizing and normalizing. Besides, a modification factor is established for the embedding step to get higher hiding performance.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62