A data hiding scheme based on the difference of image interpolation algorithms

2022 ◽  
Vol 65 ◽  
pp. 103068
Author(s):  
Xuemei Bai ◽  
Yong Chen ◽  
Gangpeng Duan ◽  
Chao Feng ◽  
Wanli Zhang
Keyword(s):  
Data Hiding ◽  
Image Interpolation ◽  
Interpolation Algorithms ◽  
The Difference

Reversible Data Hiding

2019 ◽  
pp. 116-140
Author(s):  
Mehul S. Raval
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Communication Channel ◽  
Image Authentication ◽  
Original Form ◽  
Additional Advantage ◽  
Use Of Data ◽  
Depth Analysis ◽  
The Difference

The chapter presents an application of reversible data hiding for the authentication of image travelling over a hostile and insecure communication channel. The reversible data resides in the image and tracks any changes done to it on a communication channel. The extraction of data and any modification to its structure reveals changes in the image. This allows the use of data hiding for forensic purpose. The reversible data hiding provides an additional advantage along with active forensics. The image regains original form after removal of the embedded data. However, reversible data hiding is an interplay between the image quality and watermarking capacity. The chapter presents the generic framework for data hiding and discusses its special case reversible data hiding. It presents capacity-behavior analysis of the difference expansion scheme. It performs in-depth analysis on the type of predictor and its impact on the capacity of the reversible data hiding scheme. Finally, the chapter presents a case study to showcase the use of reversible data hiding for image authentication.

scholarly journals An Advanced Reversible Data Hiding Algorithm Using Local Similarity, Curved Surface Characteristics, and Edge Characteristics in Images

2020 ◽  
Vol 10 (3) ◽  
pp. 836 ◽  
Author(s):  
Soo-Mok Jung ◽  
Byung-Won On
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Image Watermarking ◽  
Surface Characteristics ◽  
Cover Image ◽  
Curved Surface ◽  
Local Similarity ◽  
Stego Image ◽  
Confidential Data ◽  
The Difference

In this paper, we proposed methods to accurately predict pixel values by effectively using local similarity, curved surface characteristics, and edge characteristics present in an image. Furthermore, to hide more confidential data in a cover image using the prediction image composed of precisely predicted pixel values, we proposed an effective data hiding technique that applied the prediction image to the conventional reversible data hiding technique. Precise prediction of pixel values greatly increases the frequency at the peak point in the histogram of the difference sequence generated using the cover and prediction images. This considerably increases the amount of confidential data that can be hidden in the cover image. The proposed reversible data hiding algorithm (ARDHA) can hide up to 24.5% more confidential data than the existing algorithm. Moreover, it is not possible to determine the presence of hidden confidential data in stego-images, as they possess excellent visual quality. The confidential data can be extracted from the stego-image without loss, and the original cover image can be restored from the stego-image without distortion. Therefore, the proposed algorithm can be effectively used in digital image watermarking, military, and medical applications.

scholarly journals Data-Hiding Scheme Using Multidirectional Pixel-Value Differencing on Colour Images

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Pyung-Han Kim ◽  
Eun-Jun Yoon ◽  
Kwan-Woo Ryu ◽  
Ki-Hyun Jung
Keyword(s):  
Data Hiding ◽  
Vision System ◽  
Experimental Results ◽  
Human Vision ◽  
Embedding Capacity ◽  
Secret Data ◽  
Colour Image ◽  
Pixel Value ◽  
The Difference ◽  
Pixel Value Differencing

Data hiding is a technique that hides the existence of secret data from malicious attackers. In this paper, we propose a new data-hiding scheme using multidirectional pixel-value differencing, which can embed secret data in two directions or three directions on colour images. The cover colour image is divided into nonoverlapping blocks, and the pixels of each block are decomposed into R, G, and B channels. The pixels of each block perform regrouping, and then the minimum pixel value within each block is selected. The secret data can be embedded into two directions or three directions based on the minimum pixel value by using the difference value for the block. The pixel pairs with the embedded secret data are put separately into two stego images for secret data extraction on receiver sides. In the extraction process, the secret data can be extracted using the difference value of the two stego images. Experimental results show that the proposed scheme has the highest embedding capacity when the secret data are embedded into three directions. Experimental results also show that the proposed scheme has a high embedding capacity while maintaining the degree of distortion that cannot be perceived by human vision system for two directions.

scholarly journals Evaluation of Different Image Interpolation Algorithms

2012 ◽  
Vol 58 (12) ◽  
pp. 6-12 ◽  
Author(s):  
Ankit Prajapati ◽  
Sapan Naik ◽  
Sheetal Mehta
Keyword(s):  
Image Interpolation ◽  
Interpolation Algorithms

Computational foundations of image interpolation algorithms

Ubiquity ◽  
2007 ◽  
Vol 2007 (October) ◽  
pp. 1-17 ◽  
Author(s):  
Tinku Acharya ◽  
Ping-Sing Tsai
Keyword(s):  
Image Interpolation ◽  
Interpolation Algorithms

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.

scholarly journals Reversible Data Hiding for Encrypted Image Based on Arnold Transformation

2018 ◽  
Vol 173 ◽  
pp. 03088
Author(s):  
Dan Wu
Keyword(s):  
Data Hiding ◽  
Information Hiding ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Original Image ◽  
Good Image Quality ◽  
Encrypted Image ◽  
Secret Keys ◽  
The Difference ◽  
Arnold Transformation

A reversible data hiding scheme for encrypted image was proposed based on Arnold transformation. In this scheme, the original image was divided into four sub-images by sampling, the sub-images were scrambled by Arnold transformation using two secret keys, then the scrambled sub-images were reconstituted an encrypted image. Subsequently, additional data was embedded into the encrypted image by modifying the difference between two adjacent pixels. With an encrypted image containing additional data, the receiver can obtain a decrypt image using the decryption key. Meanwhile, with the aid of the decryption key and information hiding key, the receiver can pick the hiding information and recover the original image without any error. Experiment result shows that the proposed scheme can obtain a higher payload with good image quality.

Reversible Data Hiding in Encrypted Images Based on Image Interpolation

2014 ◽  
Vol 6 (3) ◽  
pp. 16-29
Author(s):  
Xiyu Han ◽  
Zhenxing Qian ◽  
Guorui Feng ◽  
Xinpeng Zhang
Keyword(s):  
Image Encryption ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Image Interpolation ◽  
Interpolation Algorithm ◽  
Original Image ◽  
Receiver Side ◽  
Huffman Encoding ◽  
Novel Method ◽  
Encrypted Images

This paper proposes a novel method for data hiding in encrypted image using image interpolation. Before the image encryption, the original image is sampled and an interpolation algorithm is used to calculate an estimation of the original image. Errors between the original image and the estimated image are compressed by Huffman encoding, which are further embedded into the estimated image to generate the redundant room. After image encryption using an encryption key, the secret bits are embedded into the reserved room. On the receiver side, the hidden bits can be extracted and the original content of the image can be perfectly recovered. Compared with the published results, the proposed method provides a larger embedding payload.

Sign in / Sign up

Export Citation Format

Share Document