Article Preview
TopA considerable amount of effort has been devoted to model and characterized the RDH with the aim of creating a consistent mathematical framework to analyze such techniques effectively. In 1997, J. M. Barton proposed the first RDH scheme. There are some popular techniques like Integer Transformation, Difference Expansion, Histogram Shifting, Interpolation technique etc. has been used in RDH over past few years (Govind & Wilscy, 2015; Tian, 2003; Zhang et al., 2014; Rathika & Kumaresan, 2016; Zhang, 2011). Integer Transformation techniques are used to embed 1-bit secret data into a one-pixel pair in a way that the sum of the pixel pair remains unchanged. Based on the invariability of some values and the equality between the parties of sum values and difference values, the extraction of secret data bits and recovery of pixel pairs can be easily achieved (Peng et al., 2012). The difference expansion is the high-quality reversible method for hidden data communication. Here the predicted image pixel error is used instead of the pixel-pair difference for difference expansion (DE) embedding (Govind et al., 2015; Tian, 2003).
A typical RDH scheme is achieved through Histogram Shifting (HS), which is widely investigated due to its high quality of stego-image. An evolutionary optimization algorithm is employed to search the nearly optimal zero and peak bins. For a given data payload, the proper number of zero and peak bin pairs can be adaptively determined (Lu et al., 2014; Wang et al., 2017).