New High Capacity Reversible Data Hiding Using the Second-Order Difference Shifting

Abstract

Reversible data hiding (RDH) algorithm is developing rapidly for many years. Usually, the histogram shifting (HS) based RDH algorithm has two main steps: Firstly, a steep difference histogram is generated with some effective methods for difference. Secondly, by extending and shifting some differences in the histogram, bits of information can be embedded into the cover image which can be restored reversibly. In this paper, we proposed the second-order difference to obtain a steeper difference histogram. Firstly, we slide a window with size 2 × 2 through the image. For each block, we can get the two first-order differences by calculating the absolute values of the two differences for its two columns. Thus, the secondorder difference of each block, which is the absolute values of the difference of the two first-order differences, can be obtained. By extending and shifting the second-order difference, a bit may be embedded into the block finally. Experiments reveal that the proposed algorithm outperforms the previous state-of-the-art RDH methods in terms of the computational complexity, image distortion and the embedding performance. INDEX TERMS Difference expanding, cover image, histogram shifting, reversible data hiding, the secondorder difference, watermarking.

Reversible Data Hiding Method for Interpolated Images Based on Modulo Operation and Prediction-Error Expansion

“…During PEE-based data extraction, the predicted value of 60 is obtained using ( 17) and (18). Prediction error 1 60 60 0 e  is calculated using (19).…”

“…RDH has attracted extensive research attention because of its ability to protect the data effectively, and various RDH methods with high performance are available. According to the embedding principle, RDH can be divided into difference expansion (DE) [1]- [10], histogram shifting (HS) [11]- [18] and interpolation techniques (ITs) [19]- [35]. Tian [1] first proposed a DE-based RDH method in 2003 by embedding one-bit segment of secret data into the least significant bit by extending the differences between the pixel pairs of the cover image, and the theoretical data-embedding capacity (in bits per pixel-BPP) was 0.5.…”

A Novel Fingerprinting Technique for Data Storing and Sharing through Clouds

“…We will generate a fingerprint string in real time for each client to generate a request. In [35,36], develop a reversible data technique is developed to hide in audio using a statically computed histogram and hidden key.…”