scholarly journals A New Reference Pixel Prediction for Reversible Data Hiding with Reduced Location Map

2014 ◽  
Vol 8 (3) ◽  
pp. 1105-1118
2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong

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.


Author(s):  
Akira Nishimura

Reversible data hiding is a technique whereby hidden data are embedded in host data in such a way that the host data consistency is perfectly preserved and the host data are restored when extracting the hidden data. This chapter introduces basic algorithms for reversible data hiding, histogram shifting, histogram expansion, and compression. This chapter also proposes and evaluates two reversible data hiding methods, i.e., hiding data in the frequency-domain using integer Discrete Cosine Transform (DCT) and modified DCT and hiding in the time domain using linear prediction and error expansion. As no location map is required to prevent amplitude overflow, the proposed method in the time domain achieves a storage capacity of nearly 1 bit per sample of payload data. The proposed methods are evaluated by the payload amount, objective quality degradation of stego signal, and payload concealment.


2020 ◽  
Vol 79 (17-18) ◽  
pp. 11591-11614 ◽  
Author(s):  
Asad Malik ◽  
Hong-Xia Wang ◽  
Yanli Chen ◽  
Ahmad Neyaz Khan

2020 ◽  
Vol 39 (3) ◽  
pp. 2977-2990
Author(s):  
R. Anushiadevi ◽  
Padmapriya Praveenkumar ◽  
John Bosco Balaguru Rayappan ◽  
Rengarajan Amirtharajan

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.


Sign in / Sign up

Export Citation Format

Share Document