scholarly journals A Location Map Reduced Reversible Data Hiding Method Using Prediction Error Modification

2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Experimental Results ◽  
Cover Image ◽  
Prediction Errors ◽  
Secret Data ◽  
Location Map ◽  
Comparable Image Quality

We propose a reversible data hiding technique to improve Hong and Chen’s (2010) method. Hong and Chen divide the cover image into pixel group, and use reference pixels to predict other pixel values. Data are then embedded by modifying the prediction errors. However, when solving the overflow and underflow problems, they employ a location map to record the position of saturated pixels, and these pixels will not be used to carry data. In their method, if the image has a plenty of saturated pixels, the payload is decreased significantly because a lot of saturated pixels will not joint the embedment. We improve Hong and Chen’s method such that the saturated pixels can be used to carry data. The positions of these saturated pixels are then recorded in a location map, and the location map is embedded together with the secret data. The experimental results illustrate that the proposed method has better payload, will providing a comparable image quality.

An Efficient Reversible Data Hiding Scheme for Encrypted Images

2018 ◽  
Vol 10 (2) ◽  
pp. 1-22 ◽  
Author(s):  
Kai Chen ◽  
Dawen Xu
Keyword(s):  
Data Hiding ◽  
Efficient Method ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Emerging Technology ◽  
Experimental Results ◽  
Cover Image ◽  
Original Image ◽  
Secret Data ◽  
Encrypted Images

Reversible data hiding in the encrypted domain is an emerging technology, as it can preserve the confidentiality. In this article, an efficient method of reversible data hiding in encrypted images is proposed. The cover image is first partitioned into non-overlapping blocks. A specific modulo addition operation and block-scrambling operation are applied to obtain the encrypted image. The data-hider, who does not know the original image content, may reversibly embed secret data based on the homomorphic property of the cryptosystem. A scale factor is utilized for selecting embedding zone, which is scalable for different capacity requirements. At the receiving end, the additional data can be extracted if the receiver has the data-hiding key only. If the receiver has the encryption key only, he/she can recover the original image approximately. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and recover the original content without any error. Experimental results demonstrate the feasibility and efficiency of the proposed scheme.

scholarly journals Reversible Data Hiding in Encrypted Images Using Median Edge Detector and Two’s Complement

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 921
Author(s):  
Rui Wang ◽  
Guohua Wu ◽  
Qiuhua Wang ◽  
Lifeng Yuan ◽  
Zhen Zhang ◽  
...  
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Personal Information ◽  
Rapid Development ◽  
Prediction Method ◽  
Prediction Errors ◽  
Edge Detector ◽  
Secret Data ◽  
Encrypted Images ◽  
Cloud Servers

With the rapid development of cloud storage, an increasing number of users store their images in the cloud. These images contain many business secrets or personal information, such as engineering design drawings and commercial contracts. Thus, users encrypt images before they are uploaded. However, cloud servers have to hide secret data in encrypted images to enable the retrieval and verification of massive encrypted images. To ensure that both the secret data and the original images can be extracted and recovered losslessly, researchers have proposed a method that is known as reversible data hiding in encrypted images (RDHEI). In this paper, a new RDHEI method using median edge detector (MED) and two’s complement is proposed. The MED prediction method is used to generate the predicted values of the original pixels and calculate the prediction errors. The adaptive-length two’s complement is used to encode the most prediction errors. To reserve room, the two’s complement is labeled in the pixels. To record the unlabeled pixels, a label map is generated and embedded into the image. After the image has been encrypted, it can be embedded with the data. The experimental results indicate that the proposed method can reach an average embedding rate of 2.58 bpp, 3.04 bpp, and 2.94 bpp on the three datasets, i.e., UCID, BOSSbase, BOWS-2, which outperforms the previous work.

scholarly journals An Improved Reversible Image Transformation Using K-Means Clustering and Block Patching

