Search

Abstract: This paper presents an image authentication scheme for digital images. The proposed scheme protects a group of n images mutually. It designs a block matching procedure to generate the recovery data for each image, and applies a (t, n −1), 2≤ t < n, threshold mechanism to encode each recovery data in n −1 shares. The recovery shares are cross-embedded in the n images using a modified reversible contrast mapping watermarking scheme. A signature-based authentication code is finally generated and stamped to provide evidence for integrity of each image. The scheme not only can detect the tampering activities, but also can locate and recover the invalid regions of the tampered image if t or more watermarked images in the same group were intact. A nice characteristic of the proposed scheme is that the original images can be reconstructed lossless if no watermarked image was tampered, making the technique feasible in the application of protecting very sensitive images such as military or medical images. Experimental results show that the proposed scheme successfully detects various kinds of image alterations such as filtering, cropping, and replacement, and the corrupted images are properly recovered using the cross-recovery scheme. [Copyright &y& Elsevier]

This paper proposes a method for hiding an important image in a cover image whose size is limited. In this method, in order to save space, a modified search-order coding (MSOC) technique first transforms the important image, then, a randomization procedure permutes the transformed image to further increase the security. Finally, a modulus function embeds the permuted code in a cover image; notably, in the modules function, the modulus base used for a pixel is determined according to the variance of its neighboring pixels. Experimental results show that the images are of high quality. Comparisons with reported methods are provided. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a novel image-hiding method that exhibits a high hiding capacity that allows the embedded important image to be larger than the cover image, a facility that is seldom described in the literature. In the proposed method, the entire important image is divided into many nonoverlapping blocks. For each block of the important image, a block-matching procedure is used to search for the best similar block from a series of numbered candidate blocks. The obtained indices of the best-matching blocks are encoded using Huffman coding scheme, and then recorded in the least-significant-bit planes of the cover image through a monoalphabetic transposition cipher. The proposed method exhibits the following advantages over existing methods: (1) a high hiding capacity such that the embedded important image can be larger than the cover image; (2) a stego-image with a high quality, which improves the secrecy of the hidden image; and (3) a small error between the extracted important image and the original important image indicating that the extracted important image is of acceptable quality. [Copyright &y& Elsevier]

Abstract: Secret image sharing is a technique for protecting images that involves the dispersion of the secret image into many shadow images. This endows the method with a higher tolerance against data corruption or loss than other image-protection mechanisms, such as encryption or steganography. In the method proposed in this study, the difference image of the secret image is encoded using Huffman coding scheme, and the arithmetic calculations of the sharing functions are evaluated in a power-of-two Galois Field GF(2 t ). Experiment results show that each generated shadow image in the proposed method is about 40% smaller than that of the method in [Thien, C.C., Lin, J.C., 2002. Secret image sharing. Comput. Graphics 26 (1), 765–770], which improves its efficiency in storage, transmission, and data hiding. [Copyright &y& Elsevier]