A novel data hiding by image interpolation using edge quad-tree block complexity

Author(s):  
R. RoselinKiruba ◽  
T. Sree Sharmila
2014 ◽  
Vol 6 (3) ◽  
pp. 16-29
Author(s):  
Xiyu Han ◽  
Zhenxing Qian ◽  
Guorui Feng ◽  
Xinpeng Zhang

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.


2016 ◽  
Vol 8 (2) ◽  
pp. 48-61 ◽  
Author(s):  
Yuan-Yu Tsai ◽  
Yao-Hsien Huang ◽  
Ruo-Jhu Lin ◽  
Chi-Shiang Chan

Data hiding can be regarded as a type of image processing techniques. Other image processing operations are usually integrated to increase the embedding capacity or decrease the visual distortion. Interpolation is an example of this type of operation. However, previous interpolation-based data hiding algorithms suffered from low and fixed embedding capacity and high visual distortion. This study proposes a more effective two-stage data hiding algorithm based on interpolation, LSB substitution, and histogram shifting. First, the authors modify the formula for embedding capacity calculation and make some adjustments on the sample pixels determination. A threshold is used to obtain the block complexity and each embeddable pixel has a different amount of message embedded. Second, an LSB substitution method and an optimal pixel adjustment process are adopted to raise the image quality. Finally, the authors' proposed algorithm can support adjustable embedding capacity. Compared to the previous algorithm, the experimental results demonstrate the feasibility of the proposed method.


2018 ◽  
Vol 78 (6) ◽  
pp. 7181-7205 ◽  
Author(s):  
Ahmad A. Mohammad ◽  
Ali Al-Haj ◽  
Mahmoud Farfoura

2009 ◽  
Vol 31 (2) ◽  
pp. 465-470 ◽  
Author(s):  
Ki-Hyun Jung ◽  
Kee-Young Yoo

2017 ◽  
Vol 50 ◽  
pp. 209-215 ◽  
Author(s):  
Chin-Nung Yang ◽  
Shen-Chieh Hsu ◽  
Cheonshik Kim

Sign in / Sign up

Export Citation Format

Share Document