Digital Image Steganography Using Eight-Directional PVD against RS Analysis and PDH Analysis

. The least significant bit (LSB) substitution techniques are detected by RS analysis and the traditional pixel value differencing (PVD) approaches are detected by pixel difference histogram (PDH) analysis. The PVD steganography can escape from PDH analysis by using the edges in multiple directions. This paper proposes a steganography technique by exploiting the edges in eight directions and also using LSB substitution to resist from both RS analysis and PDH analysis. For every 3 × 3 pixel block the central pixel is embedded with 3 or 4 bits of data by modified LSB substitution technique. Then this new value of the central pixel is utilized to calculate eight difference values with eight neighboring pixels. These eight difference values are used to hide the data. There are two types with regard to two different range tables. Type 1 uses 3 bit modified LSB substitution and range table 1. Type 2 uses 4 bit modified LSB substitution and range table 2. Type 1 and type 2 are also known as variant 1 and variant 2, respectively. Type 1 possesses higher PSNR and type 2 possesses higher hiding capacity.


Introduction
The LSB substitution is one of the simplest and wellknown approaches for data hiding.This simplest technique is detected by RS analysis.Wu and Tsai [1] exposed the fact that the edge regions in an image can conceal more amounts of data as compared to the smooth regions.Based on this principle they proposed pixel value differencing (PVD) steganography.The image should be partitioned into different blocks, each of size 1×2 pixels.For a block the difference value between the two pixels is computed and changed to a new value by adding data to it.The PVD technique with block size of 2×2 has been proposed to improve the embedding capacity [2,3].In blocks of size 2×2, edges in three directions are considered.Chang and Tseng [4] considered the values of 2, 3, and 4 neighboring pixels, to calculate the pixel value differences.But they did not address the fall in error problem (FIEP).Yang et al. [5] calculated varieties of pixel value differences in 4-pixel blocks for data hiding.Hong et al. [6] used diamond encoding with pixel value differencing to achieve better PSNR.LSB substitution techniques offer higher embedding capacity, but PVD techniques offer higher imperceptibility.Thus PVD and LSB techniques have been combined to obtain larger hiding capacity and better imperceptibility [7,8].Chen [9] proposed a PVD steganography using two reference tables to randomize the data embedding.Khodaei and Faez [10] proposed a hybrid approach by combining LSB substitution and PVD in 1×3 pixel block.It was further extended to 2×2 size block in [11] to achieve better performance.Based on pixel value differences adaptive LSB substitution has been performed in [12,13].
The traditional PVD steganography techniques follow a static range table.Due to this some undesired steps are introduced in pixel difference histograms of the stego images.This step effects can be avoided by applying two tricks, (i) exploiting the edges in multiple directions and (ii) using adaptive range table.Luo et al. [14] also proposed an adaptive PVD steganography with three-pixel blocks, which does not suffer with the step effects.Swain [15] proposed two adaptive PVD steganography techniques using vertical, horizontal, and diagonal edges, which do not suffer from step effects.The first technique uses pixel blocks of size 2×2 and the second technique uses pixel blocks of size 3×3.In general, adaptive 2  image steganography schemes possess lower hiding capacity.

Advances in Multimedia
The edges can be predicted by some prediction functions and hiding capacity depends upon this prediction.If we hide in smooth regions distortion will be more.Based on the level of complexity of the edge regions, adaptive embedding can be applied [16].In this way capacity can be increased and chance of detection can be decreased.Balasubramanian et al. [17] published PVD schemes with 3×3 size pixel blocks, to achieve higher hiding capacity.To prevent the detection from pixel difference histogram (PDH) analysis, multidirectional edges have been exploited in [18].Darabkh et al. [19] also proposed PVD steganography using eight-directional PVD which is an extension from Wu and Tsai's original PVD.A PVD steganography technique which is an extension of Wu and Tsai's PVD approach should be verified by PDH analysis.Gulve and Joshi [20] used PVD with LSB in six-pixel blocks to achieve higher embedding capacity.In one of the six pixels LSB substitution was applied.Then five differences were calculated and based on these differences PVD approach was applied.Zhang and Wang [21] proposed exploiting modification direction (EMD) steganography.The main goal in it is that a group of secret bits is converted to a digit in (2n+1)-ary notational system, where n is the size of pixel block.This secret digit could be hidden in the pixel block by adding ±1 to only one pixel.In this technique the hiding capacity is not good.Kim [22] advanced the EMD technique using basis vector and (2 n+x − 1)-ary notational system, where n and x are user defined values.Shen and Huang [23] made the hiding capacity of a block adaptive using PVD with EMD to achieve higher hiding capacity and better PSNR.Nguyen et al. [24] used multiple bit planes and pixel block complexity measure to perform adaptive embedding.In this method more number of bits is hidden in high textured regions as compared to low textured regions.In [25] the steganography algorithm uses a public key and a private key to generate pseudo random numbers that identify the embedding locations.
This paper proposes a combination of modified LSB substitution and eight-directional PVD in 3×3 pixel blocks.It is judiciously designed in such a manner that it can neither be detected by RS analysis nor be detected by PDH analysis.Furthermore Wu and Tsai's PVD principle is not used.

