Novel Prediction Error Based Reversible Data Hiding Method Using Histogram Shifting

Abstract

Abstract-Reversible data hiding can recover the original image from the marked image without any distortion. This paper presents a novel prediction error based reversible data hiding method using histogram shifting in spatial domain. Three predictors including Mean, JPEG lossless and median edge detector (MED) are employed to compute prediction values for current pixels, respectively. Prediction errors are calculated as well to build histogram bins. Histogram shifting mechanism is designed that bins with large prediction errors are shifted based on hiding level, and thus, it will not hurt marked image if hiding level is not high. Histogram bins with small error predictions are used to hide secret data. Experimental results demonstrate that average of prediction error is less than that of interpolation error used in existing data hiding methods, and the proposed method is good at high capacity hiding. MED is the best predictor among three predictors in the proposed method, and it outperforms existing data hiding methods in terms of capacity and marked image quality.Index Terms-Reversible data hiding, histogram shifting, median edge detector, prediction error.

Pixel-Value-Ordering based Reversible Information Hiding Scheme with Self-Adaptive Threshold Strategy

“…Take Figure 5b as an example. Through Equation (8), we know that the complexity of the large block is NL = max (7,19,56,56) − min (5,17,19,19) = 56 − 5 = 51. The computation flow is shown in Figure 5.…”

“…It is assumed that the threshold values are T 2 = 15 and T 1 = 60. When the four sub-block pixel combination in the first 4 × 4 block is X 1 = {5, 4, 7, 17}, X 2 = {15, 19, 17, 54}, X 3 = {13, 19, 89, 56}, and X 4 = {19, 17, 56, 56}, and each sub-blocks are sorted individually; through Equation 8, the computed block complexity is NL = max (7,19,56,56) − min (5,17,19,19) = 51. When T 2 < NL ≤ T 1 , it conforms to the general complexity block in Case 2, hence the entire block is reordered.…”

“…Through Equations (4) and (5), the computed error values are PE 2 max = −3 and PE 2 min = 0. Finally, using Equations (6) and (7), the confidential information s = 0 is embedded and displaced to give x ∆(n) = 18 + 1 = 19 and x ∆(1) = 14 − 0 = 14. The camouflaged pixel values of the four sub-blocks can be obtained in the same way.…”

“…The more accurate the predicted values, the smaller the errors, and the larger the hiding capacity. For instance, Thodi and Rodriguez [6], Luo et al [7], and…”