Abstract:

This paper proposes a hypergraph-based steganographic method. In this method, pixels are divided into groups. Hyperedges are constructed by exchangeable relationship between pixels. A hypergraph that is the set of hyperedges is used to represent the cover image. By looking for hypergraph matching using a local optimal greedy algorithm, the secret message is embedded. To show effectiveness of the algorithm, it is compared with the stegangraphic approach based on graph theory for modifying cover images. It is also compared with other traditional spatial domain methods in steganalysis resistance. Experiments show that the proposed method requires less modification of pixels to result in better visual quality of the stego images. It can better resist steganalysis than other spatial domain methods.

Key words: steganalysis, hypergraph, matching, spatial domain steganography