Proposed Eight-Directional PVD Technique
The embedding algorithm operates on 3×3 pixel blocks.The blocks are formed in a nonoverlapping manner.Let us denote a typical block as in Figure 1(a).The central pixel is P c and its surrounding pixels are P 1 , P 2 , P 3 , P 4 , P 5 , P 6 , P 7 , and P 8 .In central pixel t bit LSB substitution is performed.For type 1, the t value is 3 and range For i = 1 to 8 a pair of new values for each P i is calculated as in Now out of two new values P  i and P  i , one value is chosen for P  i using Thus the stego pixel block after hiding t, t 1 , t 2 , t 3 , t 4 , t 5 , t 6 , t 7 , and t 8 bits of data in pixels P c , P 1 , P 2 , P 3 , P 4 , P 5 , P 6 , P 7 , and P 8 , respectively, is as shown in Figure 1(b).
The extraction algorithm operates on 3×3 pixel blocks as in embedding algorithm.The blocks are formed in a nonoverlapping manner.A typical stego block is represented in Figure 1(b).Retrieve the t LSBs from P  c .For i=1 to 8, find eight difference values as in Each d  i belongs to a range whose embedding capacity is t i and lower bound is L i .For i=1 to 8, find the decimal values of the embedded secret bit streams using Now convert S 1 , S  8) is derived from ( 7) is described below.
Equation ( 10) can be simplified as 12) is obtained.
From (12), it can be concluded that d  i = L i + S i or S i = d  i − L i .This is nothing but (8) used in extraction procedure.Thus correctness of ( 8) is justified.

Results and Discussion
The embedding and extraction algorithms are simulated in MATLAB.Standard RGB color images from SIPI image data base are used for testing.The R, G, and B components (each 8 bits) of a pixel are treated as a single unit.For eight sample images the results are discussed and averaged.Figure 4 shows the original images, Figure 5 shows the stego images of type 1, and Figure 6 shows the stego images of type 2. In each of these stego images seven lakhs (700,000) bits of data is hidden.The evaluation parameters are (i) hiding capacity; (ii) bit rate (BPB); (iii) PSNR and quality index (Q).The hiding capacity is the total number of bits that an image can conceal.The bits      per byte (BPB) indicate the average hiding capacity per a byte of the original image.Equation ( 13) is used to calculate BPB.BPB = hiding capacity image size in bytes (13) Distortion in stego image is measured in terms of PSNR.Equation ( 14) is used to calculate it.PSNR = 10 × log 10 255 × 255 MSE (14) where MSE denotes the mean square error and can be computed using where p ij is a pixel of cover image and q ij is the corresponding stego pixel.
The quality index (Q) is another parameter to measure the structural similarity between original image and stego image.Equation ( 16) is used to compute it.The maximum value of Q can be 1, if original image, p, and stego image, q, are the same.
where p stands for the mean pixel value of the original image, q stands for the mean pixel value of the stego image,  2 x stands for the standard deviation of pixel values of original image,  2 y stands for the standard deviation of pixel values of stego image, and  xy is the covariance between original image and stego image.Equations ( 17), ( 18), ( 19), (20), and ( 21) are used to calculate these values.
Table 3 notes the results of seven-way PVD [18] which is an extension of Wu and Tsai's [1] technique.Table 4 notes the results of Khodaei and Faez's technique [10] and Table 5 notes the results of the proposed technique.The PSNR and capacity of the proposed technique (both type 1 and type 2) are better than seven-way PVD.The bit rate and Q are also better.Although as compared to Khodaei and Faez's technique the PSNR is not improved, but the hiding capacity is improved.The major advantage over Khodaei and Faez's technique is that the proposed technique is resistant to PDH analysis, but Khodaei and Faez's technique is detectable by PDH analysis.This is made possible by exploiting the edges in eight directions.Now let us observe the results of proposed technique and compare type 1 and type 2. We can observe that the capacity is higher in type 2 as compared to type 1.This is because of the 4 LSBs substitution in type 2 at the central pixel; i.e., the t value is 4. On the other hand the PSNR of type 1 is better than that of type 2.

