An efficient reversible data hiding scheme based on SMVQ

Abstract

Data hiding technique can hide a certain amount of secret data into digital content such as image, document, audio or video. Reversible compressed image data hiding can loosely restore the cover image after extracting the secret data from the stego-image. In this paper, we present an efficient reversible image data hiding scheme based on side match vector quantisation. Mapping concept is useful for this scheme because it converts the ternary into binary. The proposed scheme significantly increases the payload size of a block, and the quality analysis of the proposed scheme showed that it contains a better peak signal to noise than other schemes.     

An authenticated secure image hiding scheme

Abstract

Image hiding involves the concealment of an embedded secret image within a cover image to form a stego-image. The secret image can be used for transmission across the public networks without its presence being detected. Image hiding thus serves as a way of secure message communication; therefore, except for the platitudinous issues of image quality and hiding capacity, it is necessary to pay more attention to the means to assure the origin and integrity of the delivered content. In this paper, a digital signature scheme is skillfully applied so as to guarantee the integrity and the origin of the transmitted message and a behind-the-scenes guide to recover the hidden secret. Our idea launches realistic feints and ambushes to enhance the effect of camouflage.     

A New Generative Mathematical Model for Coverless Steganography System Based on Image Generation

The ability of any steganography system to correctly retrieve the secret message is the primary criterion for measuring its efficiency. Recently, researchers have tried to generate a new natural image driven from only the secret message bits rather than using a cover to embed the secret message within it; this is called the stego image. This paper proposes a new secured coverless steganography system using a generative mathematical model based on semi Quick Response (QR) code and maze game image generation. This system consists of two components. The first component contains two processes, encryption process, and hiding process. The encryption process encrypts secret message bits in the form of a semi-QR code image whereas the hiding process conceals the pregenerated semi-QR code in the generated maze game image. On the other hand, the second component contains two processes, extraction and decryption, which are responsible for extracting the semi-QR code from the maze game image and then retrieving the original secret message from the extracted semi-QR code image, respectively. The results were obtained using the bit error rate (BER) metric. These results confirmed that the system achieved high hiding capacity, good performance, and a high level of robustness against attackers compared with other coverless steganography methods.     

Hiding a secret colour image in two colour images

Abstract

Visual cryptography is different from traditional cryptography. That is, neither time-consuming computation nor complex cryptographic knowledge is needed. Stacking is the only operation required to recover a secret image, and the individual image does not give the hackers any information about the secret image. None of researches tried to deal with meaningful colour share transparencies. Hence, two methods are proposed for hiding a colour image in two meaningful colour share transparencies in this paper. To achieve this goal, the colour decomposition approach and halftone technology are first applied to cope with secret colour images. Then the concept of the human visual system is utilized to generate two colour meaningful sharing transparencies. To support various applications, two variants are presented. The first proposed method, method-1, is suitable for simple colour images, and the second, method-2, provides better visibility of complex colour images.     

A scheme of reversible information hiding based on SMVQ

Abstract

In this paper, we propose two reversible information hiding schemes based on side-match vector quantisation (SMVQ). In 2006, Chang et al. proposed a data-hiding scheme based on SMVQ coding. In order to increase both the image quality and the embedding capacity, we improve their method by embedding multiple secret bits into a block and finding out the second selected codeword from the full codebook. In addition, we propose another reversible information hiding scheme whose output is a pure VQ index table. The weighted bipartite graph is used to model our scheme and the matching approach is used to find out the best solution. Compared with Chang et al.’s scheme, we have higher visual quality in the experimental results.     

A new semi-blind watermarking algorithm using ordered Hadamard transform

An efficient and fast watermarking algorithm based on ordered Hadamard transform (HT) is proposed. Since it uses a few information of watermark image in secret key, it is categorised as a semi-blind method. In our algorithm, both host and watermark images are decomposed into non-overlapping blocks. Next, they are mapped into transform domain as Hadamard coefficients. Then, several high frequency AC components of host image are substituted with watermark coefficients without using any strength factor. Not employing this factor guarantees the embedded image to be retrieved with primary quality. Moreover, using HT offers several advantages of fastness, higher image fidelity, greater reliability of watermark detection and higher data hiding capacity. The experimental results show that our method keeps the quality of host image and is robust to common attacks. Compared to frequency domain and hybrid methods, it has advantages of shorter processing time, acceptable robustness and ease of hardware implementation.     

Color image hiding based on the phase retrieval technique and Arnold transform

A new (to our knowledge) method is proposed in this paper for color image hiding and extracting using the phase retrieval algorithm in the fractional Fourier transform (FRFT) domain and Arnold transform (ART). Based on a cascaded phase iterative FRFT algorithm, the three channels (R, G, and B) of the secret color image permuted by ART are encrypted. Then the encoded information is embedded in the blue channel (B channel) of the enlarged color host image. Using the security enhanced encryption method, not only the random phase mask and the wavelength but also the transform parameters of ART and FRFT are provided as additional keys for decryption. It is shown that the security of information hiding will be enhanced. Computer simulations are performed to show the hiding capacity of the proposed system. Numerical results are presented to verify the validity and efficiency of the proposed method.     

