Optimizing Non-Local Pixel Predictors for Reversible Data Hiding

2014 ◽  
Vol 6 (3) ◽  
pp. 1-15
Author(s):  
Xiaocheng Hu ◽  
Weiming Zhang ◽  
Nenghai Yu

This paper presents a two-step clustering and optimizing pixel prediction method for reversible data hiding, which exploits self-similarities and group structural information of non-local image patches. Pixel predictors play an important role for current prediction-error expansion (PEE) based reversible data hiding schemes. Instead of using a fixed or a content- adaptive predictor for each pixel independently, the authors first employ pixel clustering according to the structural similarities of image patches, and then for all the pixels assigned to each cluster, an optimized pixel predictor is estimated from the group context. Experimental results demonstrate that the proposed method outperforms state-of-art counterparts such as the simple rhombus neighborhood, the median edge detector, and the gradient-adjusted predictor et al.

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 921
Author(s):  
Rui Wang ◽  
Guohua Wu ◽  
Qiuhua Wang ◽  
Lifeng Yuan ◽  
Zhen Zhang ◽  
...  

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.


Author(s):  
Fuqiang Di ◽  
Minqing Zhang ◽  
Yingnan Zhang ◽  
Jia Liu

A novel reversible data hiding algorithm for encrypted image based on interpolation error expansion is proposed. The proposed method is an improved version of Shiu' s. His work does not make full use of the correlation of the neighbor pixels and some additional side information is needed. The proposed method adopts the interpolation prediction method to fully exploit the pixel correlation and employ the Paillier public key encryption method. The algorithm is reversible. In the proposed method, less side information is demanded. The experiment has verified the feasibility and effectiveness of the proposed method, and the better embedding performance can be obtained, compared with some existing RDHEI-P methods. Specifically, the final embedding capacity can be up to 0.74 bpp (bit per pixel), while the peak signal-to-noise ratio (PSNR) for the marked image Lena is 35 dB. This is significantly higher than Shiu's method which is about 0.5 bpp.


Electronics ◽  
2019 ◽  
Vol 8 (5) ◽  
pp. 514 ◽  
Author(s):  
Jin Young Lee ◽  
Cheonshik Kim ◽  
Ching-Nung Yang

With the advent of 3D video compression and Internet technology, 3D videos have been deployed worldwide. Data hiding is a part of watermarking technologies and has many capabilities. In this paper, we use 3D video as a cover medium for secret communication using a reversible data hiding (RDH) technology. RDH is advantageous, because the cover image can be completely recovered after extraction of the hidden data. Recently, Chung et al. introduced RDH for depth map using prediction-error expansion (PEE) and rhombus prediction for marking of 3D videos. The performance of Chung et al.’s method is efficient, but they did not find the way for developing pixel resources to maximize data capacity. In this paper, we will improve the performance of embedding capacity using PEE, inter-component prediction, and allowable pixel ranges. Inter-component prediction utilizes a strong correlation between the texture image and the depth map in MVD. Moreover, our proposed scheme provides an ability to control the quality of depth map by a simple formula. Experimental results demonstrate that the proposed method is more efficient than the existing RDH methods in terms of capacity.


Sign in / Sign up

Export Citation Format

Share Document