Multiple histogram based adaptive pairwise prediction-error modification for efficient reversible image watermarking

• Published in: Information sciences Vol. 581; pp. 515 - 535
• Main Authors: Fan, Guojun, Pan, Zhibin, Zhou, Quan, Gao, Xinyi, Zhang, Xiaoran
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.12.2021
• Subjects: Improved corrective skewed histogram shifting; Multiple histograms modification; Pairwise modification; Reversible data hiding; Step-by-step optimization; Improved corrective skewed histogram shifting; Multiple histograms modification; Reversible data hiding; Step-by-step optimization; Pairwise modification
• ISSN: 0020-0255; 1872-6291
• DOI: 10.1016/j.ins.2021.09.019

The prediction-error expansion (PEE) based reversible data hiding (RDH) methods mainly contain two steps: prediction-error histogram (PEH) generation and PEH modification. Multiple histograms modification (MHM) and pairwise PEE are two efficient methods used in PEH modification, which can greatly reduce the distortion to the cover image under given payloads. However, these two effective methods are not used together for their conflict on causality and large computational complexity. To address the above two problems, in this paper, a group of non-causal predictors with a specially designed complexity metric are proposed so that the conflict on causality is resolved. Then, the original optimization problem to determine the parameters of MHM and pairwise PEE is decomposed into two easier ones, which are addressed by a step-by-step optimization. Several efficient constraints are used to narrow the search range for the optimal parameters while minimizing the performance degradation. As a result, the proposed method can obtain high quality on the embedded images, that is, the average PSNR of the 8 standard 512 × 512 sized grayscale images from the USC-SIPI image database can reach 60.43 dB for the payload of 10,000 bits, while the running time for the proposed algorithm is acceptable. Experimental results show that the proposed method outperforms many kinds of RDH schemes, and achieves an obvious increment in fidelity over a series of state-of-the-art RDH schemes.