Lossless Data Hiding Scheme Based on Adjacent Pixel Difference

This paper proposes a lossless data hiding scheme with high embedding capacity, which can recover the original image without any distortion after the hidden data have been extracted. In this scheme, difference value of the adjacent pixels is calculated first. After adjusting the difference slightly,...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Computer Engineering and Technology Vol. 1; pp. 588 - 592
Main Authors Zhuo Li, Xiaoping Chen, Xuezeng Pan, Xianting Zeng
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2009
Subjects
Authentication
Data encapsulation
data hiding
Data mining
Histograms
Image coding
lossless
Payloads
Pixel
pixel difference
PSNR
Space technology
Steganography
Online AccessGet full text

Cover

More Information
Summary:This paper proposes a lossless data hiding scheme with high embedding capacity, which can recover the original image without any distortion after the hidden data have been extracted. In this scheme, difference value of the adjacent pixels is calculated first. After adjusting the difference slightly, we can increase (decrease) it by 1 or maintain it intact to embed information into the cover image. Experimental results show that the average embedding capacity can be up to 0.91 bpp (bit per pixel) while the PSNR stays larger than 30 dB. Compared with some existing known lossless data hiding schemes, the proposed method provides higher embedding capacity and lower image degradation. Moreover, the presented algorithm is quite simple and the execution time is rather short.
ISBN:1424433347
9781424433346
9780769535210
0769535216
DOI:10.1109/ICCET.2009.40