Robust Data Hiding Method for Palette Images Using Double Messages Embedding

2012 ◽  
Vol 263-266 ◽  
pp. 2510-2514 ◽  
Author(s):  
Mei Yi Wu
Keyword(s):  
Image Compression ◽  
Data Hiding ◽  
Web Sites ◽  
High Performance ◽  
Parity Check ◽  
Embedding Capacity ◽  
Stego Image

The commonly used JPEG and GIF images on Internet web sites have become more popular for steganographic applications. However, the use of lossy image compression will destroy the embedded message on the marked images. This article presents a novel data hiding method for palette images which can embed double messages, secret and robust messages, into palette images. The receivers can extract both the embedded two messages with no loss if the stego-image is not encountered any attack. If the stego-image is attacked, we can still extract the robust message with little distortion from the attacked images. The proposed method is based on parity check and statistical quantity histogram. Experiment results show the proposed method can achieve high performance in embedding capacity and robustness.

scholarly journals Taylor expansion based stereo image reversible data hiding

2020 ◽  
Author(s):  
Xinyang Ying ◽  
Guobing Zhou
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Taylor Expansion ◽  
Stereo Image ◽  
Embedding Capacity ◽  
Stereo Images ◽  
Secret Data ◽  
Stego Image ◽  
Multi Level

Abstract The reversible data hiding allows original image to be completely recovered from the stego image when the secret data has been extracted, it is has drawn a lot of attentions from researchers. In this paper, a novel Taylor Expansion (TE) based stereo image reversible data hiding method is presented. Since the prediction accuracy is essential to the data hiding performance, a novel TE based predictor using correlations of two views of the stereo image is proposed. TE can fully exploit strong relationships between matched pixels in the stereo image so that the accuracy of the prediction can be improved. Then, histogram shifting is utilized to embed data to decrease distortion of stereo images, and multi-level hiding can increase embedding capacity. Experimental results show that the proposed method is superior to some existing data hiding methods considering embedding capacity and the quality of the stego stereo images.

A New Steganography Method Using Integer Wavelet Transform and Least Significant Bit Substitution

2019 ◽  
Vol 62 (11) ◽  
pp. 1639-1655
Author(s):  
Manashee Kalita ◽  
Themrichon Tuithung ◽  
Swanirbhar Majumder
Keyword(s):  
Wavelet Transform ◽  
Data Hiding ◽  
Integer Wavelet Transform ◽  
Embedding Capacity ◽  
Least Significant Bit ◽  
Stego Image ◽  
Significant Similarity ◽  
Chi Squared ◽  
Integer Wavelet

Abstract Steganography is a data hiding technique, which is used for securing data. Both spatial and transform domains are used to implement a steganography method. In this paper, a novel transform domain method is proposed to provide a better data hiding method. The method uses a multi-resolution transform function, integer wavelet transform (IWT) that decomposes an image into four subbands: low-low, low-high, high-low and high-high subband. The proposed method utilizes only the three subbands keeping the low-low subband untouched which helps to improve the quality of the stego image. The method applies a coefficient value differencing approach to determine the number of secret bits to be embedded in the coefficients. The method shows a good performance in terms of embedding capacity, imperceptibility and robustness. A number of metrics are computed to show the quality of the stego image. It can also withstand RS steganalysis, Chi-squared test and Subtractive Pixel Adjacency Matrix steganalysis successfully. The deformation of the histogram and Pixel Difference Histogram for different embedding percentages are also demonstrated, which show a significant similarity with the original cover image. The proposed method shows an achievement of 2.3bpp embedding capacity with a good quality of stego image.

Enhanced stego-image quality and embedding capacity for the partial reversible data hiding scheme

2019 ◽  
Vol 78 (13) ◽  
pp. 18595-18616
Author(s):  
Ching-Nung Yang ◽  
Song-Yu Wu ◽  
Yung-Shun Chou ◽  
Cheonshik Kim
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Embedding Capacity ◽  
Stego Image

scholarly journals AN EFFECTIVE REVERSIBLE DATA HIDING METHOD BASED ON PIXEL-VALUE-ORDERING

2020 ◽  
Vol 36 (2) ◽  
pp. 139-158
Author(s):  
Nguyen Kim Sao ◽  
Nguyen Ngoc Hoa ◽  
Pham Van At
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
New Method ◽  
Embedding Capacity ◽  
Stego Image ◽  
Pixel Value ◽  
Using Data ◽  
Location Map ◽  
Better Than

This paper presents a new effective reversible data hiding method based on pixel-value-ordering (iGePVO-K) which is improvement of a recent GePVO-K method that recently is considered as a PVO-used method having highest embedding capacity. In comparison with GePVO-K method, iGePVO-K has the following advantages. First, the embedding capacity of the new method is higher than that of GePVO-K method by using data embedding formulas reasonably and reducing the location map size. Second, for embedding data, in the new method, each pixel value is modified at most by one, while in GePVO-K method, each pixel value may be modified by two. In fact, in the GePVO-K method, the largest pixels are modified by two for embedding bits 1 and by one for bits 0. This is also true for the smallest pixels. Meanwhile, in the proposed method, the largest pixels are modified by one for embedding bits 1 and are unchanged if embedding bits 0. Therefore, the stego-image quality in proposed method is better than that in GePVO-K method. Theoretical analysis and experiment results show that the proposed method has higher embedding capacity and better stego image quality than GePVO-K method.

Reversible Data Hiding Based on Statistical Correlation of Blocked Sub-Sampled Image

