A new method for data hiding in binary images based on block pattern coding and dynamic programming with distortion-minimizing capabilities is proposed. Up to three message data bits can be embedded into each 22 block in an input image by changing the block's pixel pattern into another, which represents the value of the message data bits as a code according to a block pattern encoding table. And extraction of hidden message data is accomplished by block pattern decoding. To minimize the resulting image distortion, two optimization techniques are proposed. The first is to use multiple block pattern encoding tables, from which an optimal one is selected specifically for each input image, and the second is to use a dynamic programming algorithm to divide the message data into bit segments for optimal embedding in a sense of minimizing the number of binary bit flippings. Accordingly, not only more data bits can be embedded in an image block on the average, but the resulting image distortion is also reduced in an optimal way. Experimental results are also included to show the effectiveness of the proposed approach.

Conventional authentication methods, proposed mainly for gray-scale and color images, are not appropriate for palette images, which usually contain simple contents with a limited number of colors. In this paper, a new approach is proposed to verify the integrity of palette images and to locate tampered regions without re-quantization and re-indexing processes. The proposed approach is based on a combined use of both the fragile watermarking and the digital signature approaches, taking the advantages of both approaches and avoiding their drawbacks. To protect a block of an image, authentication signals are first generated according to a secret key. Based on an embeddability property defined in the study, the pixels of each block are classified as embeddable or non-embeddable. Only the former ones are used to embed the authentication signals. A corresponding digital signature is generated as well to compensate the possibly limited embedding capacity of the embeddable pixels that are insufficient in number. To authenticate a block, the recovered authentication signals, yielded from the extracted watermark and the received digital signature, are compared with the one generated according to the correct secret key, to prove the block's legitimacy. The effectiveness and the security of the proposed method are analyzed and tested with a variety of palette images. The results indicate that the proposed method can offer high authentication accuracy as well as maintain a good tradeoff between the authentication signal portability and the resulting image quality.

The two issues of art image creation and data hiding are integrated into one and solved by a single approach in this study. An automatic method for generating a new type of computer art, called stained glass image, which imitates the stained-glass window picture, is proposed. The method is based on the use of a tree structure for region growing to construct the art image. Also proposed is a data hiding method which utilizes a general feature of the tree structure, namely, number of tree nodes, to encode the data to be embedded. The method can be modified for uses in three information protection applications, namely, covert communication, watermarking, and image authentication. Besides the artistic stego-image content which may distract the hacker's attention to the hidden data, data security is also considered by randomizing both the input data and the seed locations for region growing, yielding a stego-image which is robust against the hacker's attacks. Good experimental results proving the feasibility of the proposed methods are also included.