Adaptive reversible data hiding scheme for AMBTC compressed images

Multimedia Tools and Applications - Protecting the security of information transmission over the Internet has become a critical contemporary issue. Compressed images are now widely used in mobile...     

A reversible data hiding scheme based on the Sudoku technique

Data hiding, also known as information hiding, plays an important role in information security for various purposes. Reversible data hiding is a technique that allows distortion-free recovery of both the cover image and the secret information. In this paper, we propose a new, reversible data hiding scheme that is based on the Sudoku technique and can achieve higher embedding capacity. The proposed scheme allows embedding more secret bits into a pair of pixels while guaranteeing the good quality of the stego-image. The experimental results showed that the proposed scheme obtained higher embedding capacity than some other previous schemes. In addition, our proposed scheme maintained the good visual quality of the stego-image (i.e., PSNR > 46 dB), which outperforms some existing schemes.     

A reversible data hiding scheme based on graph neighbourhood degree

Abstract

The perceptibility and capacity are two vital criteria of data hiding scheme. Concerning these criteria, data hiding algorithm used images as cover object based on the graph theory is proposed in this study. Images are quantised according to determined range and then quantised images are divided into n × n sized blocks. Each block is accepted as a graph and vertexes which have the same quantisation value are accepted as neighbours. Neighbourhood degrees of vertexes are calculated and indices of vertexes that have a neighbourhood degree over the threshold value are stored in the codebook. Pixel values indicated by these indices in the codebook are used for data hiding process. In this algorithm, there is no need for edge extraction because of hiding data to pixels containing vertexes having high neighbourhood degrees. The proposed method is compared with similar methods in literature in terms of the perceptibility and capacity. More successful results are provided than the others.     

A counter-embedding IPVO based reversible data hiding technique

Multimedia Tools and Applications - Improved pixel value ordering utilizes two embedding procedures. These are the maximum and minimum embedding procedures. The maximum embedding procedure modifies...     

An efficient reversible data hiding method for AMBTC compressed images

Multimedia Tools and Applications - Analyzing multimedia data in mobile devices is often constrained by limited computing capacity and power storage. Therefore, more and more studies are trying to...     

A centroid based vector quantization reversible data hiding technique

In this paper, we propose a reversible data hiding scheme that exploits the centroid formula. Specifically, we use it to define a centroid boundary vector and a centroid state codebook CSCB. Initially, our centroid boundary vectors and CSCBs are the same as the side match vector quantization (SMVQ) algorithm’s boundary vectors and state codebooks SCBs. For each VQ index, the proposed scheme exploits the centroid formula to update its centroid boundary vector and the corresponding CSCB. The updating is coupled with a heuristic to select the best state codebook (i.e., either SCB or CSCB) for each VQ index, which generates a highly compressible distribution of index values. Our experimental results show that the proposed scheme can embed n = 1, 2, 3, and 4 bit per index (bpi) at bit rates of 0.332, 0.394, 0.457, and 0.519 bit per pixel (bpp), respectively, for the main codebook size N = 256. These results confirm that the proposed scheme improves recent VQ and SMVQ based reversible data hiding schemes.

     

A novel data hiding scheme based on modulus function

Four criteria are generally used to evaluate the performance of data hiding scheme: the embedding capacity, the visual quality of the stego-image, the security, and the complexity of the data-embedding algorithm. However, data hiding schemes seldom take all these factors into consideration. This paper proposes a novel data hiding scheme that uses a simple modulus function to address all the performance criteria listed above. According to the input secret keys, the encoder and decoder use the same set-generation functions H_r() and H_c() to first generate two sets Kr and Kc. A variant Cartesian product is then created using Kr and Kc. Each cover pixel then forms a pixel group with its neighboring pixels by exploiting an efficient modulus function; the secret data are then embedded or extracted via a mapping process between the variant of the Cartesian product and each pixel group. The proposed scheme offers several advantages, namely (1) the embedding capacity can be scaled, (2) a good visual quality of the stego-image can be achieved, (3) the computational cost of embedding or extracting the secret data is low and requires little memory space, (4) secret keys are used to protect the secret data and (5) the problem of overflow or underflow does not occur, regardless of the nature of the cover pixels.We tested the performance of the proposed scheme by comparing it with Mielikainen’s and Zhang and Wang’s schemes for gray-scale images. The experimental results showed that our proposed scheme outperforms Mielikainen’s in three respects, namely scalable embedding capacity, embedding rate, and level of security. Our data hiding scheme also achieved a higher embedding capacity than Zhang and Wang’s. The proposed scheme can easily be applied to both gray-scale and color images. Analyses of its performance showed that our proposed scheme outperforms Tsai and Wang’s in terms of its time complexity and memory space requirement.     

A novel reversible data hiding scheme with two-dimensional histogram shifting mechanism

Multimedia Tools and Applications - In this paper, we propose a novel reversible data hiding technique based on two-dimensional histogram shifting for quantized discrete cosine transformation...     

A novel auxiliary data construction scheme for reversible data hiding in JPEG images

