Pixel Authorized by Pixel to Trace with SFC on Image to Sabotage Data Mugger: A Comparative Study on PI Stego
John Bosco Balaguru Rayappan
There is a raging moral combat to secure information from nefarious attackers as infringement of data is alarmingly escalating with valuable secret information being sabotaged, manipulated or even sold. This has made it necessary for development of efficacious information hiding algorithm to prevent info-sabotage by undetectable secret sharing. Steganography has gained the limelight in the recent past and is formidable and belligerent as it involves embedding of secret data in either images, audio, video, etc., so unsuspectingly that even when intercepted cannot provide a hint to the hackers. However, to make it fool proof we cerebrate yet another algorithm in this paper which uses a combination of Hilbert and Moore Space Filling Curve (SFC) and the pixel indicator methodology, a steganographic tool to improve the randomness and cloak the scanning path such the adversary does not even spill on the clandestine information by an accident. Pixel Indicator (PI) technique uses the complexity of the color image which would be split into red, green and blue planes, respectively with one acting as an indicator, depending upon whose last two bits, data would be embedded in the other two planes. Thus instead of employing the usual raster scan, a random space filling curves (SFC) is used for embedding data into the pixels, because of which it would be impossible for eavesdropper to determine the path of embedding of data making it a highly robust system. The added advantages and enhancements provided by this technique can be observed by the readings of Mean Square Error (MSE) and Peak Signal to Noise Ratio (PSNR) that have been obtained on implementing this algorithm.
to cite this article:
Rengarajan Amirtharajan and John Bosco Balaguru Rayappan, 2012. Pixel Authorized by Pixel to Trace with SFC on Image to Sabotage Data Mugger: A Comparative Study on PI Stego. Research Journal of Information Technology, 4: 124-139.
Received: February 12, 2012;
Accepted: February 23, 2012;
Published: June 27, 2012
Ever since life took birth on this planet, there has been an inexplicable need
for human beings to communicate, from the daily conversations to the exchange
of clandestine information. And as the need for communication escalated and
got satisfied by an equated technological advancement in the field of communication,
there has also been an identical scenario in the area of information extraction,
espionage and infringement. Thus it arouses the need for normal banking sector
to the powerful government to put their surreptitious information behind a barrage
of efficacious security systems. These behoved the methods for information hiding
to evolve from sheer primitive procedures to top class complex algorithms classified
as data hiding (Bender et al., 1996; Amirtharajan
and Balaguru, 2009, 2010, 2011,
2012a, b; Amirtharajan
et al., 2012; Cheddad et al., 2010).
Data hiding can be stratified into cryptography (Schneier,
2007; Salem et al., 2011), steganography
and digital water marking (Stefan and Fabin, 2000) over
a large basis. Cryptography involves the coding of the source message into a
different form which the sender and receiver can understand. But it lacks the
main purpose when it is transmitted as illegal data seekers may be attracted
by the coded form and thus the secrecy get lost. Steganography involves the
coding of the source message into a different form called cover object, most
probably an image, audio or video (Amirtharajan and Balaguru,
2009, 2010, 2011, 2012a,
b; Zhu et al., 2011;
Al-Frajat et al., 2010; Amirtharajan
et al., 2012) such that it can be decoded only by the appropriate
receiver with the correct key. Also it overcomes the deficit of cryptography
in that; it doesnt attract anyone on its transmission. This usually involves
the replacement of the lower bit of each pixel of the cover image with the original
message to form the stego image so as to reduce distortion (Thien
and Lin, 2003; Chan and Cheng, 2004; Yang,
2008). Watermarking is mainly intended for copy right protection wherein
the information to be sent is embedded in the digital signal in a way to verify
its authenticity (Abdulfetah et al., 2009; Zhang
et al., 2010; Abdulfetah et al., 2010;
Zeki et al., 2011).
On going through the literature, it has been observed that steganography is one of the most effective methods for data hiding, with its strength being, it satisfies all three requirements of information hiding magic triangle of robustness, imperceptibility and high data payload:
||Ability to withstand attacks and maintain integrity
||Maximum amount of data that can be hidden
||Ability to transmit data without attraction or suspicion of illegitimate
Steganography is found to be the best as it satisfies all the above requirements fairly well than the other two. The usually employed technique in this method involves directly replacing the Least Significant Bit (LSB) of each pixel in the cover object thus causing very less distortion.
The steganographic methods may possibly be categorized into Spatial or Transform
domain. In the former spatial domain of the cover objects are used to camouflage
the secret data resulting in Stego object. Whereas the later employs the transformed
domain of the cover objects are used to hide the clandestine information. The
other classification is based on the types of cover object like Video, Audio,
Image and Text (Shirali-Shahreza and Shirali-Shahreza, 2008;
Al-Azawi and Fadhil, 2010). One more classification
is based on the methods used on the chosen cover like Substitution (Amirtharajan
and Balaguru, 2009, 2010, 2011,
2012a, b; Amirtharajan
et al., 2012), Transform domain (Thanikaiselvan
et al., 2011b) and Spread Spectrum (Kumar et
al., 2011), Distortion, statistical and new cover generation (Xiang
et al., 2011). The other side to break steganography called steganalysis
are given by Xia et al. (2009) and Qin
et al. (2009, 2010).
Image steganography is extensively used now-a-days through internet (Hmood
et al., 2010a, b). It is the most common
and well known method for high capacity, imperceptibility (Thanikaiselvan
et al., 2011a, b). It could be classified
as Least Significant Bit (LSB) substitution and pixel value differencing. In
LSB substitution the least significant k-bits of target pixel in cover image
are embedded with message bits but these methods will considerably introduce
distortion in Stego image. To improve this, many new optimized LSB approaches
have been suggested. Chan and Cheng (2004) proposed
a simple LSB substitution method with Optimal Pixel Adjustment Process (OPAP)
to reduce the Mean square error. Wang et al. (2001,
2008) methods offers high embedding capacity with good
imperceptibility using adaptive Least Significant Bit (LSB) substitution along
with pixel-value differencing (PVD).
Abbas Cheddad discusses a detailed survey on digital image steganography methods
and its Classification (Cheddad et al., 2010).
It also describes the differences among steganography; watermarking and encryption
and few other reviews on steganography is available (Amirtharajan
et al., 2012; Rajagopalan et al., 2012;
Janakiraman et al., 2012a,b;
Thenmozhi et al., 2012). Pixel indicator based
random image stego system proposed by Gutub et al.
(2008) and Gutub (2010) and exploited by Amirtharajan
(Amirtharajan et al., 2010, 2011;
Padmaa et al., 2011). The number of bits embedding
decided by most significant values (MSBs) (Amirtharajan
et al., 2011), furthermore by calculating number of bits embedded
through PVD (Amirtharajan et al., 2010) and so
on. However, the embedding here is carried out using a simple Raster scan so
may be assailable by third parties and information may be easily extracted.
To compensate this glitch, Hilbert or Moore SFC (Amirtharajan
and Balaguru, 2009, 2010, 2012a;
Zhao and Luo, 2012) based embedding can be used instead
of Raster Scan (Thien and Lin, 2003; Chan
and Cheng, 2004; Yang, 2008). The specific scan
used can be kept confidential between sender and recipient and if hacked by
an eavesdropper, would be nearly impossible to track out any information or
find a pattern of data embedding. The entire cover image here would first have
to be segregated into smaller blocks and then data should be embedded as per
requirement. Also, an added advantage would be the inclusion of the Pixel Indicator
(PI) technique (Amirtharajan et al., 2010, 2011;
Padmaa et al., 2011), where one channel would
be determined as an indicator and the specified amount of bits by user (say
k bits) are then embedded in the other two channels depending upon the last
two bits of the indicator channel.
In the spatial domain it is seen that LSB substitution is done mostly by Raster
scan (Thien and Lin, 2003; Chan
and Cheng, 2004; Yang, 2008) and sometimes by random
scans (Amirtharajan and Balaguru, 2009, 2010,
2012b; Amirtharajan et al.,
2012) to embed the information to help up the capacity, simplicity and time
of implementation. In these random approaches all the pixels of the cover image
have not been used for hiding secret data which in turn affect the payload besides
THE PROPOSED METHOD
Space filling curves (SFC) is a one dimensional curve which traverses through
each and every point within a two dimensional space or image (Amirtharajan
and Balaguru, 2009, 2010, 2012b;
Zhao and Luo, 2012). SFC scans a pixel array which has
a size of MxN pixels and while scanning, it will not retain the same direction
but will turn around to embrace all the pixels at least and at most once. Hence
the unpredictable traversing path of SFC through the image has been chosen to
hide the secret message in the cover. In this scheme, both the sender and receiver
can adapt a particular SFC so that there is no need to communicate the key and
also providing a complicated traversing path for k-bit embedding which does
not require any key.
Before considering the entire cover image for secret bit embedding, block of 4x4 pixels has been taken to implement Hilbert SFC and Moore SFC traversing path based stego technique by adapting a common traversing path for both the sender and receiver. After performing this process for a single 4x4 block, it has been extended to the full image by considering it as multiple of 4x4 blocks to cover up the entire 28x28x3 pixels.
The traversing paths to embed secret data, based on Hilbert SFC and Moore SFC in gray scale are shown in Fig. 1 and 2 and Hilbert scan and Moore SFC in RGB in Fig. 3 and 4. Block diagram of the proposed embedding and extraction is shown in Fig. 5.
And the additional pixel indicator method used here involves selection of a channel as an indicator first and then depending upon the last two bits of the indicator, data is further embedded in the other two channels as given in Table 1.
|| Hilbert scan
|| Moore curve
|| Hilbert scan in RGB
|| Moore curve in RGB
|| Block diagram of the proposed embedding and extraction
|| Meaning of indicator values
Thus if red plane is selected as an indicator and its last two bits be 11 then k bits (as defined by user) of data are embedded in the blue and the green channel, respectively. Furthermore, the PI technique can be employed in three flexible methods:
||Red being the standard indicator for the entire cover image
||Cyclic indicator for the cover
|Case 1: k bit LSB with tri-colour random image steganography
|Case 2: k bit LSB with custom-indicator-plane tri-color random
|Case 3: k bit LSB with cyclic-indicator-plane tri-colour random
RESULTS AND DISCUSSION
To evaluate the performance of our proposed method several experiments are
performed. Figure 6 shows embedding and extraction flowchart.
Four colour images are taken with size 256x256 as cover images which are shown
in Fig. 7. Initially for varying k = 1, 2, 3 and 4 bit embedding
performed and the values for K= 4 bit embedding is given in Table
2, 3 and 4 for method 1, 2 and 3 and
the corresponding Stego covers for method 4 are given in Fig.
To evaluate the performance of the proposed system MSE and PSNR have been computed
for all the three methods. Peak Signal to Noise Ratio(PSNR) and Mean Square
The PSNR is calculated using the equation:
where, Imax is the intensity value of each pixel which is equal to 255 for 8 bit gray scale images.
The MSE is calculated by using the Eq. 2 given below:
where, M and N denote the total number of pixels in the horizontal and the vertical dimensions of the image Xi, j represents the pixels in the original image and Yi, j represents the pixels of the stego-image.
From Table 2 its observed that Mahatma Gandhi cover has the maximum embedding capacity and minimum PSNR values. There is no change in the red plane histogram Fig. 9.
||Embedding and extraction flowchart
|| Cover images; (a) Lena, (b) Baboon, (c) Gandhi and (d) Temple
||Stego output k = 4 bit for maximum embedding capacity; (a)
Lena, (b) Baboon, (c) Gandhi and (d) Temple
|| MSE PSNR values for method 1 k = 4 bit for maximum embedding
|| Method 2 MSE PSNR values for k = 4 bit embedding and green
plane as indicator (User choice)
|| Method 1 RGB histogram for temple, no change in red plane
From Table 3 its observed that Thanjavur Big Temple cover has the maximum embedding capacity and minimum PSNR values. There is no change in the green plane histogram (Fig. 10).
From Table 5 its observed that Baboon cover has the
maximum embedding capacity and minimum PSNR values and the error are evenly
distributed in all the planes (Fig. 11).
|| Method 3 MSE PSNR values for k = 4 bit embedding and cyclic
|| Comparative estimation parameters of the proposed embedding
Complexity analysis: The complexity of the proposed system is also good.
This method divides the cover image into 4x4 blocks. So there will be 4096 such
blocks. so by taking one red, green, blue 4x4 block and use Hilbert or Moore
SFC for traversing and if they are selected randomly then there are 4096!*4096!*4096!
ways to select one red, green, blue block. Pixel indicator additional increase
the randomness assuming 25% on each case like 00, 01, 10 and 11 which decides
the embedding capacity with secret data encrypted with AES. Then the complexity
would be 4096!^3*.5*2^128 Furthermore, first the indicator can be selected in
three ways. If the LSBs of the first indicator is not zero then embedding is
||So the probability of embedding is 3/4
||The cover image is divided into 1024x4 blocks of 4x4 pixels
||Two different scan paths for random embedding process can be adopted Hilbert
or Moore SFC 2 ways
||The PRN scheme has been adopted to select the block of 1024*4. = NpR =
N!/(N-r)! = 1024*4p1024*4 = 4096!
||The starting point of each 4x4 SFC has been changed. 16 different paths
can be selected by having 16 different starting points in the selected SFC
||So total complexity for embedding/ or hacking at least one bit is 2^128*3*4/3*2*4096!^3*16
||Which is far better than Padmaa et al. (2011)
2^64*7*0.5*2*2 and Amirtharajan et al. (2010)
is only 2^64*3/4*7 and Amirtharajan et al. (2011)
|| Method 2 RGB histogram for temple, no change in green plane
|| Method 3 histogram for temple, errors are evenly distributed
Thus it is seen there are myriad of methodologies for incorporating data security and impregnability in our day-to-day life. While there may be a plethora of techniques to incur the basic objective of information hiding involving imperceptibility, robustness, high payload and security, it is seen that not all of them may obtain it simultaneously. Especially the robustness factor seems to be compromised with the routine techniques being employed, with the hackers too being continually educated with them. Thus this proposed methodology brings about a fantabulous shift from the mundane methods, by involving Hilbert or Moore space filling curves for traversing through the pixels with more integrity obtained by employing pixel indicator (PI) concurrently. The added advantage in the proposed method is the ability to determine the indicator; either by the user or a cyclic one or a fixed one. To re-enforce the entire objective of security, the data is scrambled using DES before embedding. With 30 dB being fixed as the threshold PSNR value for human visual system, it is seen that this technique on embedding causes very little degradation and provides high imperceptibility 42 dB and above for all the cases. Thus it is observed that this algorithm involving random curves such as Hilbert or Moore SFC for traversing along with PI, is a boon for transfer of information, because when it is intercepted by hackers too, is an absolute nightmare to decode as they wouldnt have a clue as where as to start from. Overall, this method caters to all the requirements of information hiding in a single package.
Abdulfetah, A., X. Sun and H. Yang, 2009.
Quantization based robust image watermarking in DCT-SVD domain. Res. J. Inform. Technol., 1: 107-114.CrossRef | Direct Link |
Abdulfetah, A.A., X. Sun, H. Yang and N. Mohammad, 2010.
Robust adaptive image watermarking using visual models in DWT and DCT domain. Inform. Technol. J., 9: 460-466.CrossRef | Direct Link |
Zeki, A.M., A.A. Manaf, A.A. Ibrahim and M. Zamani, 2011.
A robust watermark embedding in smooth areas. Res. J. Inform. Technol., 3: 123-131.CrossRef |
Al-Azawi, A.F. and M.A. Fadhil, 2010.
Arabic text steganography using kashida extensions with huffman code. J. Applied Sci., 10: 436-439.CrossRef | Direct Link |
Al-Frajat, A.K., H.A. Jalab, Z.M. Kasirun, A.A. Zaidan and B.B. Zaidan, 2010.
Hiding data in video file: An overview. J. Applied Sci., 10: 1644-1649.CrossRef | Direct Link |
Amirtharajan, R. and R.J.B. Balaguru, 2009.
Tri-layer stego for enhanced security-a keyless random approach. Proceedings of the IEEE International Conference on Internet Multimedia Services Architecture and Applications, December 9-11, 2009, Bangalore, India, pp: 1-6CrossRef | Direct Link |
Amirtharajan, R. and R.J.B. Balaguru, 2010.
Constructive role of SFC and RGB fusion versus destructive intrusion. Int. J. Comput. Appl., 1: 30-36.CrossRef | Direct Link |
Amirtharajan, R., D. Adharsh, V. Vignesh and R.J.B. Balaguru, 2010.
PVD blend with pixel indicator-OPAP composite for high fidelity steganography. Int. J. Comput. Applic., 7: 31-37.CrossRef | Direct Link |
Amirtharajan, R. and R.J.B. Balaguru, 2011.
Covered CDMA multi-user writing on spatially divided image. Proceedings of the 2nd International Conference on Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology, February 28-March 3, 2011, Chennai, India, pp: 1-5CrossRef |
Amirtharajan, R., R.R. Subrahmanyam, P.J.S. Prabhakar, R. Kavitha and J.B.B. Rayappan, 2011.
MSB over hides LSB: A dark communication with integrity. Proceedings of the IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application, December 12-14, 2011, Bangalore, Karnataka, India, pp: 1-6CrossRef |
Amirtharajan, R., J. Qin and J.B.B. Rayappan, 2012.
Random image steganography and steganalysis: Present status and future directions. Inform. Technol. J., 11: 566-576.CrossRef | Direct Link |
Amirtharajan, R. and J.B.B. Rayappan, 2012.
An intelligent chaotic embedding approach to enhance stego-image quality. Inform. Sci., 193: 115-124.CrossRef | Direct Link |
Amirtharajan, R. and J.B.B. Rayappan, 2012.
Inverted pattern in inverted time domain for icon steganography. Inform. Technol. J., 11: 587-595.CrossRef | Direct Link |
Bender, W., D. Gruhl, N. Morimoto and A. Lu, 1996.
Techniques for data hiding. IBM Syst. J., 35: 313-336.CrossRef | Direct Link |
Cheddad, A., J. Condell, K. Curran and P. McKevitt, 2010.
Digital image steganography: Survey and analysis of current methods. Signal Process., 90: 727-752.CrossRef | Direct Link |
Chan, C.K. and L.M. Cheng, 2004.
Hiding data in images by simple LSB substitution. Pattern Recognit., 37: 469-474.CrossRef | Direct Link |
Gutub, A.A.A., 2010.
Pixel indicator technique for RGB image steganography. J. Emerg. Technol. Web Intell., 2: 56-64.CrossRef | Direct Link |
Gutub, A., M. Ankeer, M. Abu-Ghalioun, A. Shaheen and A. Alvi, 2008.
Pixel indicator high capacity technique for RGB image based steganography. Proceedings of the 5th IEEE International Workshop on Signal Processing and its Applications, March 18-20, 2008, Sharjah, UAE -
Hmood, A.K., B.B. Zaidan, A.A. Zaidan and H.A. Jalab, 2010.
An overview on hiding information technique in images. J. Applied Sci., 10: 2094-2100.CrossRef | Direct Link |
Hmood, A.K., H.A. Jalab, Z.M. Kasirun, B.B. Zaidan and A.A. Zaidan, 2010.
On the capacity and security of steganography approaches: An overview. J. Applied Sci., 10: 1825-1833.CrossRef | Direct Link |
Qin, J., X. Xiang and M.X. Wang, 2010.
A review on detection of LSB matching steganography. Inform. Technol. J., 9: 1725-1738.CrossRef | Direct Link |
Zhu, J., R.D. Wang, J. Li and D.Q. Yan, 2011.
A huffman coding section-based steganography for AAC audio. Inform. Technol. J., 10: 1983-1988.CrossRef | Direct Link |
Kumar, P.P., R. Amirtharajan, K. Thenmozhi and J.B.B. Rayappan, 2011.
Steg-OFDM blend for highly secure multi-user communication. Proceedings of the 2nd International Conference on Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology, February 28-March 3, 2011, Chennai, India, pp: 1-5CrossRef |
Xiang, L., X. Sun, Y. Liu and H. Yang, 2011.
A secure steganographic method via multiple choice questions. Inform. Technol. J., 10: 992-1000.CrossRef | Direct Link |
Padmaa, M., Y. Venkataramani and R. Amirtharajan, 2011.
Stego on 2n
: 1 Platform for users and embedding. Inform. Technol. J., 10: 1896-1907.CrossRef | Direct Link |
Qin, J., X. Sun, X. Xiang and Z. Xia, 2009.
Steganalysis based on difference statistics for LSB matching steganography. Inform. Technol. J., 8: 1281-1286.CrossRef | Direct Link |
Schneier, B., 2007.
Applied Cryptography: Protocols, Algorithms and Source Code in C. 2nd Edn., John Wiley and Sons, New Delhi, India, ISBN-13: 9788126513680, Pages: 784
Shirali-Shahreza, M. and S. Shirali-Shahreza, 2008.
High capacity persian/arabic text steganography. J. Applied Sci., 8: 4173-4179.CrossRef | Direct Link |
Janakiraman, S., R. Amirtharajan, K. Thenmozhi and J.B.B. Rayappan, 2012.
Pixel forefinger for gray in color: A layer by layer stego. Inform. Technol. J., 11: 9-19.CrossRef | Direct Link |
Janakiraman, S., R. Amirtharajan, K. Thenmozhi and J.B.B. Rayappan, 2012.
Firmware for data security: A review. Res. J. Inform. Technol., 4: 61-72.CrossRef | Direct Link |
Stefan, K. and A. Fabin, 2000.
Information Hiding Techniques for Steganography and Digital Watermarking. Artech House, London, UK
Rajagopalan, S., R. Amirtharajan, H.N. Upadhyay and J.B.B. Rayappan, 2012.
Survey and analysis of hardware cryptographic and steganographic systems on FPGA. J. Applied Sci., 12: 201-210.CrossRef | Direct Link |
Thanikaiselvan, V., P. Arulmozhivarman, R. Amirtharajan and J.B.B. Rayappan, 2011.
Wave (let) decide choosy pixel embedding for stego. Proceedings of the International Conference on Computer, Communication and Electrical Technology, March 18-19, 2011, India, pp: 157-162CrossRef | Direct Link |
Thanikaiselvan, V., S. Kumar, N. Neelima and R. Amirtharajan, 2011.
Data battle on the digital field between horse cavalry and interlopers. J. Theor. Applied Inform. Technol., 29: 85-91.Direct Link |
Thenmozhi, K., P. Praveenkumar, R. Amirtharajan, V. Prithiviraj, R. Varadarajan and J.B.B. Rayappan, 2012.
OFDM+CDMA+Stego = Secure communication: A review. Res. J. Inform. Technol., 4: 31-46.CrossRef | Direct Link |
Thien, C.C. and J.C. Lin, 2003.
A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function. Pattern Recognit., 36: 2875-2881.CrossRef | Direct Link |
Wang, C.M., N.I. Wu, C.S. Tsai and M.S. Hwang, 2008.
A high quality steganographic method with pixel-value differencing and modulus function. J. Syst. Software, 81: 150-158.CrossRef | Direct Link |
Wang, R.Z., C.F. Lin and J.C. Lin, 2001.
Image hiding by optimal LSB substitution and genetic algorithm. Pattern Recognit., 34: 671-683.CrossRef | Direct Link |
Yang, C.H., 2008.
Inverted pattern approach to improve image quality of information hiding by LSB substitution. Pattern Recognit., 41: 2674-2683.CrossRef | Direct Link |
Salem, Y., M. Abomhara, O.O. Khalifa, A.A. Zaidan and B.B. Zaidan, 2011.
A review on multimedia communications cryptography. Res. J. Inform. Technol., 3: 146-152.CrossRef | Direct Link |
Zhang, Y., Z.M. Lu and D.N. Zhao, 2010.
A blind image watermarking scheme using fast hadamard transform. Inform. Technol. J., 9: 1369-1375.CrossRef | Direct Link |
Zhao, Z. and H. Luo, 2012.
Reversible data hiding based on Hilbert curve scan and histogram modification. Inform. Technol. J., 11: 209-216.CrossRef | Direct Link |
Xia, Z., X. Sun, J. Qin and C. Niu, 2009.
Feature selection for image steganalysis using hybrid genetic algorithm. Inform. Technol. J., 8: 811-820.CrossRef | Direct Link |