Image Data Hiding Schemes Based On Graph Coloring

With the evolving of computer and network technology, the level of information in people's live deepens day by day. Information security has increasingly become a problem concerning on national interest, social development and personal economic benefits. In the field of information security, data hiding is a new technology. In the past ten years, information hiding has been in a rapid development. This paper introduces the basic concepts of information hiding and related theories firstly, and then described in development in the irreversible data hiding based on digital image. So far, graph coloring theory has been applied in a variety of applications. However, it has never been used in data hiding field. This paper summarizes previous studies firstly, and then proposed three data hiding schemes based on graph coloring algorithm.(1) 2 image data hiding schemes based on graph coloring. This paper proposed 2 image data hiding schemes based on graph coloring. Both schemes are in hiding secret information into an image in space domain. The main idea of our schemes is to use a graph, in which every vertex corresponds to a pixel pair, to hide data by replacing a pair of pixels of one color with a pair of pixels of a different color, with every color corresponding to some bits of the secret message. The performance of the proposed schemes has been evaluated by a joint evaluation of the imperceptibility of the images they produce and their embedding capacity. Also, the validity of the proposed schemes has been proven by comparing them with some other schemes.(2) An image data hiding scheme based on Vector Quantization (VQ) and Graph Coloring. Vector quantization, i.e., VQ, is an important image compression method. In the past, many data hiding schemes have been proposed based on VQ. However, none of them is graph coloring based, although graph coloring has been used in many applications. In this work, we propose a VQ-based data hiding scheme using graph coloring. The proposed scheme colored every codeword in the codebook in different colors, each of which represents some bits of secret messages. Then the scheme hidden data into the compression code through replacing one codeword in a color with another codeword in another color. The performance of the proposed scheme was evaluated on the basis of embedding capacity and imperceptibility, which proved the scheme's validity.