Pixel pair matching (PPM) is widely used in digital image steganography. As an important derivation, adaptive pixel pair matching method (APPM) offers low distortion and allows embedded digits in any notational system. However, APPM needs additional space to store, calculate, and query neighborhood set, which needs extra cost. To solve these problems, a formula adaptive pixel pair matching (FAPPM) method is proposed in this paper. The basic idea of FAPPM is to use the formula to get the stego image pixel pair without searching the neighborhood set for the given image pixel pair. This will allow users to embed secret message directly without storing and searching the look-up table. Experimental results and analysis show that the proposed method could embed secret data directly without searching the neighborhood sets by using a formula and it still maintains flexibility in the selection of notional system, high image quality, and strong anti-steganalysis ability.
National Natural Science Foundation of China6157218261370225Natural Science Foundation of Hunan Province15JJ20071. Introduction
Information hiding is a technology of embedding secret data into the media for covert communication [1]. With the rapid development of Internet, a large number of data are transmitted over the Internet. At present, the main media using for data hiding includes images, audio, and video, where digital image is the most widely used media [2]. Researchers have shown a great interest in image steganography for the last decade [3]. LSB replacement [4] is one of the most commonly used steganographic techniques, which makes full use of the characteristics that the human visual system is not sensitive to small changes in pixels and the negligible contribution of the low bit plane of the pixel to the image quality. However, this method can only add 1 or remain unchanged for the even pixels and can only decrease 1 or remain unchanged for the odd pixels. Therefore, this unbalanced embedding distortion leads to the histogram attack to the images [5, 6]. Chan et al. [7] proposed an optima pixel adjustment process (OPAP) method, which adjusted the pixels to reduce the distortion caused by least significant bit (LSB) embedding. The LSB and OPAP methods both employed one pixel as an embedding unit to embed secret message. As the development of steganography, methods using two or more pixels as a basic unit for B-ary secret information embedding were put forward. This kind of stenographic algorithm can improve the embedding capacity and image quality by subtle modifying the pixel.
In 2006, Miekikainen [11] proposed a LSB matching method. It employed two pixels as embedding unit. In this method, when payload was 1 bit per pixel, the mean square error (MSE) is 0.375, while the MSE of LSB [4] was 0.5. Zhang and Wang [12] proposed exploiting modification direction (EMD) method, which added and subtracted 1 in one pixel and embedded 2n + 1-ary secret message in n pixels. When n = 2, a quinary number was embedded in each pair of pixels. The capacity can reach the maximum (1/2)log25=1.161 bit per pixel (bpp). Chao et al. [13] extended this method and proposed a diamond encoding (DE) method. It can embed 2k2+2k+1-ary information to each pair of pixels and achieve high embedding efficiency by adding and subtracting 1 operation in n pixels. In [8], the author used a codebook to improve the EMD scheme, and one secret (2n+x-1)-ary digit was hidden in a group of pixels in an image as a modified secret digit. In [9], the authors proposed a method to modify a group of pixels by ±1 to embed a secret digit, but it is only applicable to 3n-ary notational system. Kuo et al. [14] proposed a formula diamond encoding (FDEMD) data hide scheme, and it could conceal a digit in (2k2+2k+1)-ary system. It simplified the embedding procedure and embedded secret data without storing and calculating characteristic value matrix. Hong et al. [10] designed a new extraction function and new neighborhood set of two pixels called adaptive pixel pair matching (APPM). It allowed embedding digits in arbitrary notational system and the distortion caused by embedment using APPM was minimized; therefore the resultant marked image quality could be well preserved [15]. In [16], secure adaptive pixel pair matching (SAPPM) was proposed to hide multiple data types such as text, image, and audio which incorporated cryptography along with steganography. A transformed version of adaptive pixel pair matching (APPM) was used for image steganography to get lower distortion [17]. However, APPM need to calculate, store, and query the modified neighborhood set table.
Based on the above methods, this paper simplifies the embedding procedure and designs an extraction function to construct a formula adaptive pixel pair matching (FAPPM) method. It does not need to calculate, store, and query the modified neighborhood set table, and it can realize the data hiding in any notional system.
2. A Review of Adaptive Pixel Pair Matching (APPM)
The APPM method [10] used a pair of pixels (x,y) as a coordinate, where an extraction function fAPPM(x,y) was designed. Then a neighborhood set Φ(x,y) of (x,y) was established.(1)fAPPMx,y=x+cBymodBwhere f(x,y) and Φ(x,y) satisfied the following three conditions:
In the neighborhood set Φ(x,y), there are exactly B pairs of coordinates.
In the neighborhood set Φ(x,y), the extracted function values for each coordinate are mutually exclusive.
According to f(x,y) and Φ(x,y), a digit can be embedded in any notional system.
The way to find the extraction function coefficient cB and Φ(x,y) can be converted to find the following optimal solution:
Minimize ∑i=0B-1[(xi-x)2+(yi-y)2], subject to f(xi,yi)∈{0,1,…,B-1}, where f(xi,yi)≠f(xj,yj), if i≠j and 0≤i,j≤B-1.
According to the above, cB and Φ(x,y) can be calculated with different B-ary. For APPM proposed by Hong [10], cB corresponding to B-ary is listed in Table 1. Meanwhile, parts of Φ(x,y) corresponding to B-ary are illustrated in Figure 1.
Extraction Function Coefficient cB of APPM.
c2
c3
c4
c5
c6
c7
c8
c9
c10
c11
c12
c13
c14
c15
c16
1
1
2
2
2
2
3
3
3
3
4
5
4
4
6
c17
c18
c19
c20
c21
c22
c23
c24
c25
c26
c27
c28
c29
c30
c31
4
4
4
8
4
5
5
5
5
10
5
5
5
12
12
c32
c33
c34
c35
c36
c37
c38
c39
c40
c41
c42
c43
c44
c45
c46
7
6
6
10
15
6
16
7
7
6
12
12
8
7
7
c47
c48
c49
c50
c51
c52
c53
c54
c55
c57
c58
c59
c60
c61
c62
7
7
14
14
9
22
8
12
21
16
24
22
9
8
8
c63
c64
14
14
Neighborhood set (shaded region) for APPM.
Φ4, c4=2
Φ5, c5=2
Φ6, c6=2
Φ9, c9=3
Φ13, c13=5
Φ16, c16=6
Φ25, c25=5
Compared with DE and EMD method, APPM has the flexibility to choose a better notational system for data embedding to decrease the image distortion. The selection of B-ary system is determined by the size of the cover image C. Given the size of C is M×N, B is the minimum value satisfying M×N/2≥sB. However, it needed to calculate, store, and query the neighborhood set as shown in Figure 1.
3. The Proposed Formula Adaptive Pixel Pair Matching Method (FAPPM)
In order to solve the above shortcomings, this paper puts forward a formula adaptive pixel pair matching embedding method to find the stego-pixel pair without a neighborhood set.
3.1. Embedding Procedure
In the embedding procedure, four vectors at most are produced. Two vectors are calculated when D>0, and the other two vectors are calculated when D<0. In Algorithm 1, i represents vectors 1 to 4 in turn. Figure 2 shows the embedding process overview.
Algorithm 1
Input: A pixel pair (x1,x2), extraction function coefficient cB and secret data s.
Output: Stego pixel pair (x1′,x2′).
Step 1: Set f=(x1+cBx2)modB
Step 2: Set k=(B-1)/2
Step 3: Set D=s-f
Step 4: If D<0 then D=D+B
Step 5: Set next_t1=DmodcB
Step 6: While i=1 to 4 do
Set t1=next_t1
Set t2=D-t1/cB
If t1≤k & & t2≤k then
Set x1′=x1′+t1
Set x2′=x2′+t2
Else
Switch (i)
Case 1:
Set next_t1=t1-cB
Case 2:
Set D=D-B
Set next_t1=-(DmodcB)
Case3:
Set next_t1=t1+cB
Case4:
Print “Error”
End Switch
End if
End While
The embedding process.
Example 1.
For a cover pixels pair (5,6), secret data s=8(16), and extraction function coefficient c16=6, the stego image pixels pair (x1′,x2′) = (4,6) is obtained by using Algorithm 1.
Step 1.
Calculate f=(5+6×6)mod16=9, k=B-1/2=2.
Step 2.
Calculate D=s-f=-1. As D<0, D=D+B=15 is obtained.
Step 3.
Calculate next_t1=Dmodc16=3.
Round 1: t1=3,t2=2.
t1>k & & t2>k, then next_t1=t1-cB=-3.
Round 2: t1=-3, t2=3.
t1>k & & t2>k, then D=D-B=-1,next_t1=-(Dmodc16)=-1.
Round 3: t1=-1, t2=0.
t1≤k & & t2≤k, then return (4,6).
3.2. Extraction Procedure
Through extraction function, secret digits can be extracted from the stego image. The detailed process is given in Algorithm 2.
Algorithm 2
Input: stego image S.
Output: Secret data.
Step 1: Divide the stego image S into non overlapping pixel pairs (xi′,yi′).
Step 2: Calculate si=f(xi′,yi′)=(xi′+cByi′)modB, where i represents the i-th pixel pair.
Step 3: Calculate all si and convert them to binary stream m.
3.3. Overflow Problem and Solution
If an overflow or underflow problem occurs, that is, (x′,y′)<0 or (x′,y′)>255, a nearest (x′′,y′′) should be found in the neighborhood of (x,y) such that f(x′′,y′′)=sB. This can be done by solving the optimization problem(2)Minimize:x-x′′2+y-y′′2,Subject to:fx′′,y′′=sB,0≤x′′,y′′≤255.
4. Experimental Results and Analysis4.1. Experimental Results
The experiments are performed using Matlab R2013a, and eight 512×512 grayscale images are used as shown in Figure 3. The stego images are shown in Figure 4, where B=27.
The eight gray cover images.
Lena
Barbara
Pepper
Boat
Tiffany
Baboon
Zelda
Airplane
The eight stego images (B=27, PSNR=45dB).
Lena
Barbara
Pepper
Boat
Tiffany
Baboon
Zelda
Airplane
As seen from Figures 3 and 4, the difference between the cover images and the corresponding stego images is very little and can not be distinguished by human’s eyes. It illustrated the good imperceptibility of the proposed method.
As message embedding, it will introduce the distortion in the image. Peak signal-to-noise ratio (PSNR) is usually used to measure the quality of image. The definition of PSNR is as follows:(3)PSNR=10×log102552MSEwhere MSE is the mean square error between the cover image and stego image; it is defined as follows:(4)MSE=1M×N∑i=0M∑j=0Npi,j-pi,j′2Here, the symbols pi,j and pi,j′ represent the pixel values of the cover image and stego image in the position (i,j), respectively, and M and N are the width and height of the original image.
As the proposed method can embed secret digit in any notional system, experiments are done to test the relationship between embedding payload and image quality, and the results are shown in Figure 5. It can be found that the PSNR is decreased as the embedding capacity is increased. However, the PSNR still achieved a high value when the embedding capacity reached 1%.
The relationships between embedding payload and image quality.
4.2. Comparison with Other Methods
Here EMD [8], EMD-3 [9], APPM, and FAPPM are compared from six aspects: the embedding method, the national system, payload, capacity, PSNR, and the storage space. The results are listed in Table 2. As seen from Table 2, FAPPM method uses a mathematical method to embed secret data and it does not need any space to store neighbor table; furthermore, it does not affect the capacity and image quality.
Comparison of results.
Contents of comparison
EMD[8]
EMD-3[9]
APPM[10]
Proposed FAPPM
Embedding method
Matrix and search
Matrix and search
table look-up
Mathematic method
Notational systems of B-ary
fixed
fixed
arbitrary
arbitrary
Payload (bpp) B=25
2.471
2.471
2.32
2.32
PSNR (dB)
43.9
42.9
48.1
48.1
Need the storage space
Yes
Yes
Yes
No
4.3. Analysis of the Security
Anti-steganalysis is one of the most important criteria to measure the performance of a steganographic method. In this paper, a detection method based on histogram differential statistics analysis proposed by Zhao [18] is used to test the security of the FAPPM method. Normally, in an image with no hiding message, the horizontal difference histogram H^h and the vertical difference histogram H^v are coincident. But, when the message is embedded in a pair of pixels, its H^h and H^v will be changed. The distance between H^h and H^v is used to construct a statistical detector to detect the variation between histograms. The distance is defined as follows:(5)D=∑i=-2T2TH^hi-H^vi1/2where T is a predefined threshold and D represents the difference between H^h and H^v. The larger the D is, the greater the difference between H^h and H^v is. That is, the probability that the image contains secret information is high. Here experiments are done to compare the histogram variation of FAPPM and FDEMD under high payload. Both FAPPM and FDEMD methods are used to generate 100 stego images, respectively. H^h, H^v, and their average value are calculated, respectively. The parameters are B=53, B=211, and T=20. All the test images were fully embedded. The experiment results are shown in Figure 6. It can be seen that there is almost no difference between H^h and H^v for FAPPM, while that for FDEMD is significant, which indicates the probability that the successful steganalysis for FDEMD is higher than that of the proposed method.
Comparison of the averaged vertical and horizontal difference histograms of FAPPM and FDEMD.
FAPPM B=53, D=134
FDEMD B=53,D=936
FAPPM B=221, D=189
FDEMD B=221, D=1449
The RS attack method can detect LSB secret data embedding in grayscale or color images. Each pixel block is classified into the regular group R, the singular group S, and the unusable group U by a flipping function and mask M. Rm, Sm, and Um denote the number of R, S, and U, respectively. For inverse mask -M, R-m, S-m, and U-m denote the number of R, S, and U, respectively. When no information is embedded, Rm -R-m≈0 and Sm -S-m≈0. The RS attack results are shown in Figures 7 and 8. It can be seen that the algorithm of this paper can guarantee Rm -R-m≈0 and Sm -S-m≈0, and the existence of secret information cannot be detected by RS steganalysis method.
The difference of Rm and R-m for RS attack.
The difference of Sm and S-m for RS attack.
5. Conclusion
This paper proposed a simple and convenient data embedding method based on APPM. Compared with the APPM method, it has the advantage of no needing to compute and store the neighborhood set. Compared with the FDEMD method, the secret data of any notional system is realized by the FAPPM method, which makes the embedding notational system selection more flexible. The experimental results showed that FAPPM method has high image quality and the strong anti-steganalysis ability. Our future work will be concentrated on the use of the formula method of the adjacent three pixels as the embedding unit.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work was supported in part by project supported by National Natural Science Foundation of China (Grant no. 61572182, no. 61370225) and project supported by Hunan Provincial Natural Science Foundation of China (Grant no. 15JJ2007).
FridrichJ.2009New York, NY, USACambridge University PressMR2588483Zbl1185.68312CheddadA.CondellJ.CurranK.Mc KevittP.Digital image steganography: survey and analysis of current methods201090372775210.1016/j.sigpro.2009.08.010Zbl1177.941382-s2.0-70350710022HussainM.WahabA. W.IdrisY. I.HoA. T.JungK.Image steganography in spatial domain: A survey201865466610.1016/j.image.2018.03.012ProvosN.HoneymanP.Hide and seek: an introduction to steganography200313324410.1109/msecp.2003.12032202-s2.0-3042742327FridrichJ.GoljanM.DuR.Reliable Detection of LSB Steganography in Color and Grayscale Images20022228KerA. D.Steganalysis of LSB matching in grayscale images20051264414442-s2.0-2044440417810.1109/LSP.2005.847889ChanC.-K.ChengL. M.Hiding data in images by simple LSB substitution20043734694742-s2.0-034621690710.1016/j.patcog.2003.08.007Zbl1072.68534KimC.Data hiding by an improved exploiting modification direction20146935695842-s2.0-8489711407710.1007/s11042-012-1114-0NiuX.MaM.TangR.YinZ.Image steganography via fully exploiting modification direction2015952432542-s2.0-84930975538HongW.ChenT.-S.A novel data embedding method using adaptive pixel pair matching2012711761842-s2.0-8486290854410.1109/TIFS.2011.2155062MielikainenJ.LSB matching revisited200613528528710.1109/LSP.2006.870357ZhangX.WangS.Efficient steganographic embedding by exploiting modification direction200610117817832-s2.0-4734909439710.1109/LCOMM.2006.060863ChaoR.WuH.LeeC.ChuY.A Novel Image Data Hiding Scheme with Diamond Encoding20092009165804710.1186/1687-417X-2009-658047KuoW.-C.LaiP.-Y.WangC.-C.WuuL.-C.A formula diamond encoding data hiding scheme201566116711762-s2.0-84942884171HongW.ChenM.ChenT.HuangC.An efficient authentication method for AMBTC compressed images using adaptive pixel pair matching20187744677469510.1007/s11042-017-4899-zEdwina AliasT.MathewD.ThomasA.Steganographic Technique Using Secure Adaptive Pixel Pair Matching for Embedding Multiple Data Types in ImagesProceedings of the 5th International Conference on Advances in Computing and Communications, ICACC 2015September 2015India4264292-s2.0-84965138223PappachanJ.BabyJ.Transformed adaptive pixel pair matching technique for colour imagesProceedings of the International Conference on Control, Instrumentation, Communication and Computational Technologies, ICCICCT 2015December 2015India1921962-s2.0-84974816744ZhaoH.WangH.Khurram KhanM.Statistical analysis of several reversible data hiding algorithms2011522-32772902-s2.0-7995302881110.1007/s11042-009-0380-y