Low-complexity data hiding algorithms with graph-based parity check

This paper presents two low-complexity steganographic algorithms based on the proposed graph-based parity check methodology for gray-scale images. Both algorithms embed a segment of n secret bits into n+1 and n cover pixels, respectively. The performances of both algorithms are verified by theoretical distortion analysis. Algorithm1 can generate an optimal toggle sequence with the least number of 1´s under the graph-based parity check model. Algorithm 2 can further enhance the embedding rate and the embedding efficiency of Algorithm1 by the technique of ±1 steganography. The theoretical distortion analyses show that both algorithms are better than the other schemes.