Twice Gric Colorings in Steganography

A novel method of steganographic embedding is described based on vertex colorings in the grid graph, in which rainbow coloring is repeated in every block of cover signals to increase embedding efficiency. This is an improvement of the previous grid coloring method in steganography. It also outperforms LSB matching revisited method and direct sums of ternary Hamming codes. The proposed method can generate more embedding schemes which cover the range of change rates and information rates more densely.

[1]  Jessica J. Fridrich,et al.  Grid Colorings in Steganography , 2007, IEEE Transactions on Information Theory.

[2]  Marten van Dijk,et al.  Capacity and codes for embedding information in gray-scale signals , 2005, IEEE Transactions on Information Theory.

[3]  Jessica J. Fridrich,et al.  Constructing Good Covering Codes for Applications in Steganography , 2008, Trans. Data Hiding Multim. Secur..

[4]  J. Mielikainen LSB matching revisited , 2006, IEEE Signal Processing Letters.

[5]  Xinpeng Zhang,et al.  Efficient Steganographic Embedding by Exploiting Modification Direction , 2006, IEEE Communications Letters.