Labeling Method in Steganography

In this paper a way of hiding text message (Steganography) in the gray image has been presented. In this method tried to find binary value of each character of text message and then in the next stage, tried to find dark places of gray image (black) by converting the original image to binary image for labeling each object of image by considering on 8 connectivity. Then these images have been converted to RGB image in order to find dark places. Because in this way each sequence of gray color turns into RGB color and dark level of grey image is found by this way if the Gary image is very light the histogram must be changed manually to find just dark places. In the final stage each 8 pixels of dark places has been considered as a byte and binary value of each character has been put in low bit of each byte that was created manually by dark places pixels for increasing security of the main way of steganography (LSB). Keywords—Binary image, labeling, low bit, neighborhood, RGB image, steganography, threshold.

[1]  Linda G. Shapiro,et al.  Computer and Robot Vision (Volume II) , 2002 .

[2]  Birgit Pfitzmann,et al.  Information Hiding Terminology - Results of an Informal Plenary Meeting and Additional Proposals , 1996, Information Hiding.

[3]  James Augustus Henry Sir Murray.  The Oxford English dictionary : being a corrected re-issue with an introduction, supplement, and bibliography of a New English dictionary on historical principles , 1933 .

[4]  David Whitehead,et al.  How to survive under siege , 1990 .

[5]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[6]  Linda G. Shapiro,et al.  Computer and Robot Vision , 1991 .

[7]  Gustavus J. Simmons,et al.  The history of subliminal channels , 1996, IEEE J. Sel. Areas Commun..

[8]  Scott Craver,et al.  On Public-Key Steganography in the Presence of an Active Warden , 1998, Information Hiding.

[9]  J. Wilkins.  Mercury or The Secret and Swift Messenger , 1984 .

[10]  Gustavus J. Simmons,et al.  The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.

[11]  Ross J. Anderson,et al.  On the limits of steganography , 1998, IEEE J. Sel. Areas Commun..

[12]  Jessica J. Fridrich,et al.  Digital image steganography using stochastic modulation , 2003, IS&T/SPIE Electronic Imaging.

[13]  Andreas Westfeld,et al.  F5-A Steganographic Algorithm , 2001, Information Hiding.

[14]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[15]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[16]  Andreas Westfeld,et al.  F5—A Steganographic Algorithm High Capacity Despite Better Steganalysis , 2001 .

[17]  Ruby B. Lee,et al.  Fast Bit Compression and Expansion with Parallel Extract and Parallel Deposit Instructions , 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

[18]  Gustavus J. Simmons,et al.  Results concerning the bandwidth of subliminal channels , 1998, IEEE J. Sel. Areas Commun..