Run Length Based Steganography for Binary Images
Binary images (like cartoons, text documents, signatures captured by signing pads and/or 2-color imagery) are very commonly used in our daily life. Changing the pixel values in these images for hiding the data, may produce a noticeable change in the cover media. The primary problem is the capacity of the embedding technique and preserving the visible artifacts of the cover image even after embedding the secured data. In this paper, we present a run length based steganography algorithm for embedding the secured data into binary images. The proposed algorithm alters pixels of the embeddable blocks of cover image depending on there run length characteristics and chactersitics values of the block. In addition, the new algorithm is based on variable embedding rate for each block, which enhances the security of embedded data and the capacity of the embedding method. We test the performance of the algorithm over 50 various sizes of binary cover images embedding various sizes of secured data. Comparisons with existing algorithms will be presented.
Keyword: Run length, steganography, binary image.
- 1.Hwang, K.F., Chang, C.C.: A Run Length Mechanism for Hiding Data into Binary Images. In: Proceedings of pacific rim workshop on digital steganography 2002, pp. 71–74 (2002)Google Scholar
- 3.Pan, H.K., Chen, Y.Y., Tseng, Y.C.: A Secure Data Hiding Scheme for Two-Color Images. In: Proceedings of 5th IEEE Symposium on computers and communication, pp. 750–755 (2000)Google Scholar
- 4.Tseng, Y.-C., Pan, H.-K.: Secure and invisible data hiding in 2-color images. In: Proceedings of 20 th IEEE Computer and Communications Societies, INFOCOM 2001, vol. 2, pp. 887–896 (2001)Google Scholar
- 5.Chen, J., Chen, T.S., Cheng, M.W.: A New Data Hiding Method in Binary Image. In: Proceedings of 5th IEEE international symposium on multimedia software engineering 2003 (2003)Google Scholar