No abstract

No abstract

This paper proposes two novel self-embedding watermarking schemes based upon a reference sharing mechanism, in which the watermark to be embedded is a reference derived from the original principal content in different regions and shared by these regions for content restoration. After identifying tampered blocks, both the reference data and the original content in the reserved area are used to recover the principal content in the tampered area. By using the first scheme, the original data in five most significant bit layers of a cover image can be recovered and the original watermarked image can also be retrieved when the content replacement is not too extensive. In the second scheme, the host content is decomposed into three levels, and the reference sharing methods with different restoration capabilities are employed to protect the data at different levels. Therefore, the lower the tampering rate, the more levels of content data are recovered, and the better the quality of restored results.

Abstract-This paper proposes a novel fragile watermarking scheme capable of perfectly recovering the original image from its tampered version. In the scheme, a tailor-made watermark consisting of reference-bits and check-bits is embedded into the host image using a lossless data hiding method. On the receiver side, by comparing the extracted and calculated check-bits, one can identify the tampered image-blocks. Then, the reliable reference-bits extracted from other blocks are used to exactly reconstruct the original image. Although content replacement may destroy a portion of the embedded watermark data, as long as the tampered area is not too extensive, the original image information can be restored without any error.Index Terms-Error-free restoration, fragile watermarking, lossless data hiding.

No abstract