Run length based steganography for binary images

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Author supplied keywords

Cite

CITATION STYLE

APA

Agaian, S. S., & Cherukuri, R. C. (2005). Run length based steganography for binary images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3776 LNCS, pp. 481–484). https://doi.org/10.1007/11590316_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free