Information ◽  
2019 ◽  
Vol 10 (1) ◽  
pp. 17 ◽  
Author(s):  
Haidong Zhong ◽  
Xianyi Chen ◽  
Qinglong Tian
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Privacy Protection ◽  
Reversible Data Hiding ◽  
Auxiliary Information ◽  
Experimental Results ◽  
Image Transformation ◽  
Clustering Method ◽  
Stego Image ◽  
Encrypted Images

Recently, reversible image transformation (RIT) technology has attracted considerable attention because it is able not only to generate stego-images that look similar to target images of the same size, but also to recover the secret image losslessly. Therefore, it is very useful in image privacy protection and reversible data hiding in encrypted images. However, the amount of accessorial information, for recording the transformation parameters, is very large in the traditional RIT method, which results in an abrupt degradation of the stego-image quality. In this paper, an improved RIT method for reducing the auxiliary information is proposed. Firstly, we divide secret and target images into non-overlapping blocks, and classify these blocks into K classes by using the K-means clustering method. Secondly, we match blocks in the last (K-T)-classes using the traditional RIT method for a threshold T, in which the secret and target blocks are paired with the same compound index. Thirdly, the accessorial information (AI) produced by the matching can be represented as a secret segment, and the secret segment can be hided by patching blocks in the first T-classes. Experimental results show that the proposed strategy can reduce the AI and improve the stego-image quality effectively.

scholarly journals Reversible data hiding scheme based on pixel-value differencing in dual images

2020 ◽  
Vol 16 (7) ◽  
pp. 155014772091100
Author(s):  
Pyung-Han Kim ◽  
Kwan-Woo Ryu ◽  
Ki-Hyun Jung
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Data Extraction ◽  
Cover Image ◽  
Maximum Difference ◽  
Secret Data ◽  
Pixel Value ◽  
The Difference ◽  
Pixel Value Differencing ◽  
Dual Images

In this article, a new reversible data hiding scheme using pixel-value differencing in dual images is proposed. The proposed pixel-value differencing method can embed more secret data as the difference value of adjacent pixels is increased. In the proposed scheme, the cover image is divided into non-overlapping blocks and the maximum difference value is calculated to hide secret bits. On the sender side, the length of embeddable secret data is calculated by using the maximum difference value and the log function, and the decimal secret data are embedded into the two stego-images after applying the ceil function and floor function. On the receiver side, the secret data extraction and the cover image restoration can be performed by using the correlation between two stego-images. After recovering the cover image from two stego-images, the secret data can be extracted using the maximum difference value and the log function. The experimental results show that the proposed scheme has a higher embedding capacity and the proposed scheme differs in embedding the secret data depending on the characteristics of the cover image with less distortion. Also, the proposed scheme maintains the degree of image distortion that cannot be perceived by the human visual system.

A reversible data hiding in encrypted image based on prediction-error estimation and location map

2020 ◽  
Vol 79 (17-18) ◽  
pp. 11591-11614 ◽  
Author(s):  
Asad Malik ◽  
Hong-Xia Wang ◽  
Yanli Chen ◽  
Ahmad Neyaz Khan
Keyword(s):  
Error Estimation ◽  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Encrypted Image ◽  
Location Map

scholarly journals Implementation of Block-Based Hierarchical Prediction for Developing an Error-Propagation-Free Reversible Data Hiding Scheme

Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1146 ◽  
Author(s):  
Hu ◽  
Lo ◽  
Wu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Error Propagation ◽  
Prediction Errors ◽  
Secret Data ◽  
Image Block ◽  
Hiding Capacity ◽  
Block Based ◽  
Prediction Mechanism ◽  
Embedded Image

This paper proposes a reversible data hiding technique based on the residual histogram shifting technique. To improve the hiding capacity, this study proposes a multiple-round hierarchical prediction mechanism that generates the prediction errors of each image block. The prediction errors of each block are collected to produce the residual histogram and the secret data are then embedded into the residual histogram to obtain the embedded image. Experimental results demonstrate that the proposed technique not only provides good hiding capacity, but also maintains good image quality of the embedded image. In addition, this technique can be easily extended for image integrity protection as it is capable of resisting error propagation.

