期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Robustness Proof on A United Watermarking Based on CRT Theorem 认领 引用
1
作者 LIULi-gang CHENXiao-su XIAODao-ju HULei 《Wuhan University Journal of Natural Sciences》 EI CAS 2005年第1期307-310,共4页
A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technol... A new method of embedding and detecting a joint watermarking is proposed. Itapplies 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 watermarkingembedding proceeding and analyzing the watermarking detection proceeding, a series of experiments isdone. The experiments emphasize on the method's robust proving and security analysis. And theexperiments show that the method can resistthe attacks of JPEG compress, geometry, noise and grayadjusting. The results of the experiments show that the method has a nice recognition of copyrightfor joint ownership. 展开更多
关键词 united digital watermarking Chinese remainder theorem robustness proof
暂未订购 下载PDF
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