Hindawi Publishing Corporation Te Scientifc World Journal Volume 2013, Article ID 464107, 7 pages http://dx.doi.org/10.1155/2013/464107 Research Article A Graph Theory Practice on Transformed Image: A Random Image Steganography V. Thanikaiselvan, 1 P. Arulmozhivarman, 1 S. Subashanthini, 2 and Rengarajan Amirtharajan 3 1 School of Electronics Engineering, VIT University, Vellore 632014, India 2 School of Information Technology, VIT University, Vellore 632014, India 3 School of Electrical & Electronics Engineering, SASTRA University, Tanjavur 613401, India Correspondence should be addressed to Rengarajan Amirtharajan; amir@ece.sastra.edu Received 15 August 2013; Accepted 3 October 2013 Academic Editors: R. Lu and G. Z. Zhao Copyright © 2013 V. Tanikaiselvan et al. Tis is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Modern day information age is enriched with the advanced network communication expertise but unfortunately at the same time encounters infnite security issues when dealing with secret and/or private information. Te storage and transmission of the secret information become highly essential and have led to a deluge of research in this feld. In this paper, an optimistic efort has been taken to combine graceful graph along with integer wavelet transform (IWT) to implement random image steganography for secure communication. Te implementation part begins with the conversion of cover image into wavelet coefcients through IWT and is followed by embedding secret image in the randomly selected coefcients through graph theory. Finally stegoimage is obtained by applying inverse IWT. Tis method provides a maximum of 44 dB peak signal to noise ratio (PSNR) for 266646 bits. Tus, the proposed method gives high imperceptibility through high PSNR value and high embedding capacity in the cover image due to adaptive embedding scheme and high robustness against blind attack through graph theoretic random selection of coefcients. 1. Introduction Communication has become inevitable in everybody’s rou- tine life. Be it mails, texts, photos, or audios or videos, they get communicated in millions among billions. Tis in turn demands only one thing, that is, security. Information security plays pivotal role to keep the information safe. Among the prominent defnitions for information security, the most vital of them is information security which is about veracity, discretion, and data availability. Tough several successful methods exist, they are still in research to boost up their performance. Undoubtedly, information security is the soul of exchange of data. Steganography [1] and cryptography [2] have evolved from times immemorial to provide security for communicat- ing secret details with steganography being the recent one. Image steganography [3–7] is a very interesting feld because of the imperceptible way of hiding data due to the resolution of the eye. Image hiding algorithms are used to embed secret data with higher efciency and less detecting capability [8]. It typically involves encrypting the secret images at frst and then embedding the secret information into encrypted images. Tese in turn have stronger antiattack capability than normal cover image [9]. Image steganography can be done either in spatial domain [10–14] or in frequency domain [15–18]. LSB (least signifcant bit) embedding [11] is a technique for embedding secret information into a cover image. A mathematical model for LSB technique has been developed for embedding and extracting the secret data [11]. PVD (pixel value diferencing) [9, 12] is an efcient technique for spatial domain steganog- raphy, which provides high data embedding capacity with reasonable PSNR. PVD is a quite common technique for steganography. Numbers of variations and new methods have been developed for PVD based steganography. Te present spatial and transform domain techniques for steganography employ raster scan procedure but are not able to provide high