Abstract
This paper presents a reference sharing mechanism-based self-embedding watermarking scheme. The host image is embedded with watermark bits including the reference data for content recovery and the authentication data for tampering location. The special encoding matrix derived from the generator matrix of selected systematic Maximum Distance Separable (MDS) code is adopted. The reference data is generated by encoding all the representative data of the original image blocks. On the receiver side, the tampered image blocks can be located by the authentication data. The reference data embedded in one image block can be shared by all the image blocks to restore the tampered content. The tampering coincidence problem can be avoided at the extreme. The maximal tampering rate is deduced theoretically. Experimental results show that, as long as the tampering rate is less than the maximal tampering rate, the content recovery is deterministic. The quality of recovered content does not decrease with the maximal tampering rate.
Highlights
With the rapid development of information science and computer network techniques, digital images can be copied, altered, and spread over the network
The performance of selfembedding schemes is commonly evaluated by the peak signal to noise ratio (PSNR) between the original image and the watermarked image, PSNR between the recovered image and the watermarked image, and a bound on the allowed amount of modifications, that is, the maximal tampering rate
In [21], the erasure channel is taken as the natural model of the self-embedding problem, and the random linear fountain (RLF) code is used to encode the representative information of all image blocks to generate the reference data
Summary
With the rapid development of information science and computer network techniques, digital images can be copied, altered, and spread over the network. In [21], the erasure channel is taken as the natural model of the self-embedding problem, and the random linear fountain (RLF) code is used to encode the representative information of all image blocks to generate the reference data. The reference bits to be embedded in an image block will be shared by all the image blocks for content restoration; the tampering coincidence problem can be avoided at the extreme. With the same rate of reference information per image block, the proposed approach in [21] allows for working with higher tampering rates than other self-embedding schemes In these classic reference sharing mechanism-based self-embedding schemes, the binary random matrix is used as the encoding matrix.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