Dual image based reversible data hiding method using neighbouring pixel value differencing

Abstract

Dual image based reversible data hidings are recently proposed where dual copies of a cover image are used to embed the secret data. In this paper, a novel reversible data hiding method based on neighbouring pixel value differencing is proposed to increase embedding capacity with a good image quality. The mean value of neighbouring pixels and the difference values are used to decide the size of embedding bits per the sub-block. The receiver can extract the secret data and recover the cover image from dual stegoimages. The experimental results show that the proposed method has a higher capacity and still a good image quality where it could embed 767,922 bits and maintain 45.58 and 45.33?dB for dual images.     

Data hiding based on two-stage referencing for two-colour images

Abstract

Data hiding in two-colour images is difficult since 1 pixel requires only 1 bit representation and it is easy to detect for pixel distortion. In this paper, we describe a new data hiding method for two-colour images by two-stage referencing. The cover image is partitioned into n×n non-overlapping sub-blocks, and we calculate difference values by two stages for all pixels to find the suitable replacement pixel. The two-stage referencing is to obtain difference values that are different with the current pixel value for neighbouring pixels with n×n and (n+2)×(n+2). These two difference values are used to embed a secret bit on the sub-block. The experimental results show that the proposed method achieves a good visual quality for the stego-image.     

基于自毁式数字水印的信息隐藏通信技术

目的为了提高信息隐藏通信技术的安全性,提出一种自毁式数字水印隐藏通信技术,即使非法者截获信息的载体也无法获得信息内容。方法将生成的含水印信息的图像分切成图像碎片以此破坏内嵌的水印信息,使水印信息无法从单个的图像碎片中提取,必须经过图像碎片拼接算法合成原始含水印图像后才能提取水印信息。结果通过实验仿真分析,对于大小为32×32像素的8×8个图像碎片,复原的含水印图像无任何图像碎片拼接错位,拼接平均耗时为1.59 s,因此能实现实时在线拼接复原并顺利提取出水印信息。结论从信息的嵌入到最后信息的提取都能顺利地隐藏信息的内容和信息的存在,信息传递过程中信息的安全性能好,因此,自毁式数字水印信息隐藏通信技术是一种可行性极高的信息隐藏通信技术。     

变换域加密全息水印算法

提出了一种基于DCT-DWT的彩色图像全息水印算法。为了保证水印信息的安全性,该算法首先对水印信息进行双随机相位调制,并生成水印全息图;其次,将载体图像在Lab空间内的L分量进行4×4分块,对每一分块进行DCT变换,抽取每个矩阵的中低频系数,组成一个新的矩阵,并对之进行小波分解,将水印全息图嵌入到它的中低频小波系数上。实验结果表明,基于DCT-DWT变换的水印算法具有较好的不可见性,对常见的攻击具有强鲁棒性。     

Hierarchical secret image sharing using phase modulation based on the Fresnel transform

ABSTRACT

In idealized secret image sharing (SIS), all of the shared images (shadows) play the same role, but in real life, the shared images are often hierarchical. This paper proposes a hierarchical secret image sharing (HSIS) method by means of optical imaging. To implement the scheme, a generalized single-phase modulation algorithm is proposed in Fresnel transform domain. Its features that multiple secret images can be recovered through combination of some shared images though each participant only holds one share of images. Theoretically, the secret images are divided into multiple phase encodings (shared images) by phase modulation, each secret image can be directly captured by the intensity detector when illuminating some of the shared images orderly displayed with parallel light. Experimental simulation shows that the shared images and the restored secret images do not have any size distortion, and further verifies the feasibility of the proposed scheme.     

Perceptual image hashing using local entropies and DWT

Abstract

Image hashing is an emerging technology in multimedia security. It uses a short string called image hash to represent an input image and finds applications in image authentication, tamper detection, digital watermark, image indexing, content-based image retrieval and image copy detection. This paper presents a hashing algorithm based on the observation that block entropies are approximately linearly changed after content-preserving manipulations. This is done by converting the input image to a fixed size, dividing the normalised image into non-overlapping blocks, extracting entropies of image blocks and applying a single-level 2D discrete wavelet transform to perform feature compression. Correlation coefficient is exploited to evaluate similarity between hashes. Experimental results show that the proposed algorithm is robust against content-preserving operations, such as JPEG compression, watermark embedding, Gamma correction, Gaussian low-pass filtering, adjustments of brightness and contrast, scaling and small angle rotation. Similarity values between hashes of different images are small, indicating good performances in discriminative capability.     

A robust information hiding scheme for tampered cover images

