arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.5653cs.CRcs.MM
收藏

基于像素对的水印嵌入容量估计

Estimation of the Embedding Capacity in Pixel-pair based Watermarking Schemes

Rishabh Iyer, Rushikesh Borse, Ronak Shah, Subhasis Chaudhuri

摘要:

嵌入容量的估计是可逆多通道水印中的一个重要问题,并且在任何图像可以被水印之前需要进行分析。在本文中,我们提出了一个有效的方法来估计一个给定的封面图像的嵌入容量下的多遍嵌入,而实际上没有嵌入水印。我们证明了这一类的可逆水印方案上操作的不相交的像素组,特别是像素对。该算法在每个阶段迭代更新共生矩阵,以估计多遍嵌入容量,并与实际水印相比效率更高。我们还提出了一个非常有效的,预计算的树为基础的实现,这是概念上类似的同现为基础的方法,但提供了在一个单一的迭代估计,需要类似的单通容量估计的复杂性。我们还提供了嵌入能力的界限。我们最后展示了我们的方法如何可以很容易地用于许多水印算法,并具体评估了我们的算法在Tian [11]和Coltuc [6]的基准水印方案上的性能。

英文摘要:

Estimation of the Embedding capacity is an important problem specifically in reversible multi-pass watermarking and is required for analysis before any image can be watermarked. In this paper, we propose an efficient method for estimating the embedding capacity of a given cover image under multi-pass embedding, without actually embedding the watermark. We demonstrate this for a class of reversible watermarking schemes which operate on a disjoint group of pixels, specifically for pixel pairs. The proposed algorithm iteratively updates the co-occurrence matrix at every stage, to estimate the multi-pass embedding capacity, and is much more efficient vis-a-vis actual watermarking. We also suggest an extremely efficient, pre-computable tree based implementation which is conceptually similar to the co-occurrence based method, but provides the estimates in a single iteration, requiring a complexity akin to that of single pass capacity estimation. We also provide bounds on the embedding capacity. We finally show how our method can be easily used on a number of watermarking algorithms and specifically evaluate the performance of our algorithms on the benchmark watermarking schemes of Tian [11] and Coltuc [6].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