Security Analysis
The LSB substitution techniques suffer from RS analysis and PVD techniques suffer from PDH analysis.The proposed technique uses the concepts like modified LSB substitution and PVD, so it must be analyzed by both RS analysis and PDH analysis.
The PDH analysis is performed by calculating the difference value between every pair of pixels.A pair comprises two consecutive pixels.This difference values will be from -255 to +255 including 0. The frequency of each of these difference values is counted.A graph is plotted, with the pixel difference value on X-axis and frequency on Y-axis.The curve obtained is called the PDH.The PDH of original image will be a smooth curve.If the PDH of stego image is also a smooth curve then steganography is not detected.If the PDH of stego image shows step effects, then steganography is identified.
Figure 7 is the PDH analysis of type 1 and Figure 8 is the PDH analysis of type 2 of the proposed technique.The analysis is carried over all the eight test images.For each image the PDH of the original image is represented by solid line and the PDH of the stego image is represented by dotted line.The solid line curves will be obviously free of step effects as they are of the original images.The dotted line curves in all the sixteen cases do not show any step effects.This justifies that the proposed technique is resistant to PDH analysis.
The RS analysis is based on statistical measures.It is done in the following manner.Define a function F 1 : 2n ←→2n+1.It defines two transformations, (i) from value 2n to value 2n + 1 and (ii) from value 2n + 1 to value 2n.Similarly, define another function F −1 : 2n ←→2n -1.It defines other two transformations, (i) from value 2n to value 2n -1 and (ii) from value 2n -1 to value 2n.The image, say M, is divided into a number of equal size blocks.Suppose such a block is G whose pixels are X 1 , X 2 , X 3 , . . ., X n .Then use the function f(X 1 , X 2 , X 3 , . . ., X n )=∑ n−1 i=1 |X i+1 −X i | to measure the smoothness of G. Then apply F 1 to all the blocks of M and define the two parameters R m and S m as in (22) and (23).Similarly, apply F −1 to all the blocks of M and define the two parameters R −m and S −m as in (24) and (25).Figure 9 represents RS analysis for the proposed technique.Figures 9(a) and 9(b) stand for RS analysis over Lena and Baboon images, respectively, of type 1.Similarly, Figures 9(c) and 9(d) stand for RS analysis over Lena and Baboon images, respectively, of type 2. In all the four cases the condition R  ≈ R − > S m ≈ S −m is true, so we can conclude that RS analysis could not detect the proposed technique.Lena image has more smooth regions and Baboon image has more edge regions; all the remaining six images are in between these two in terms of smoothness.So it is sufficient to draw a conclusion based on these two images.

Conclusion
The traditional PVD steganography techniques follow a static range table.Due to this some undesired steps are introduced in pixel difference histograms of the stego images.This step effect could be avoided by exploiting edges in eight different directions.This paper proposes a steganography technique using a judicious combination of LSB substitution and eightdirectional PVD.The LSB substitution is performed only in one pixel out of nine pixels in a block, so RS analysis cannot detect it.By using the edges in multiple directions the PDH analysis cannot detect it.There exist two types of the proposed technique, with regard to two different quantization tables.The type 1 provides higher PSNR and the type 2 provides higher hiding capacity.This proposed technique performs better in terms of hiding capacity and PSNR over other competing PVD techniques.

Figure 2
Figure 2 represents an example of embedding for type 1 with t=3 of the proposed technique.It is self-explanatory.To

Figure 3
represents an example of extraction for type 1 with t=3 of the proposed technique.It is self-explanatory.To understand this example it can be traversed from left to right and top to bottom.

==
No of blocks satisf ying the condition f (F 1 (G)) > f (G) No of blocks satisf ying the condition f (F 1 (G)) < f (G) Total number of blocks (23) R −m = No of blocks satisf ying the condition f (F −1 (G)) > f (G)

Figure 7 :
Figure 7: PDH analysis for type 1 of the proposed technique.

Figure 8 :
Figure 8: PDH analysis for type 2 of the proposed technique.

Figure 9 :
Figure 9: RS analysis for type 1 and type 2 of the proposed technique.

table is Table 1 .
For type 2, the t value is 4 and the range table is

Table 2
The difference value d 1 belongs to one of the six ranges.Suppose the lower bound is denoted as L 1 and hiding capacity as t 1 for the range of d 1 .Similarly L 2 , L 3 , L 4 , L 5 , L 6 , L 7 , and L 8 are the lower bounds and t 2 , t 3 , t 4 , t 5 , t 6 , t 7 , and t 8 are the hiding capacities of the ranges of d 2 , d 3 , d 4 , d 5 , d 6 , d 7 , and d 8 , respectively.Now take t 1 , t 2 , t 3 , t 4 , t 5 , t 6 , t 7 , and t 8 bits of data separately and convert to their decimal values S 1 , S 2 , S 3 , S 4 , S 5 , S 6 , S 7 , and S 8 , respectively.
2 , S 3 , S 4 , S 5 , S 6 , S 7 , and S 8 into t 1 , t 2 , t 3 , t 4 , t 5 , t 6 , t 7 , and t 8 binary bits, respectively.The correctness of the extraction procedure is justified by the following mathematical discussions.That means how (

Table 5 :
Results of proposed eight-directional PVD technique.