Robust Reversible Data Hiding Scheme Based on Gravity Center Difference

Robust Reversible Data Hiding Scheme Based on Gravity Center Difference

Qunting Yang, Tiegang Gao
Copyright: © 2014 |Pages: 20
DOI: 10.4018/ijdcf.2014100102
(Individual Articles)
No Current Special Offers


This paper presents a robust reversible data hiding scheme in wavelet domain. The proposed scheme divides the permuted image into non-overlapping blocks and then gets sub-blocks. The generated sub-blocks are transformed by discrete wavelet transform and the corresponding low frequency regions are gotten, respectively. The gravity centers of low frequency regions in every non-overlapping block are very similar. These gravity center pairs are utilized to embed secret data since the insensitivity of the gravity centers to malicious tampering. Experimental results show that the original image can be recovered without any distortion after the hidden data have been extracted if the stego image has not been altered. Meanwhile hidden data can still be extracted without error when the image is compressed by JPEG and JPEG2000 to a certain extent. Compared with some existing literatures, the security, payload and robustness of the proposed scheme are significantly improved.
Article Preview


With the rapid development of network technologies and digital devices, the delivery of digital multimedia becomes faster and easier. However, distributing digital data over public networks is not reliably safe because of the risk of incurring leaks of sensitive information. Therefore, the protection of digital data, especially sensitive data, has become an important issue.

As an important way to protect secret information, data hiding technique has been extensively studied recently. Data hiding is different from classical encryption, which hides secret information into a cover object (e.g., image, video, audio, text) to create a stego medium with little distortion (Provos & Honeyman, 2003; Li et al., 2010). In general, data hiding includes digital watermarking and steganography(Petitcolas et al.,1999) .Digtal watermarking is used for copyright protection (Nikolaidis & Pitas, 1998; Lin et al., 2001), authentication (Lin & Chang, 2001; Lu & Liao, 2001), and transaction tracking (wong et al.,2005), etc., whereas steganography undetectably alters a cover object to conceal a secret message(Cox et al.,2007). Usually, three different aspects in steganographic systems contend with each other: payload, imperceptibility, and robustness (Langelaar et al.,2000; Sabeti et al.,2010). The tradeoffs of these aspects vary with the application domains and users’ requirements.

Many steganographic techniques about embedding data into images have been proposed. For example, Wu and Tsai (2003) introduced a steganography based on pixel-value differencing, which hided large amount of secret bits into an image by modifying the difference values between pairs of adjacent pixels. To enhance the security, Zhang and Wang (2004) proposed a modified scheme by selecting the length of the intervals randomly. Chen et al. (2010) proposed a steganography mechanism using hybrid edge detector. Hsiao and Chang (2011) proposed an adaptive steganographic method based on the measurement of just noticeable distortion profile measurement.

In general, embedding secret data into a cover image often leads to the degradation of embedded image and the original image can’t be recovered. However, in some applications, such as military image systems, medical diagnosis, and art works, it is critical for an original image to be recovered or reversed after the hidden data are extracted. This technique, which is called distortion-free or lossless data hiding, has drawn tremendous attention in recent years. Tian (2003) proposed a reversible data embedding scheme with high payload and good imperceptibility and then Alattar (2004) generalized Tian’s scheme. Kim et al. (2008) introduced histogram based reversible data hiding technique by using subsampling, and some other reversible image steganographic schemes, such as (Lee et al.,2008; Kieu & Chang,2009; Wu et al.,2010; Chang & Kieu,2010), are also introduced recently.

Complete Article List

Search this Journal:
Volume 16: 1 Issue (2024)
Volume 15: 1 Issue (2023)
Volume 14: 3 Issues (2022)
Volume 13: 6 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing