340 research outputs found
Prediction-error of Prediction Error (PPE)-based Reversible Data Hiding
This paper presents a novel reversible data hiding (RDH) algorithm for
gray-scaled images, in which the prediction-error of prediction error (PPE) of
a pixel is used to carry the secret data. In the proposed method, the pixels to
be embedded are firstly predicted with their neighboring pixels to obtain the
corresponding prediction errors (PEs). Then, by exploiting the PEs of the
neighboring pixels, the prediction of the PEs of the pixels can be determined.
And, a sorting technique based on the local complexity of a pixel is used to
collect the PPEs to generate an ordered PPE sequence so that, smaller PPEs will
be processed first for data embedding. By reversibly shifting the PPE histogram
(PPEH) with optimized parameters, the pixels corresponding to the altered PPEH
bins can be finally modified to carry the secret data. Experimental results
have implied that the proposed method can benefit from the prediction procedure
of the PEs, sorting technique as well as parameters selection, and therefore
outperform some state-of-the-art works in terms of payload-distortion
performance when applied to different images.Comment: There has no technical difference to previous versions, but rather
some minor word corrections. A 2-page summary of this paper was accepted by
ACM IH&MMSec'16 "Ongoing work session". My homepage: hzwu.github.i
A contrast-sensitive reversible visible image watermarking technique
A reversible (also called lossless, distortion-free, or
invertible) visible watermarking scheme is proposed to satisfy the applications, in which the visible watermark is expected to combat copyright piracy but can be removed to losslessly recover the original image. We transparently reveal the watermark image by overlapping it on a user-specified region of the host image through adaptively adjusting the pixel values beneath the watermark, depending on the human visual system-based scaling factors. In order to achieve reversibility, a reconstruction/ recovery packet, which is utilized to restore the watermarked area, is reversibly inserted into non-visibly-watermarked region. The packet is established according to the difference image between the original image and its approximate version instead of its visibly watermarked version so as to alleviate its overhead. For the generation of the approximation, we develop a simple prediction technique that makes use of the unaltered neighboring pixels as auxiliary information. The recovery packet is uniquely encoded before hiding so that the original watermark pattern can be reconstructed based on the encoded packet. In this way, the image recovery process is carried out without needing the availability of the watermark. In addition, our method adopts data compression for further reduction in the recovery packet size and improvement in embedding capacity. The experimental results demonstrate the superiority of the proposed scheme compared to the existing methods
- …