A Robust Informed Embedding with Low Complexity for Digital Watermarking

勤益科大機構典藏 > 電資學院 > 資訊工程系(所) > 【資訊工程系所】期刊論文 > Item 987654321/7246

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/7246

题名:	A Robust Informed Embedding with Low Complexity for Digital Watermarking
作者:	林基源
贡献者:	資訊工程系
日期:	2012-10
上传时间:	2018-05-24 09:17:28 (UTC+8)
摘要:	This paper presents three novel low-complexity informed embedding algorithms based on a modified trellis structure for a digital watermarking system. These algorithms can embed adaptive robust watermarked bits according to various lengths of linear block codes in a host image of 512 x 512 pixels in size. Instead of using randomly generated reference vectors as arc labels, this algorithm uses the codewords of a linear block code to label the arcs in the trellis structure. The use of linear block code as arc offers two advantages as follows: first, to provide a satisfactory space partition for each trellis section; second, to perform embedding algorithm featuring linear block codes for each trellis section. Moreover, the algorithm proposed algorithm can perform iteration to find a tradeoff between robustness and fidelity by using a number of controllable parameters. Finally, the experimental results demonstrate three objectives as follows: first, to simulate the effect of controllable parameter on the proposed watermarking scheme; second, to report the robustness and fidelity performance of this algorithm in various attack channels, such as Gaussian noise, scaling, low pass filter, and JPEG compression; and third, to simulate computation complexity and the proposed trellis-based informed embedding, which requires less operation complexity compared with Miller's informed embedding method. © ICIC International 2012. (24 refs)
關聯:	International Journal of Innovative Computing, Information and Control
显示于类别:	[資訊工程系(所)] 【資訊工程系所】期刊論文

文件中的档案:

没有与此文件相关的档案.

检视Licence

在NCUTIR中所有的数据项都受到原著作权保护.

数据加载中.....