scholarly journals Efficient Lossless Compression Based Reversible Data Hiding Using Multilayered n-Bit Localization

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Rashid Abbasi ◽  
Lixiang Xu ◽  
Farhan Amin ◽  
Bin Luo
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Lossless Compression ◽  
Cover Image ◽  
Optimum Level ◽  
Embedding Capacity ◽  
Peak Point ◽  
Lower Block ◽  
Block Level

We proposed an innovative reversible data hiding technique that is formulated on histogram shifting by using multilayer localized n-bit truncation image (LBPTI), namely, generated form 8-bit plane by means of efficient lossless compression. After selecting the reference point from the block, the neighbor topmost points are used to attain the data embedding without modifying the peak point; in addition, the key information regarding peak point is not mandatory in extraction end to extract the secret information. In order to make the embedded cover-image similar to the histogram of original cover-image, we exploited the localization with efficient lossless compression on lower block level to increase the embedding capacity while controlling extra bit to expand additional embedding capacity on optimum level besides sustaining the quality of cover-image.

High-Capacity Reversible Data Hiding Using Modified Pixel Value Ordering Approach

2018 ◽  
Vol 27 (11) ◽  
pp. 1850175 ◽  
Author(s):  
Neeraj Kumar Jain ◽  
Singara Singh Kasana
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Visual Quality ◽  
Experimental Results ◽  
Cover Image ◽  
Embedding Capacity ◽  
Signal Process ◽  
Pixel Value

The proposed reversible data hiding technique is the extension of Peng et al.’s technique [F. Peng, X. Li and B. Yang, Improved PVO-based reversible data hiding, Digit. Signal Process. 25 (2014) 255–265]. In this technique, a cover image is segmented into nonoverlapping blocks of equal size. Each block is sorted in ascending order and then differences are calculated on the basis of locations of its largest and second largest pixel values. Negative predicted differences are utilized to create empty spaces which further enhance the embedding capacity of the proposed technique. Also, the already sorted blocks are used to enhance the visual quality of marked images as pixels of these blocks are more correlated than the unsorted pixels of the block. Experimental results show the effectiveness of the proposed technique.

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.

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.

scholarly journals Reversible Data Hiding Scheme in Homomorphic Encrypted Image Based on EC-EG

2019 ◽  
Vol 9 (14) ◽  
pp. 2910 ◽  
Author(s):  
Neng Zhou ◽  
Minqing Zhang ◽  
Han Wang ◽  
Mengmeng Liu ◽  
Yan Ke ◽  
...  
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Cover Image ◽  
Public Key Encryption ◽  
Encrypted Image ◽  
Predictive Error ◽  
Reference Pixel ◽  
Embedding Rate

To combine homomorphic public key encryption with reversible data hiding, a reversible data hiding scheme in homomorphic encrypted image based on EC-EG is proposed. Firstly, the cover image is segmented. The square grid pixel group randomly selected by the image owner has one reference pixel and eight target pixels. The n least significant bits (LSBs) of the reference pixel and all bits of target pixel are self-embedded into other parts of the image by a method of predictive error expansion (PEE). To avoid overflowing when embedding data, the n LSBs of the reference pixel are reset to zero before encryption. Then, the pixel values of the image are encrypted after being encoded onto the points of the elliptic curve. The encrypted reference pixel replaces the encrypted target pixels surrounding it, thereby constructing the mirroring central ciphertext (MCC). In a set of MCC, the data hider embeds the encrypted additional data into the n LSBs of the target pixels by homomorphic addition in ciphertexts, while the reference pixel remains unchanged. The receiver can directly extract additional data by homomorphic subtraction in ciphertexts between the target pixels and the corresponding reference pixel; extract the additional data by subtraction in plaintexts with the directly decrypted image; and restore the cover image without loss. The experimental results show that the proposed scheme has higher security than the similar algorithms, and the average embedding rate of the scheme is 0.25 bpp under the premise of ensuring the quality of the directly decrypted image.

scholarly journals Reversible Data Hiding in Encrypted Color Halftone Images with High Capacity