Reversible data hiding method based on pixel expansion and homomorphic encryption

2020 ◽  
Vol 39 (3) ◽  
pp. 2977-2990
Author(s):  
R. Anushiadevi ◽  
Padmapriya Praveenkumar ◽  
John Bosco Balaguru Rayappan ◽  
Rengarajan Amirtharajan
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Homomorphic Encryption ◽  
Secret Message ◽  
Pixel Expansion ◽  
Stego Image ◽  
Encrypted Image ◽  
Location Map

Digital image steganography algorithms usually suffer from a lossy restoration of the cover content after extraction of a secret message. When a cover object and confidential information are both utilised, the reversible property of the cover is inevitable. With this objective, several reversible data hiding (RDH) algorithms are available in the literature. Conversely, because both are diametrically related parameters, existing RDH algorithms focus on either a good embedding capacity (EC) or better stego-image quality. In this paper, a pixel expansion reversible data hiding (PE-RDH) method with a high EC and good stego-image quality are proposed. The proposed PE-RDH method was based on three typical RDH schemes, namely difference expansion, histogram shifting, and pixel value ordering. The PE-RDH method has an average EC of 0.75 bpp, with an average peak signal-to-noise ratio (PSNR) of 30.89 dB. It offers 100% recovery of the original image and confidential hidden messages. To protect secret as well as cover the proposed PE-RDH is also implemented on the encrypted image by using homomorphic encryption. The strength of the proposed method on the encrypted image was verified based on a comparison with several existing methods, and the approach achieved better results than these methods in terms of its EC, location map size and imperceptibility of directly decrypted images.

A novel data hiding and reversible scheme using SMN blocks in VQ-compressed images

2011 ◽  
Vol 19 (2) ◽  
Author(s):  
C. Huang ◽  
W. Wang ◽  
S. Wang
Keyword(s):  
Vector Quantization ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Multimedia Security ◽  
Experimental Results ◽  
Compression Rate ◽  
Secret Data ◽  
Compressed Images ◽  
Reversible Method ◽  
The Relationship

AbstractData hiding is a technique for embedding secret data into cover media. It is important to multimedia security and has been widely studied. Reversible data hiding methods are becoming prevalent in the area because they can reconstruct the original cover image while extracting the embedded data. In this paper, we propose a new reversible method for vector quantization (VQ) compressed images. Our method takes advantages of the relationship among the side match neighbouring (SMN) blocks to achieve reversibility. The experimental results show that the proposed method has higher compression rate and larger capacity than other existing reversible methods.

Block-Based Reversible Data Hiding Using Histogram Shifting and Modulus Operator for Digital Images

2017 ◽  
Vol 26 (06) ◽  
pp. 1750103 ◽  
Author(s):  
Pankaj Garg ◽  
Singara Singh Kasana ◽  
Geeta Kasana
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Cover Image ◽  
Histogram Shifting ◽  
Embedding Capacity ◽  
Signal To Noise ◽  
Secret Data ◽  
Peak Points ◽  
Block Based

A Reversible Data Hiding technique by using histogram shifting and modulus operator is proposed in which secret data is embedded into blocks of the cover image. These blocks are modified by using modulus operator to increase the number of peak points in the histogram of the cover image which further increases its embedding capacity. Secret data is embedded in the original cover blocks of the cover image by using peak points of the predicted blocks, which are generated by using modulus operator. Peak Signal to Noise Ratio and PSNR-Human Visual System are used to show the human visual acceptance of the proposed technique. Experimental results show that the embedding capacity is high as compared to the capacity of existing RDH techniques, while distortion in marked images is also less as compared to distortion produced by these existing techniques.

Sign in / Sign up

Export Citation Format

Share Document