New steganography scheme using graphs product

One of the goals of Steganography is to design schemes with high embedding efficiency, which can be broadly defined as the ratio between the amount of the communicated information and the amount of introduced distortion. In this contribution, a novel method of steganographic embedding is described by vertex coloring in the graphs product. We investigate the cartesian product for improvement CI-rate of ±1 Steganography. Finally, the performance of the proposed methods is evaluated and compared with those of the aforementioned methods.