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.%提出了一种基于超图的图像隐写方法.该方法先对像素分组,再根据像素之间的可交换关系构造超边,用超边的集合(超图)来表示图像,用局部最优的贪婪算法寻找超图的匹配来完成隐秘信息的嵌入.为了说明该方法的有效性,在对载体图像修改方面,与传统的基于图论的隐写方法进行比较；在抗攻击性能方面,与已有的其他空间域方法进行实验比较.实验结果表明,相对于基于图论的方法,文中提出的方法对载体图像像素的修改更小,增强了含密图像的视觉质量,其抗攻击性能也优于现有的其他空间域方法.
展开▼
