Pairwise Prediction-Error Expansion for Efficient Reversible Data Hiding

• Published in: IEEE transactions on image processing Vol. 22; no. 12; pp. 5010 - 5021
• Main Authors: Ou, Bo, Li, Xiaolong, Zhao, Yao, Ni, Rongrong, Shi, Yun-Qing
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.12.2013; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: 2D prediction-error histogram (2D PEH); Algorithm design and analysis; Applied sciences; Correlation; Cryptography; Data mining; Electronic mail; Exact sciences and technology; Histograms; Image processing; Information, signal and communications theory; Pairwise prediction-error expansion (pairwise PEE); Prediction algorithms; reversible data hiding (RDH); Signal and communications theory; Signal processing; Telecommunications and information theory; Two dimensional displays; Performance evaluation; Histogram; Information protection; Redundancy; reversible data hiding (RDH); 2D prediction-error histogram (2D PEH); Pairwise prediction-error expansion (pairwise PEE)
• ISSN: 1057-7149; 1941-0042; 1941-0042
• DOI: 10.1109/TIP.2013.2281422

In prediction-error expansion (PEE) based reversible data hiding, better exploiting image redundancy usually leads to a superior performance. However, the correlations among prediction-errors are not considered and utilized in current PEE based methods. Specifically, in PEE, the prediction-errors are modified individually in data embedding. In this paper, to better exploit these correlations, instead of utilizing prediction-errors individually, we propose to consider every two adjacent prediction-errors jointly to generate a sequence consisting of prediction-error pairs. Then, based on the sequence and the resulting 2D prediction-error histogram, a more efficient embedding strategy, namely, pairwise PEE, can be designed to achieve an improved performance. The superiority of our method is verified through extensive experiments.