Abstract
Aiming to embed large amount of data while minimize the sum of costs of all changed pixels, a novel high capacity data hiding scheme based on (7, 4) Hamming code is realized by a family of algorithms. Firstly, n (n = 1, 2, 3) cover pixels are assigned to one set according to the payload. Then, 128 binary strings of length seven are divided into eight sets according to the syndrome of every binary string. Binary strings that share the same syndrome are classified into one set. Finally, a binary string in a certain set determined by the data to be embedded is chosen to modify some of the least significant bits of the n cover pixels. The experimental results demonstrate that the image quality of the proposed method with high embedding payload is superior to those of the related schemes.
Highlights
Data hiding, frequently interchangeably referred to as information hiding, is the art of embedding additional data in a certain carrier (Zielińska et al 2014)
One of the explorations to achieve this goal is applying the error correcting code to data hiding, and many researchers have done a lot of research in this area (Chang and Chou 2008; Chen et al 2013; Liu 2007; Ma et al 2013; Wang 2009; Yin et al 2010; Zhang et al 2007; Zhu et al 2010)
K bits were embedded into 2k − 1 cover pixels by modifying the least significant bits (LSBs) of one pixel
Summary
Frequently interchangeably referred to as information hiding, is the art of embedding additional data in a certain carrier (Zielińska et al 2014). Crandall originally proposed a data hiding scheme named matrix encoding (Crandall 1998) in 1998 In this scheme, k bits were embedded into 2k − 1 cover pixels by modifying the least significant bits (LSBs) of one pixel. A binary string of length 2k − 1 in a specific set was selected out to embed k bits It presented a new idea in applying Hamming code to data hiding. The marked-image quality of the aforementioned schemes is ideal when the embedding payload is low (no more than k/(2k − 1) or (k + 1)/2k bpp), but it degrades hardly with the increase of the embedding payload Against this problem, a new data hiding scheme based on (7, 4) Hamming code is proposed in this paper. The marked-image quality of the proposed scheme is superior to those of the related works in Crandall (1998), Zhang et al (2007) and Chang and Chou (2008) under a high embedding payload
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call