Generalized running coding for efficient data hiding

This paper generalizes the running coding method for efficient data hiding. In this way, each secret digit in a prime-base notational system is represented by a series of cover values. Modification on one cover value can be used to embed several secret digits, so that distortion is significantly reduced. The original running coding method can be viewed as a special case of the generalized scheme with a prime base p = 2. And theoretical analysis shows that the generalized running coding with p = 3 can provide the best performance.

[1]  Yu-Chee Tseng,et al.  A secure data hiding scheme for binary images , 2002, IEEE Trans. Commun..

[2]  Huaiqing Wang,et al.  Cyber warfare: steganography vs. steganalysis , 2004, CACM.

[3]  Jessica J. Fridrich,et al.  Matrix embedding for large payloads , 2006, IEEE Transactions on Information Forensics and Security.

[4]  Xinpeng Zhang,et al.  Dynamical running coding in digital steganography , 2006, IEEE Signal Processing Letters.

[5]  Marten van Dijk,et al.  Embedding Information in Grayscale Images , 2001 .

[6]  Andreas Westfeld,et al.  F5-A Steganographic Algorithm , 2001, Information Hiding.