559 research outputs found

    General Framework of Reversible Watermarking Based on Asymmetric Histogram Shifting of Prediction Error

    Get PDF
    This paper presents a general framework for the reversible watermarking based on asymmetric histogram shifting of prediction error, which is inspired by reversible watermarking of prediction error. Different from the conventional algorithms using single-prediction scheme to create symmetric histogram, the proposed method employs a multi-prediction scheme, which calculates multiple prediction values for the pixels. Then, the suitable value would be selected by two dual asymmetric selection functions to construct two asymmetric error histograms. Finally, the watermark is embedded in the two error histograms separately utilizing a complementary embedding strategy. The proposed framework provides a new perspective for the research of reversible watermarking, which brings about many benefits for the information security

    PERFORMANCE EVALUATION AND COMPARATIVE ANALYSIS OF WATERMARKING ALGORITHM BASED ON ADAPTIVE PREDICTION METHOD

    Get PDF
    Now a days digital watermarking appeared as a solution for copyright detection, protection and maintenance of important data. This paper deals with a new reversible watermarking algorithm based on adaptive prediction error expansion, which can recover original image after extracting the hidden data. Embedding capacity of such algorithm depend on the prediction accuracy of the predictor. The method can embed secret data into 3×3 image block order by exploiting the pixel redundancy within each block. It has been observed that proposed method of reversible watermarking provide much better results in terms of Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE) in comparison to existing literature

    Prediction-error of Prediction Error (PPE)-based Reversible Data Hiding

    Full text link
    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

    Get PDF
    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
    corecore