In this paper, we propose a robust information hiding scheme such that the secret information is restorable upon cover image tampering. The secret information is first translated into a binary image, and then the binary image is encoded into an ‘index table’ via Vector Quantisation (VQ). Without noticeable damage to image quality, the secret information codes (VQ index table of secret information) are hidden repeatedly into the cover image. Using our proposed scheme, the extracted secret codes can be almost completely restored to their original state even when the cover image has been tampered with. Experimental results show that our proposed scheme restores the secret information perfectly under many types of tampering attacks.     

一种非对称鲁棒性盲水印算法

针对数字图像版权保护，提出一种非对称鲁棒性盲数字水印方法。通过将水印嵌入到最少受图像改变影响的子空间，使嵌入水印具有鲁棒性，且通过对特征子空间的选取限制，使算法具有较高的检测概率和安全性以及较低的虚警概率。同时，水印嵌入矩阵与提取矩阵不同，它可公开除密钥外的所有其它的信息，而且能实现水印盲提取。实验结果证明了该算法的鲁棒性。     

Pixel expansion-free grey-scale image sharing method

Abstract

In recent years, many visual secret sharing technologies have been proposed to protect the security of secret images (black and white, grey scale or colour images). In 2005, Lukac and Plataniotis used the concept of the Naor–Shamir method to propose a visual secret sharing technology for sharing secret grey-scale images based on bit-plane decomposition. Although their method can avoid pixel-value cutting problem, it still suffers from the pixel expansion problem. In this paper, we propose a new secret grey-scale image sharing method to improve this situation. In the proposed sharing image creation phase, two sharing images (one is grey-scale and the other is binary) are created and later shared by two protectors. The original secret image can be easily reconstructed if both sharing images are obtained. However, one cannot obtain the original secret image from each of the sharing images. Experimental results also show that the proposed method can effectively solve the pixel expansion problem.     

视频水印技术研究

介绍了多媒体数字水印技术研究方向中当前的一个重点和难点——视频水印技术。它利用数据隐藏技术将特定的信息嵌入到视频数据中，以起到版权保护、秘密通信、数据文件的真伪鉴别和产品标志等作用。视频水印技术可以借鉴图像水印技术大量的研究成果，但又由于视频与图像某些本质的差异，因而在许多方面具有与图像水印不同的技术特征。讨论了视频水印技术的特点，介绍了视频水印技术的发展现状，具体分析了几种视频水印算法方案，并对视频水印技术的发展趋势进行了展望。     

Adaptive,scalable and robust watermarking for wavelet-based progressive image transmission

Abstract

Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper, an adaptive, scalable, blind and robust wavelet-based watermarking approach is proposed. The proposed approach enables scalable watermark detection and provides robustness against progressive wavelet image compression. A multiresolution decomposition of the binary watermark is inserted into the selected coefficients of the wavelet-decomposed image that represent the high activity regions of the image. The watermark insertion is started from the lowest frequency sub-band of the decomposed image and each decomposed watermark sub-band is inserted into its counterpart sub-band of the decomposed image. In the lowest frequency sub-band, coefficients with maximum local variance and in the higher frequency sub-bands, coefficients with maximum magnitude are selected. The watermarked test images are transparent according to the human vision system characteristics and do not show any perceptual degradation. The experimental results very efficiently prove the robustness of the approach against progressive wavelet image coding even at very low bit rates. The watermark extraction process is completely blind and multiple spatial resolutions of the watermark are progressively detectable from the compressed watermarked image. This approach is a suitable candidate for providing efficient authentication for progressive image transmission applications especially over heterogeneous networks, such as the Internet.     

A high-payload,reversible data hiding scheme based on histogram modification in JPEG bitstream

In this paper, we have presented a high-payload, reversible data hiding scheme that is focused on embedding secret data into joint photographic experts group (JPEG) bitstream by using histogram modification. In JPEG, for AC coefficients, 162 different variable length codes (VLCs) are defined and assigned by Huffman coding for all 162 run/size possibilities. After parsing VLC usage in the bitstream, we generated a histogram of run/size. According to a peak point and the nearest zero point of the histogram, the secret data were embedded by modifying the corresponding VLC values slightly. The experimental results and comparing the performance of our scheme with those of other existing schemes demonstrated that the proposed scheme preserved the quality of the image with no distortion and achieved the goal of high embedding capacity.     

A Fusion Steganographic Algorithm Based on Faster R-CNN

The aim of information hiding is to embed the secret message in a normal cover media such as image, video, voice or text, and then the secret message is transmitted through the transmission of the cover media. The secret message should not be damaged on the process of the cover media. In order to ensure the invisibility of secret message, complex texture objects should be chosen for embedding information. In this paper, an approach which corresponds multiple steganographic algorithms to complex texture objects was presented for hiding secret message. Firstly, complex texture regions are selected based on a kind of objects detection algorithm. Secondly, three different steganographic methods were used to hide secret message into the selected block region. Experimental results show that the approach enhances the security and robustness.