Issue No.07 - July (2002 vol.51)
pp: 873-880
<p>In an earlier paper, we proposed a steganography scheme for hiding a piece of critical information in a host binary image. That scheme ensures that, in each m \times n image block of the host image, as many as \lfloor \log_2 (mn+ 1) \rfloor bits can be hidden in the block by changing at most 2 bits in the block. In this paper, we propose a new scheme that improves in its capability to maintain higher quality of the host image after data hiding by sacrificing some data hiding space. The new scheme can still offer a good data hiding ratio. It ensures that, for any bit that is modified in the host image, the bit is adjacent to another bit which has a value equal to the former's new value. Thus, the hiding effect is quite invisible.</p>
Binary image processing, coding, cryptography, information hiding, prisoners' problem, security, steganography.
Yu-Chee Tseng, Hsiang-Kuang Pan, "Data Hiding in 2-Color Images", IEEE Transactions on Computers, vol.51, no. 7, pp. 873-880, July 2002, doi:10.1109/TC.2002.1017706