2012 ◽  
Vol 2 (1) ◽  
pp. 42-59
Author(s):  
Mona Nafari ◽  
Mansour Nejati Jahromi ◽  
Gholam Hosein Sheisi
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Statistical Correlation ◽  
Experimental Results ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Stego Image

In this paper, a reversible data hiding scheme has been proposed which is based on correlation of subsample images. The proposed method modifies the blocks of sub-sampled image to prepare vacant positions for data embedding. The PSNR of the stego image produced by the proposed method is guaranteed to be above 47.5 dB, while the embedding capacity is at least, almost 6.5 times higher than that of the Kim et al. techniques with the same PSNR. This technique has the capability to control the capacity-PSNR. Experimental results support that the proposed method exploits the correlation of blocked sub-sampled image outperforms the prior works in terms of larger capacity and stego image quality. On various test images, the authors demonstrate the validity of the proposed method by comparing it with other existing reversible data hiding algorithms.

A data hiding scheme based on single pixel modification with modulus operation

2021 ◽  
pp. 1-13
Author(s):  
Sha Wang ◽  
Teng Li ◽  
Zifeng Liu ◽  
Dongbo Pan ◽  
Yu Zhang
Keyword(s):  
Data Hiding ◽  
Performance Indicators ◽  
Public Information ◽  
Information Protection ◽  
Embedding Capacity ◽  
Practical Application ◽  
Stego Image ◽  
Hiding Capacity ◽  
Modification Method ◽  
Single Pixel

The embedding capacity and steganography quality are two important performance indicators of data hiding which has practical application value for copyright and intellectual property protection, public information protection and online elections. Many researches presented hiding methods to improve the performance. However, the existing data hiding methods have problems such as low embedding capacity or poor stego-image quality. This paper proposes a new method (Single Pixel Modification, SPM) to improve the performance further. The SPM (Single Pixel Modification) method embeds k secret bits into a cover-pixel with the idea that minimizing the change to cover-pixel and adopting modulus operation based on 2 k . The experimental results show that the proposed method has better performance than methods compared and the highest hiding capacity can reach 4 bits per pixel and the average PSNR of stego-images is 34.83 dB. The source code and related materials are made to public to make it easy for researchers to verify the work and stimulate further research.

scholarly journals An Improved Bidirectional Shift-Based Reversible Data Hiding Scheme Using Double-Way Prediction Strategy

2019 ◽  
Vol 2019 ◽  
pp. 1-17
Author(s):  
Lin Li ◽  
Chin-Chen Chang ◽  
Hefeng Chen
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Prediction Errors ◽  
Threshold Values ◽  
Embedding Capacity ◽  
Stego Image ◽  
Original Algorithm ◽  
Prediction Error Expansion ◽  
Prediction Strategy

Reversible data hiding (RDH) is a method that allows a cover image to be completely recovered from its corresponding stego image without distortion after the embedded secret messages have been extracted. Prediction-error expansion (PEE), as a classic RDH scheme, has been studied extensively due to its high quality of stego images. Based on prediction errors, threshold values, and the relative distances between each bin and zero bin, we present a bidirectional shift and double-way prediction strategy to solve the multiple embedding problem. Compared with the original algorithm, this scheme only takes a little more time and reduces the PSNR slightly, but it improves the embedding capacity significantly and allows for reversible data hiding. When both threshold values of TH and TH∗ are equal to 2, the average ER value of 108 test images is 1.2 bpp which is ideal for medium data payload. At the same time, the PSNR is above 30 dB, making embedded information visually imperceptible. These data, together with other experimental results, show that the method proposed in this paper has obvious advantages in image quality and embedding capacity.

scholarly journals Efficient Reversible Data Hiding Scheme for AMBTC-Compressed Images

2021 ◽  
Vol 11 (15) ◽  
pp. 6741
Author(s):  
Chia-Chen Lin ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang ◽  
Wen-Chi Chang
Keyword(s):  
Data Hiding ◽  
Free Space ◽  
Reversible Data Hiding ◽  
Secret Message ◽  
Embedding Capacity ◽  
Absolute Moment ◽  
Compressed Images ◽  
High Embedding Capacity ◽  
Significant Attention ◽  
Efficiency Rate

Reversible data hiding has attracted significant attention from researchers because it can extract an embedded secret message correctly and recover a cover image without distortion. In this paper, a novel, efficient reversible data hiding scheme is proposed for absolute moment block truncation code (AMBTC) compressed images. The proposed scheme is based on the high correlation of neighboring values in two mean tables of AMBTC-compressed images to further losslessly encode these values and create free space for containing a secret message. Experimental results demonstrated that the proposed scheme obtained a high embedding capacity and guaranteed the same PSNRs as the traditional AMBTC algorithm. In addition, the proposed scheme achieved a higher embedding capacity and higher efficiency rate than those of some previous schemes while maintaining an acceptable bit rate.

scholarly journals A Distortion-Free Data Hiding Scheme for Triangular Meshes Based on Recursive Subdivision

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yuan-Yu Tsai
Keyword(s):  
Principal Component Analysis ◽  
Data Hiding ◽  
Similarity Transformation ◽  
Principal Component ◽  
Secret Message ◽  
Subdivision Scheme ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Free Data ◽  
Reversible Data Embedding

This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret message is embedded into the newly added vertices. The topology of added vertex is constructed by connecting it with the vertices of located triangle. For further raising the total embedding capacity, a recursive subdivision mechanism, terminated by a given criterion, is employed. Finally, a principal component analysis can make the stego model against similarity transformation and vertex/triangle reordering attacks. Our proposed algorithm can provide a high and adjustable embedding capacity with reversibility. The experimental results demonstrate the feasibility of our proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document