Advances in Multimedia
Volume 2018 (2018), Article ID 7682098, 8 pages
https://doi.org/10.1155/2018/7682098

Research Article

A Formula Adaptive Pixel Pair Matching Steganography Algorithm

Min Long1,2 and Fenfang Li¹

¹College of Computer and Communication Engineering, Changsha University of Science and Technology, 410114, China
²Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha, Hunan Province 410114, China

Correspondence should be addressed to Min Long; caslongm@aliyun.com

Received 23 January 2018; Revised 31 March 2018; Accepted 30 April 2018; Published 5 July 2018

Academic Editor: Mehdi Hussain

Copyright © 2018 Min Long and Fenfang Li. This 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.

Abstract.

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.

1. 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 bit per pixel (bpp). Chao et al. [13] extended this method and proposed a diamond encoding (DE) method. It can embed 2k²+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 (-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 to embed a secret digit, but it is only applicable to -ary notational system. Kuo et al. [14] proposed a formula diamond encoding (FDEMD) data hide scheme, and it could conceal a digit in (2k²+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 as a coordinate, where an extraction function was designed. Then a neighborhood set of was established.

where and satisfied the following three conditions:

(i)In the neighborhood set , there are exactly pairs of coordinates.(ii)In the neighborhood set , the extracted function values for each coordinate are mutually exclusive.(iii)According to and , a digit can be embedded in any notional system.

The way to find the extraction function coefficient and can be converted to find the following optimal solution:

Minimize , subject to , where , if and .

According to the above, and can be calculated with different B-ary. For APPM proposed by Hong [10], corresponding to B-ary is listed in Table 1. Meanwhile, parts of corresponding to B-ary are illustrated in Figure 1.

Table 1: Extraction Function Coefficient of APPM.

1
1
2
2
2
2
3
3
3
3
4
5
4
4
6

4
4
4
8
4
5
5
5
5
10
5
5
5
12
12

7
6
6
10
15
6
16
7
7
6
12
12
8
7
7

7
7
14
14
9
22
8
12
21
16
24
22
9
8
8

14
14

(a),

(b),

(c),

(d),

(e),

(f),

(g),

Figure 1: Neighborhood set (shaded region) for APPM.

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 . 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.

Input: A pixel pair , extraction function coefficient and secret data .

Output: Stego pixel pair .

Step 1: Set

Step 2: Set

Step 3: Set

Step 4: If then

Step 5: Set

Step 6: While to 4 do

Set

Set

If & & then

Set

Set

Else

Switch

Case 1:

Set

Case 2:

Set

Set

Case3:

Set

Case4:

Print “Error”

End Switch

End if

End While

Algorithm 1

Figure 2: The embedding process.

Example 1. For a cover pixels pair , secret data , and extraction function coefficient , the stego image pixels pair =   is obtained by using Algorithm 1.

Step 1. Calculate , .

Step 2. Calculate . As , is obtained.

Step 3. Calculate .

(1)Round 1: .(2) & & , then .(3)Round 2: , .(4) & & , then .(5)Round 3: , .(6) & & , then return .

3.2. Extraction Procedure

Through extraction function, secret digits can be extracted from the stego image. The detailed process is given in Algorithm 2.

Input: stego image .

Output: Secret data.

Step 1: Divide the stego image into non overlapping pixel pairs .

Step 2: Calculate , where represents the i-th pixel pair.

Step 3: Calculate all and convert them to binary stream .

Algorithm 2

3.3. Overflow Problem and Solution

If an overflow or underflow problem occurs, that is, or , a nearest should be found in the neighborhood of such that . This can be done by solving the optimization problem

4. Experimental Results and Analysis

4.1. Experimental Results

The experiments are performed using Matlab R2013a, and eight grayscale images are used as shown in Figure 3. The stego images are shown in Figure 4, where B=27.

(a) Lena

(b) Barbara

(c) Pepper

(d) Boat

(e) Tiffany

(f) Baboon

(g) Zelda

(h) Airplane

Figure 3: The eight gray cover images.

(a) Lena

(b) Barbara

(c) Pepper

(d) Boat

(e) Tiffany

(f) Baboon

(g) Zelda

(h) Airplane

Figure 4: The eight stego images (B=27, PSNR=45dB).

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:

where MSE is the mean square error between the cover image and stego image; it is defined as follows:

Here, the symbols and represent the pixel values of the cover image and stego image in the position , respectively, and and 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%.

Figure 5: 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.

Table 2: 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 and the vertical difference histogram are coincident. But, when the message is embedded in a pair of pixels, its and will be changed. The distance between and is used to construct a statistical detector to detect the variation between histograms. The distance is defined as follows:

where is a predefined threshold and represents the difference between and . The larger the is, the greater the difference between and 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. , , 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 and 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.

(a) FAPPM B=53, D=134

(b) FDEMD B=53,D=936

(c) FAPPM B=221, D=189

(d) FDEMD B=221, D=1449

Figure 6: Comparison of the averaged vertical and horizontal difference histograms of FAPPM and FDEMD.

The RS attack method can detect LSB secret data embedding in grayscale or color images. Each pixel block is classified into the regular group , the singular group , and the unusable group by a flipping function and mask . , , and denote the number of , , and , respectively. For inverse mask -, -, -, and U- denote the number of , , and , respectively. When no information is embedded, --m≈0 and --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 --m≈0 and --m≈0, and the existence of secret information cannot be detected by RS steganalysis method.

Figure 7: The difference of Rm and R-m for RS attack.

Figure 8: 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).

References

J. Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications, Cambridge University Press, New York, NY, USA, 2009.

A. Cheddad, J. Condell, K. Curran, and P. Mc Kevitt, “Digital image steganography: survey and analysis of current methods,” Signal Processing, vol. 90, no. 3, pp. 727–752, 2010.

M. Hussain, A. W. Wahab, Y. I. Idris, A. T. Ho, and K. Jung, “Image steganography in spatial domain: A survey,” Signal Processing: Image Communication, vol. 65, pp. 46–66, 2018.

N. Provos and P. Honeyman, “Hide and seek: an introduction to steganography,” IEEE Security & Privacy, vol. 1, no. 3, pp. 32–44, 2003.

J. Fridrich, M. Goljan, and R. Du, “Reliable Detection of LSB Steganography in Color and Grayscale Images,” The Workshop on Multimedia & Security: New Challenges ACM, pp. 22–28, 2002.

A. D. Ker, “Steganalysis of LSB matching in grayscale images,” IEEE Signal Processing Letters, vol. 12, no. 6, pp. 441–444, 2005.

C.-K. Chan and L. M. Cheng, “Hiding data in images by simple LSB substitution,” Pattern Recognition, vol. 37, no. 3, pp. 469–474, 2004.

C. Kim, “Data hiding by an improved exploiting modification direction,” Multimedia Tools and Applications, vol. 69, no. 3, pp. 569–584, 2014.

X. Niu, M. Ma, R. Tang, and Z. Yin, “Image steganography via fully exploiting modification direction,” International Journal of Security and Its Applications, vol. 9, no. 5, pp. 243–254, 2015.

W. Hong and T.-S. Chen, “A novel data embedding method using adaptive pixel pair matching,” IEEE Transactions on Information Forensics and Security, vol. 7, no. 1, pp. 176–184, 2012.

J. Mielikainen, “LSB matching revisited,” IEEE Signal Processing Letters, vol. 13, no. 5, pp. 285–287, 2006.

X. Zhang and S. Wang, “Efficient steganographic embedding by exploiting modification direction,” IEEE Communications Letters, vol. 10, no. 11, pp. 781–783, 2006.

R. Chao, H. Wu, C. Lee, and Y. Chu, “A Novel Image Data Hiding Scheme with Diamond Encoding,” EURASIP Journal on Information Security, vol. 2009, no. 1, p. 658047, 2009.

W.-C. Kuo, P.-Y. Lai, C.-C. Wang, and L.-C. Wuu, “A formula diamond encoding data hiding scheme,” Journal of Information Hiding and Multimedia Signal Processing, vol. 6, no. 6, pp. 1167–1176, 2015.

W. Hong, M. Chen, T. Chen, and C. Huang, “An efficient authentication method for AMBTC compressed images using adaptive pixel pair matching,” Multimedia Tools & Applications, vol. 77, no. 4, pp. 4677–4695, 2018.

T. Edwina Alias, D. Mathew, and A. Thomas, “Steganographic Technique Using Secure Adaptive Pixel Pair Matching for Embedding Multiple Data Types in Images,” in Proceedings of the 5th International Conference on Advances in Computing and Communications, ICACC 2015, pp. 426–429, India, September 2015.

J. Pappachan and J. Baby, “Transformed adaptive pixel pair matching technique for colour images,” in Proceedings of the International Conference on Control, Instrumentation, Communication and Computational Technologies, ICCICCT 2015, pp. 192–196, India, December 2015.

H. Zhao, H. Wang, and M. Khurram Khan, “Statistical analysis of several reversible data hiding algorithms,” Multimedia Tools and Applications, vol. 52, no. 2-3, pp. 277–290, 2011.