Multimedia Tools and Applications - Constructing the auxiliary data is important in some reversible data hiding (RDH) techniques, where both the auxiliary data and the secret data are embedded into...     

基于SVD压缩的高保真可逆信息隐藏算法

针对嵌入秘密数据对原始图像造成失真明显的问题,提出一种利用奇异值分解（Singular Value Decomposition,SVD）进行像素预测的可逆信息隐藏算法。首先将原始载体分成灰和白两层,选取灰色层中的像素作为目标像素,其领域上的白色层像素作为参考像素;而后利用这些参考像素构成邻域矩阵,再对其SVD压缩处理,利用压缩结果预测目标像素;最后通过扩展预测误差嵌入秘密数据。实验数据显示,该算法有效降低了携密载体的嵌入失真。     

A novel pixel value ordering reversible data hiding based on dual-image

Multimedia Tools and Applications - Recently, reversible data hiding (RDH) based on pixel value order (PVO) has been an important research direction in the field of information security due to its...     

Image interpolation based high capacity reversible data hiding scheme

Multimedia Tools and Applications - In this paper, we propose a new interpolation technique which considers all the neighboring pixels as well as their impact on the reference pixels to provide...     

A novel reversible data hiding scheme using SMVQ prediction index and multi-layer embedding

Multimedia Tools and Applications - In this paper, a novel reversible data hiding scheme which utilizes SMVQ prediction indices to embed secret data is proposed. As a result, it improves...     

A reversible data hiding scheme using complementary embedding strategy

Obtaining good visual quality and high hiding capacity with reversible data hiding systems is a technically challenging problem. In this paper, we propose a simple reversible data hiding scheme that uses a complementary hiding strategy. The proposed method embeds one secret bit horizontally and vertically into one cover pixel of a grayscale cover image by decreasing odd-valued pixels and increasing even-valued pixels by one. Experimental results show that the hiding capacity measured by bit per pixel (bpp) of the proposed scheme is at least 1.21 bpp with a PSNR (peak signal-to-noise ratio) value greater than 52 dB for all standard test images. Especially in the case of four-layer embedding, the PSNR value of the proposed method is still greater than 51 dB at a hiding capacity of about 5 bpp for all standard test images. In addition, the proposed method is quite simple because it primarily uses additions and subtractions. These results indicate that the proposed scheme is superior to many existing reversible data hiding schemes introduced in the literature.     

A high-capacity reversible data hiding scheme based on sorting and prediction in digital images

In this paper, a new reversible data hiding method based on sorting and prediction in digital images is proposed. The proposed method can embed two bits in the 3 × 1 sub-block at maximum by dividing into two groups - min and max groups. The pixel pairs of the min group and max group are firstly predicted and then are modified to embed the secret bits. The reversibility is guaranteed since the order of pixel pairs of the sub-block is not changed after embedding a secret bit into two groups. The experimental results show that the proposed method provides high embedding capacity than the previous works.     

基于差值直方图的简单高效可逆信息隐藏方法

提出一种基于图像相邻像素差值直方图的可逆信息隐藏方法,运用该方法同时提高了信息嵌入容量和嵌入信息后的图像质量。首先对原始图像进行分块、扫描并求取差值直方图,然后在分块图像的差值直方图中选取最高的两个峰值点并向两个方向移位来产生空缺用于信息嵌入。算法充分利用了自然图像的相邻相似特性,同时提高了基于直方图的信息隐藏方案的峰值点数目和峰值点高度,从而大大提高信息嵌入容量。此外,算法在信息嵌入前对待嵌入信息的预处理使得在嵌入同样容量的信息时,对载体图像的影响更小,具有更好的嵌入后图像质量。     

High capacity reversible data hiding scheme based upon discrete cosine transformation

In this paper, we propose a reversible data hiding scheme based on the varieties of coefficients of discrete cosine transformation of an image. Cover images are decomposed into several different frequencies, and the high-frequency parts are embedded with secret data. We use integer mapping to implement our 2-dimensional discrete cosine transformation. Thus, the image recovered from the modified coefficients can be transformed back to the correct data-hidden coefficients. Since the distribution of 2-dimensional DCT coefficients looks close to Gaussian distribution centralized at zero, it is a natural candidate for embedding secret data using the histogram shifting approach. Thus, our approach shifts the positive coefficients around zero to the right and the negative coefficients around zero to the left in order to leave a space to hide the secret data. The experimental comparisons show that, compared to Chang et al. and Lin et al.'s method, the embedding capacity and quality of the stego-image of the proposed method is a great improvement.     

Reversible data hiding in encrypted AMBTC images

Multimedia Tools and Applications - Signal processing in the encrypted domain has attracted a lot of attention due to the requirement for content security and privacy protection. Reversible data...     

A semantic compression scheme for digital images based on vector quantization and data hiding

Multimedia Tools and Applications - A novel semantic compression based on vector quantization (VQ) and data hiding is proposed. A compact version of the original image is generated, and then, VQ...