.png){kind=icon}
.png){kind=icon}
Return
A lossless data hiding scheme based on three-pixel block differences
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2007.09.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a data hiding scheme that losslessly embeds a message into a cover image using the two differences-between the first and the second pixel as well as between the second and the third pixel-in a three-pixel block. In the cover image, an absolute difference between a pair of pixels is selected to embed the message if the number of pixel pairs with the difference in the image is the largest. To embed a bit 1 or 0, the selected difference is increased by I or left unchanged, respectively. In the best case, a three-pixel block can embed two bits 11 and only the central pixel needs to be increased or decreased by 1. The average payload capacity among the test images can be up to 2.08 bits per pixel (bpp). (c) 2007 Elsevier Ltd. All rights reserved.
Keywords:
lossless data hiding
reversible data hiding
block difference
steganography
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.