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).
[1] A. Tacticus, How to survive under siege / Aineias the Tactician, pp. 84-
90, 183-193. Clarendon ancient history series,Oxford, England:
Clarendon Press, 1990, ISBN 0-19-814744-9,translated with
introduction and commentary by David Whitehead.
[2] J. Wilkins, Mercury: or the secret and swift messenger: showing, how a
man may with privacy and speed communicate his thoughts to a friend at
any distance. London: printed for Rich Baldwin, near the Oxford-Arms
in Warnick-lane, 2nd edn.,1994, copy of Sir Geofirey Keynes, courtesy
of the Rare Book Section, Cambridge University Library, (IX pp. 67).
[3] D. Chaum, 'Untraceable electronic mail, return addresses and digital
pseudonyms." Communications of the A.C.M., vol. 24, no. 2, pp. 84-88,
Feb. 1981.
[4] The Oxford English dictionary: being a corrected re-issue." Clarendon
Press, Oxford, 2005.
[5] B. Pfitzmann, 'Information hiding terminology." In Anderson, pp. 347-
350, ISBN 3-540-61996-8, results of an informal plenary meeting and
additional proposals.
[6] Kahn, D., The Codebreakers, MacMillan Company, 1967.
[7] G. J. Simmons, 'The prisoners' problem and the subliminal channel." In
Chaum (20), pp. 51-67.
[8] 'The history of subliminal channels." IEEE Journal of Selected Areas in
Communications, vol. 16, no. 4, pp. 452-462,May 1998, ISSN 0733-
8716, special issue on copyright & privacy protection.
[9] G. J. Simmons, ed., Contemporary Cryptology - The Science of
Information Integrity. New York, New York, U.S.A.: IEEE Press, 1992.
[10] "Results concerning the bandwidth of subliminal channels."IEEE
Journal of Selected Areas in Communications, vol. 16, no. 4, pp. 463-
473, May 1998, ISSN 0733-8716, special issue on copyright & privacy
protection.
[11] R. J. Anderson and F. A. P. Petitcolas, "On the limits of
steganography."IEEE Journal of Selected Areas in Communications, vol.
16, no. 4, pp. 474-481, May 1998, ISSN 0733-8716, special issue on
copyright & privacy protection.
[12] S. Craver, On public-key steganography in the presence of an active
warden." Tech. Rep. RC20931, I.B.M. Research Division,T.J. Watson
Research Center, Yorktown Heights, New York,U.S.A., Jul. 1997.
[13] J. Fridrich and M. Goljan, "Digital image steganography using stochastic
modulation", SPIE Symposium on Electronic Imaging, San Jose, CA,
2003.
[14] M.Kharrazi, Husrev T. Sencar, and N.Memon, "Image Steganography",
Concepts and Practice. April 2004
[15] A. Westfeld,"F5a steganographic algorithm: High capacity despite better
steganalysis," 4th International Workshop on Information Hiding. 2001.
[16] Yedidya Hilewitz and Ruby B. Lee, Fast Bit Compression and
Expansion with Parallel Extract and Parallel Deposit Instructions,
Proceedings of the IEEE 17th International Conference on Application-
Specific Systems, Architectures and Processors (ASAP), pp. 65-72,
September 11-13,2006
[17] The Mathworks, Inc., Image Processing Toolbox User-s Guide:
http://www.mathworks.com/access/helpdesk/help/toolbox/images/image
s.html.
[18] Otsu, N., "A Threshold Selection Method from Gray-Level Histograms,"
IEEE Transactions on Systems, Man, and Cybernetics, Vol. 9, No. 1,
1979, pp. 62-66.
[19] Haralick, Robert M., and Linda G. Shapiro, Computer and Robot Vision,
Volume I, Addison-Wesley, 1992, pp.28-48.
[20] D. Chaum, ed., Workshop on Communications Security
(CRYPTO'83),Santa Barbara, California, U.S.A., 1984, IEEE, Plenum
Press.
[1] A. Tacticus, How to survive under siege / Aineias the Tactician, pp. 84-
90, 183-193. Clarendon ancient history series,Oxford, England:
Clarendon Press, 1990, ISBN 0-19-814744-9,translated with
introduction and commentary by David Whitehead.
[2] J. Wilkins, Mercury: or the secret and swift messenger: showing, how a
man may with privacy and speed communicate his thoughts to a friend at
any distance. London: printed for Rich Baldwin, near the Oxford-Arms
in Warnick-lane, 2nd edn.,1994, copy of Sir Geofirey Keynes, courtesy
of the Rare Book Section, Cambridge University Library, (IX pp. 67).
[3] D. Chaum, 'Untraceable electronic mail, return addresses and digital
pseudonyms." Communications of the A.C.M., vol. 24, no. 2, pp. 84-88,
Feb. 1981.
[4] The Oxford English dictionary: being a corrected re-issue." Clarendon
Press, Oxford, 2005.
[5] B. Pfitzmann, 'Information hiding terminology." In Anderson, pp. 347-
350, ISBN 3-540-61996-8, results of an informal plenary meeting and
additional proposals.
[6] Kahn, D., The Codebreakers, MacMillan Company, 1967.
[7] G. J. Simmons, 'The prisoners' problem and the subliminal channel." In
Chaum (20), pp. 51-67.
[8] 'The history of subliminal channels." IEEE Journal of Selected Areas in
Communications, vol. 16, no. 4, pp. 452-462,May 1998, ISSN 0733-
8716, special issue on copyright & privacy protection.
[9] G. J. Simmons, ed., Contemporary Cryptology - The Science of
Information Integrity. New York, New York, U.S.A.: IEEE Press, 1992.
[10] "Results concerning the bandwidth of subliminal channels."IEEE
Journal of Selected Areas in Communications, vol. 16, no. 4, pp. 463-
473, May 1998, ISSN 0733-8716, special issue on copyright & privacy
protection.
[11] R. J. Anderson and F. A. P. Petitcolas, "On the limits of
steganography."IEEE Journal of Selected Areas in Communications, vol.
16, no. 4, pp. 474-481, May 1998, ISSN 0733-8716, special issue on
copyright & privacy protection.
[12] S. Craver, On public-key steganography in the presence of an active
warden." Tech. Rep. RC20931, I.B.M. Research Division,T.J. Watson
Research Center, Yorktown Heights, New York,U.S.A., Jul. 1997.
[13] J. Fridrich and M. Goljan, "Digital image steganography using stochastic
modulation", SPIE Symposium on Electronic Imaging, San Jose, CA,
2003.
[14] M.Kharrazi, Husrev T. Sencar, and N.Memon, "Image Steganography",
Concepts and Practice. April 2004
[15] A. Westfeld,"F5a steganographic algorithm: High capacity despite better
steganalysis," 4th International Workshop on Information Hiding. 2001.
[16] Yedidya Hilewitz and Ruby B. Lee, Fast Bit Compression and
Expansion with Parallel Extract and Parallel Deposit Instructions,
Proceedings of the IEEE 17th International Conference on Application-
Specific Systems, Architectures and Processors (ASAP), pp. 65-72,
September 11-13,2006
[17] The Mathworks, Inc., Image Processing Toolbox User-s Guide:
http://www.mathworks.com/access/helpdesk/help/toolbox/images/image
s.html.
[18] Otsu, N., "A Threshold Selection Method from Gray-Level Histograms,"
IEEE Transactions on Systems, Man, and Cybernetics, Vol. 9, No. 1,
1979, pp. 62-66.
[19] Haralick, Robert M., and Linda G. Shapiro, Computer and Robot Vision,
Volume I, Addison-Wesley, 1992, pp.28-48.
[20] D. Chaum, ed., Workshop on Communications Security
(CRYPTO'83),Santa Barbara, California, U.S.A., 1984, IEEE, Plenum
Press.
@article{"International Journal of Information, Control and Computer Sciences:55455", author = "H. Motameni and M. Norouzi and M. Jahandar and A. Hatami", title = "Labeling Method in Steganography", abstract = "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.", volume = "1", number = "6", pages = "1641-6", }
