期刊文献+

一种变换域的音频多水印算法探索 被引量:4

A Digital Audio Multi-Watermarking Algorithm in Transform-Domain
下载PDF
导出
摘要 文章提出了一种用不同方式在变换域嵌入两种水印的方案。该算法是对多水印系统的一次探索,它在DCT域添加随机序列作为稳健水印,然后又通过实施适当的量化策略,实现在稳健水印的基础上加入了易损水印。通过实验,证明了在同一音频作品里面以这样的方式加入两种水印,通过一定的控制,它们可以分别起作用,通过计算提取的易损水印,可以很容易对音频信号的原始性作出结论,而提取出的稳健水印则对诸如滤波、重采样、加噪等攻击表现出很好的稳健性。 This paper presents a kind of algorithm of multi-watermarking. In this scheme, we have used random sequences as the robust watermarking, and it is embedded in transform-domain. Then in the same domain, appropriate quantization has been used to produce the fragile watermarking. Experiments'results show that the two kind of watermarking can respectively do their work well by proper control. By the extraction, we can get the two kind of watermarkings, the one of them can be used to estimate the watermarked signal's origination, and the other one is robust to many operations to digital signal, such as filter, resample and so on.
作者 杨洋 陈小平
出处 《微电子学与计算机》 CSCD 北大核心 2004年第6期63-66,共4页 Microelectronics & Computer
基金 江苏省高校重点实验室开放课题(KJS02008)
关键词 数字水印 稳健性 量化 变换域 Digital watermarking, Robustness, Quantization, Transform-domain
  • 相关文献

参考文献5

二级参考文献7

  • 1Voyatzis G, Pitas I. The use of watermarks in the protection of digital multimedia products. Proceedings of the IEEE, 1999, 87(7):1197-1207
  • 2Wolfgang R B, Podilchuk C I, Delp E J. Proceedings of the IEEE, 1999, 87(7):1108-1126
  • 3Bender W, Gruhl D, Morimoto N. Techniques for data hiding. IBM Systems Journal, 1996, 35(3-4): 313-336
  • 4Basia P, Pitas I. Robust audio watermarking in the time-domain. In:Proc of EUSIPCO'98, Rhodes, Greece, 1998.25-28
  • 5Boney L, Tewfik A H, Hamdy K N. Digital watermarks for audio signals. In:Proc International Conference on Multimedia Computing and Systems, Hiroshima, Japan, 1996. 473-480
  • 6钮心忻,杨义先.基于小波变换的数字水印隐藏与检测算法[J].计算机学报,2000,23(1):21-27. 被引量:129
  • 7隋媛媛,胡俊,刘振华.逆镶嵌水印攻击和单向数字水印[J].计算机工程与应用,2000,36(4):64-68. 被引量:10

共引文献98

同被引文献8

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部