Application chaos map and genetic algorithm in binary image data hiding

This paper proposes a block-based scheme on binary image watermarking which is optimized with chaos map and genetic algorithm. First, the host image is divided into fixed-size blocks and extracted characters from the blocks. And then the genetic algorithm is introduced to find optimum parameter of the chaotic system to obtain the best consistency between the sequences of watermark bits and the character of the blocks. By this method, the number of flipped pixels can be reduced to minimum, so the visual quality of the binary image can be improved significantly.