Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

Optimum Pixel & Bit location for Colour Image Stego- A Distortion Resistant Approach

Print
PDF
International Journal of Computer Applications
© 2010 by IJCA Journal
Number 7 - Article 4
Year of Publication: 2010
Authors:
Rengarajan
Aishwarya G
Madhumita Rameshbabu
John Bosco Balaguru Rayappan
10.5120/1494-2011

Rengarajan Amirtharajan, Aishwarya G, Madhumita Rameshbabu and John Bosco Balaguru Rayappan. Article:Optimum Pixel & Bit location for Colour Image Stego- A Distortion Resistant Approach. International Journal of Computer Applications 10(7):17–24, November 2010. Published By Foundation of Computer Science. BibTeX

@article{key:article,
	author = {Rengarajan Amirtharajan and Aishwarya G and Madhumita Rameshbabu and John Bosco Balaguru Rayappan},
	title = {Article:Optimum Pixel & Bit location for Colour Image Stego- A Distortion Resistant Approach},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {10},
	number = {7},
	pages = {17--24},
	month = {November},
	note = {Published By Foundation of Computer Science}
}

Abstract

A conventional Secret key Steganography scheme focuses mainly to reduce the distortion when secret information is embedded into the cover image. On the other hand, the transmitted images may be compressed or faces transmitting errors. If such errors occur, the receiver cannot extract the correct information from the stego-image. Furthermore the three main attributes of steganography are capacity, invisibility and Robustness. In the previous models [3, 4] we mainly concentrated on capacity and invisibility but in this method equal importance will be given to robustness. To increase the stochasticity of information hiding we use pixel indicator techniques which are implemented using three methods. Among these the first method enjoins that red channel steers the other two channels and the second method gives us the liberty to select the steering channel which successively increases the robustness of the shrouded message but its limits when MSE is considered. In third method, the steering channel is selected in a cyclic mode which enhances further the capacity along with security of the shrouded message as the MSE gets equally distributed. To increase the robustness here we introduce a factor E which gives us an option to select the position to plant the message to be concealed. The factor E addresses the bit where the embedding can be started. Once an image is compressed the LSBs of the covered media will get affected which defiles the concealed message. The essence of this method rests in the withstanding capability of the carrier media as the factor E is altered. As the value of E increases the MSE gets stepped up and hence the imperceptibility of the carrier image gets diluted. This can be heightened by using Optimal Pixel Adjustment Process (OPAP).

Reference

  • Abbas Cheddad, Joan Condell, Kevin Curran, Paul Mc Kevitt, Digital image steganography: Survey and analysis of current methods Signal Processing 90 (2010) 727–752.
  • Adnan Gutub, Mahmoud Ankeer, Muhammad Abu-Ghalioun, Abdulrahman Shaheen, and Aleem Alvi, “Pixel Indicator high capacity Technique for RGB image Based Steganography”, WoSPA 2008 – 5th IEEE International Workshop on Signal Processing and its Applications, University of Sharjah, Sharjah, U.A.E. 18 – 20 March 2008
  • R.Amirtharajan, Adharsh.D, Vignesh.V and R.John Bosco Balaguru, “PVD Blend with Pixel Indicator - OPAP Composite for High Fidelity Steganography” IJCA October edition 2010.
  • R.Amirtharajan, Sandeep Kumar Behera, Motamarri Abhilash Swarup, Mohamed Ashfaaq K and John Bosco Balaguru Rayappan, “ Colour Guided Colour Image Steganography” Universal Journal of Computer Science and Engineering Technology 1 (1) (2010), 16-23.
  • R.Amirtharajan and Dr. R. John Bosco Balaguru, “Tri-Layer Stego for Enhanced Security – A Keyless Random Approach” - IEEE Xplore, DOI, 10.1109/IMSAA.2009.5439438.
  • R.Amirtharajan, R. Akila, P.Deepikachowdavarapu, “A Comparative Analysis of Image Steganography”. International Journal of Computer Applications 2(3)(2010):41–47.
  • R.Amirtharajan, Krishnendra Nathella and J Harish, “Info Hide – A Cluster Cover Approach” International Journal of Computer Applications 3(5)(2010) 11–18.
  • Bruice Schneier, Applied Cryptography Protocols, Algorithm and Source Code in C. Second edition. Wiley India edition 2007
  • W. Bender, D. Gruhl, N. Morimoto, A. Lu, “Techniques for data hiding” IBM Syst. J. 35 (3&4) (1996) 313–336.
  • C.K. Chan, L.M. Chen, Hiding data in images by simple LSB substitution, Pattern Recognition 37 (3) (2004) 469–474.
  • Chang, C.C., Hsiao, J.Y., Chan, C.S., 2003. Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy. Pattern Recognition 36 (July), 1583–1595.
  • Chang, C.C., Tseng, H.W., 2004. A steganographic method for digital images using side match. Pattern Recognition Letter 25 (September), 1431–1437.
  • F.A.P. Petitcolas, R.J. Anderson, M.G. Kuhn, Information hiding—a survey, Proc. IEEE 87 (7) (1999) 1062–1078.
  • S. Katzenbeisser, F.A.P. Petitcolas, Information Hiding Techniques for Steganography and Digital Watermarking, Artech House, Norwood, MA, 2000.
  • Peter Wayner, “Disappearing cryptography: information hiding : steganography & watermarking” 2nd. ed. San Francisco: Morgan Kaufmann; 2002.
  • N. Provos and P. Honeyman, “Hide and seek: An introduction to steganography,” IEEE Security Privacy Mag.,1 (3) (2003) 32–44
  • C.C. Thien, J.C. Lin, A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function, Pattern Recognition 36 (11) (2003) 2875–2881
  • Po-Yueh Chen Hung-Ju Lin, “A DWT Based Approach for Image Steganography”, International Journal of Applied Science and Engineering 4(3)(2006): 275-290
  • R.Z. Wang, C.F. Lin, J.C. Lin, Image hiding by optimal LSB substitution and genetic algorithm, Pattern Recognition 34 (3) (2000) 671–683