2019 ◽  
Vol 9 (24) ◽  
pp. 5311 ◽  
Author(s):  
Yu-Xia Sun ◽  
Bin Yan ◽  
Jeng-Shyang Pan ◽  
Hong-Mei Yang ◽  
Na Chen
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Visual Quality ◽  
Cover Image ◽  
Embedding Capacity ◽  
Watermark Embedding ◽  
Continuous Tone ◽  
High Embedding Capacity ◽  
Halftone Images

In recent years, reversible data hiding (RDH) has become a research hotspot in the field of multimedia security that has aroused more and more researchers’ attention. Most of the existing RDH algorithms are aiming at continuous-tone images. For RDH in encrypted halftone images (RDH-EH), the original cover image cannot be recovered losslessly after the watermark is extracted. For some application scenarios such as medical or military images sharing, reversibility is critical. In this paper, a reversible data hiding scheme in encrypted color halftone images (RDH-ECH) is proposed. In the watermark embedding procedure, the cover image is copied into two identical images to increase redundancy. We use wet paper code to embed the watermark into the image blocks. Thus, the receiver only needs to process the image blocks by the check matrices in order to extract the watermarks. To increase embedding capacity, we embed three layers in the embedding procedure and combine the resulting images into one image for convenience of transmission. From the experimental results, it can be concluded that the original image can be restored entirely after the watermarks are extracted. Besides, for marked color halftone images, our algorithm can implement high embedding capacity and moderate visual quality.

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 An effective reversible data hiding algorithm using Huffman coding and pixel value prediction algorithm based on the similarity between adjacent pixel values

2018 ◽  
Vol 7 (3.3) ◽  
pp. 182
Author(s):  
Soo Mok Jung
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Cover Image ◽  
Huffman Coding ◽  
Prediction Algorithm ◽  
Value Prediction ◽  
Adjacent Pixel ◽  
Pixel Value ◽  
Embedded Image

In this paper, an effective reversible data hiding algorithm was proposed to increase the amount of data to be embedded data into cover image. Generally, there is similarity between adjacent pixel values in natural images. In the proposed algorithm, a technique that accurately predicts pixel value using adjacent pixel values was used and Huffman coding algorithm was used to increase the amount of data to be embedded into cover image. The proposed reversible data hiding algorithm increases greatly the amount of data embedded into cover image. Also, the visual quality of the secrete data embedded image is very good. So, it is difficult to know whether secrete data has been embedded into the image. Also, using the proposed algorithm, secrete data can be embedded at various levels. The experimental results show that the proposed reversible data hiding algorithm is superior to APD algorithm. Therefore, the proposed algorithm is very useful for reversible data hiding applications.  

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 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.

scholarly journals A novel two-dimensional reversible data hiding method with high embedding capacity in H.264/advanced video coding

2020 ◽  
Vol 16 (3) ◽  
pp. 155014772091100
Author(s):  
Yi Chen ◽  
Hongxia Wang ◽  
Xiaoxu Tang ◽  
Yong Liu ◽  
Hanzhou Wu ◽  
...  
Keyword(s):  
Video Coding ◽  
Video Compression ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Error Concealment ◽  
Similarity Index ◽  
Two Dimensional ◽  
Embedding Capacity ◽  
High Embedding Capacity ◽  
Advanced Video Coding

Developing the technology of reversible data hiding based on video compression standard, such as H.264/advanced video coding, has attracted increasing attention from researchers. Because it can be applied in some applications, such as error concealment and privacy protection. This has motivated us to propose a novel two-dimensional reversible data hiding method with high embedding capacity in this article. In this method, all selected quantized discrete cosine transform coefficients are first paired two by two. And then, each zero coefficient-pair can embed 3 information bits and the coefficient-pairs only containing one zero coefficient can embed 1 information bit. In addition, only one coefficient of each one of the rest coefficient-pairs needs to be changed for reversibility. Therefore, the proposed two-dimensional reversible data hiding method can obtain high embedding capacity when compared with the related work. Moreover, the proposed method leads to less degradation in terms of peak-signal-to-noise ratio, structural similarity index, and less impact on bit-rate increase.

Sign in / Sign up

Export Citation Format

Share Document