首页> 外文期刊>Wuhan University Journal of Natural Sciences >Robustness Proof on A United Watermarking Based on CRT Theorem
【24h】

Robustness Proof on A United Watermarking Based on CRT Theorem

机译:基于CRT定理的联合水印鲁棒性证明

获取原文
获取原文并翻译 | 示例
           

摘要

A new method of embedding and detecting a joint watermarking is proposed. It applies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem) theorem, to the digital watermarking technology. On the base of describing the watermarking embedding proceeding and analyzing the watermarking detection proceeding, a series of experiments is done. The experiments emphasize on the method's robust proving and security analysis. And the experiments show that the method can resistthe attacks of JPEG compress, geometry, noise and gray adjusting. The results of the experiments show that the method has a nice recognition of copyright for joint ownership.
机译:提出了一种嵌入和检测联合水印的新方法。它将基于CRT(中国余数定理)定理的Asmoth-bloom秘密共享方案应用于数字水印技术。在描述水印嵌入过程并分析水印检测过程的基础上,进行了一系列实验。实验强调该方法的鲁棒证明和安全性分析。实验表明,该方法能够抵抗JPEG压缩,几何,噪声和灰度调整的攻击。实验结果表明,该方法对联合所有权享有良好的版权认可。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号