Exploiting the Security Aspects of Compressive SamplingView this Special Issue
Research Article | Open Access
Chun-Juan Ouyang, Ming Leng, Jie-Wu Xia, Huan Liu, "Vague Sets Security Measure for Steganographic System Based on High-Order Markov Model", Security and Communication Networks, vol. 2017, Article ID 1790268, 13 pages, 2017. https://doi.org/10.1155/2017/1790268
Vague Sets Security Measure for Steganographic System Based on High-Order Markov Model
Security measure is of great importance in both steganography and steganalysis. Considering that statistical feature perturbations caused by steganography in an image are always nondeterministic and that an image is considered nonstationary, in this paper, the steganography is regarded as a fuzzy process. Here a steganographic security measure is proposed. This security measure evaluates the similarity between two vague sets of cover images and stego images in terms of n-order Markov chain to capture the interpixel correlation. The new security measure has proven to have the properties of boundedness, commutativity, and unity. Furthermore, the security measures of zero order, first order, second order, third order, and so forth are obtained by adjusting the order value of n-order Markov chain. Experimental results indicate that the larger n is, the better the measuring ability of the proposed security measure will be. The proposed security measure is more sensitive than other security measures defined under a deterministic distribution model, when the embedding is low. It is expected to provide a helpful guidance for designing secure steganographic algorithms or reliable steganalytic methods.
Security of the steganographic system is the fundamental issue in the field of the information hiding. Image steganography is the technique of hiding information in digital image and trying to conceal the existence of the secret information. The image with and the image without hidden information are called stego image and cover image, respectively . Steganography and steganalysis are in a hide-and-seek game . They try to defeat each other and also develop with each other. In recent years, steganalysis researches have made much head-way [3, 4], and many attempts have been made to build up secure steganographic algorithms [5–8]. Up until now, there is no standard security measure for steganographic system. The security of the steganography always depends on the encryption of the steganography, which contradicts Kerckhoffs’ principle . Hence, it is very necessary to study the security measure which can provide guidance for designing the high-secure steganography and steganalytic algorithms with high performance.
Now, the study of the security measure becomes one of the hotspots in the steganography research field. Researchers have put forward their views from different viewing angels. From the point of view of information theory, Cachin  proposed a security measure in terms of the relative entropy between the probability mass functions (PMF) of the cover images and the stego images. Sullivan et al.  employed the divergence distance of the empirical matrices to define the security measure. They modeled the sequence of image pixels as first-order Markov chain which could capture one adjacent pixel dependency. Furthermore, Zhang et al.  models the images pixels as n-order Markov chain to provide the security measure. Based on game theory, Liu et al.  presented that the counterwork relationship is modeled between steganography side and attack side. In , Schöttle and Böhme studied adaptive steganography while taking the knowledge of the steganalyst into account. Liu and Tang  also provided the security for the adaptive steganography. In , Chandramouli et al. proposed an alternative security measure based on steganalyzer’s ROC (Receiver Operating Characteristic) performance. From the point of feature space, Pevný and Fridrich  provided the MMD (Maximum Mean Discrepancy) by employing a high-dimensional feature space set as the covers models.
The security measures mentioned above all assume that accurate statistical estimations can be obtained from the finite data samples. However, an image is a nonstationary process; its local statistical correlation will change when image is changed slightly. So the statistical features change is nondeterministic after steganography processing. Meanwhile, for a steganographic system, the warden is lack of the knowledge of the cover distribution. Thus, the distribution estimates of the cover and stego image are not stable. So the security measures defined under the deterministic statistical model are hard to apply due to the lack of the accurate distribution.
To address this problem, we regard the steganography as a fuzzy and indeterministic process. The goal of this paper is to provide a practical security measure in terms of the vague sets similarity measure between cover images and the stego images. Particularly, the sequence of image pixels is modeled as an n-order Markov chain to capture the interpixel correlations. The main contributions of this work are as follows:(1)We derive a security measure for a steganographic system which is different from the deterministic ones. The existing security measures are defined by evaluating the difference between cover images and stego images. In contrast, the new security measure is defined by evaluating the similarity between cover images and their stego version.(2)The n-order security measure based on vague sets similarity measure is proven to have the properties of the boundedness, commutativity, and unity. The properties guarantee the security measure is indeed a real distance which indeed satisfies the symmetry and triangle inequality. The boundedness guarantees the new benchmark can measure the steganographic security.(3)Simulation results verify the effectiveness of the new security measure by benchmarking several popular steganographic schemes. When embedding rate is low, the new security measure is more sensitive to reveal the statistical features change than other security measures. Thus, the proposed security measure can provide a better guidance for the design of steganography and steganalysis.
The rest of the paper is organized as follows. Section 2 gives a review of the two security measures with the deterministic statistical distribution model and introduces the -order Markov chain model. The n-order secure measure based on vague sets similarity measure is presented in detail in Section 3. Experimental results are provided in Section 4 to demonstrate the effectiveness and the superiority of the proposed security measure. We draw our conclusions in Section 5.
2. Steganographic Security and Cover Model
2.1. Security Measure Based on Kullback-Leibler (K-L) Divergence
Suppose is the set of all the covers, and it is an assumption that the selections of the covers and stegos from the set can be described by the random variables and on with the probability mass functions (PMF) and , respectively. Cachin  quantified the security of a steganographic system in terms of the Kullback-Leibler (K-L) divergence (sometimes called relative entropy); that is,where is the set of possible pixel values. A steganographic system is called perfectly secure if (1) is zero or ε-secure if is satisfied. The K-L divergence provides a simple yet convenient method for measuring the difference between cover images and stego images.
In fact, we have little information about the PMF involved due to the large dimensionality of the set . So the security measure is usually defined with simplified cover models, such as independent and identically distributed (i.i.d.) ones. The security measure of K-L divergence calculates the difference from the view of the first-order statistical features (such as one-dimensional histogram feature).
2.2. Security Measure Based on Divergence Distance
To account for the dependence of the pixels, Sullivan et al.  employed the first-order Markov chain model to capture the interpixel correlation. The divergence distance was used to quantify the statistical feature perturbations introduced by a steganography between the two empirical matrices of cover images and stego images. Suppose and are two random sequences of the cover image pixels and the stego image pixels, respectively, obtained by a given scanning method. Let and be the empirical matrixes of and S, respectively. The divergence distance is given by where and are the transition probabilities of cover images and stego images, respectively. The transition probability is commonly calculated by the ratio of the total number to the pixel changes from value to value over the total number of possible pixel changes (e.g., for an 8-bit image, the total possible pixel changes number is 256 × 256). The constant is the range of all possible pixel values. Thus, the divergence distance provides the difference between cover images and their stego version from the view of the second-order statistical features (such as two-dimensional histogram feature and difference histogram feature).
The two security measures mentioned above are defined based on the Shannon information theory under the assumption that the image data statistical distribution is deterministic. Most of the security measures proposed later are also defined under the same assumption. However, the image data shows the sceneries in the aspects of gray, texture, shape, and so forth. There are many a kind of indeterministic factors (such as noise) in a steganography process. Therefore, the security measures with the deterministic statistical distribution model cannot measure the security accurately.
2.3. n-Order Markov Chain Model
The weakness of the above two security measure lies in the fact that the image model such as i.i.d and first-order Markov are too simple to capture interpixel dependency. Therefore, here we model the sequence of image pixels as an n-order Markov chain. The n-order Markov chain is a random sequence indexing the image pixels scanned by a given mode. For instance, when , the second-order Markov chain accounting for two adjacent pixels’ correlation meets the following condition:
There are at least two reasons for us to select n-order Markov chain model. First, the model is flexible. When , it turns out to be the i.i.d model, in which the image pixels are assumed to be unrelated. When , the first-order Markov chain can capture only one adjacent pixel dependence. Furthermore, the n-order Markov chain can capture more interpixel relationships among the pixels when . Second, compared with the Markov random field model , the Markov chain model, though simple, is able to calculate the statistical estimation of the image samples. For n-order Markov chain, it is easy to calculate the realistic statistical estimates using the empirical matrixes. In the following, we construct the empirical matrixes of the first-order and second-order Markov chain.
Let be an n-order Markov chain on the finite set , where is the -indexed set of pixels obtained by a row, column, zigzag, or Hilbert scanning method. is the possible gray scale values. When , the first-order Markov chain source is defined by the transition matrixes and marginal probabilities . For a realization, . Let be the number of transitions from values to in . The empirical matrixes are . That is, the element represent the proportion of spatially adjacent pixel pairs with the grayscale value of followed by . Thus the empirical matrixes provide an estimation of the transition matrixes and marginal probabilities. The empirical matrixes are similar to the concurrence matrixes of the image. It can be recognized as a matrix form of the two-dimensional normalized histogram for estimating the joint probability mass function (PMF) of a source image. Similarly, when , we can get the empirical matrixes of the second-order Markov chain, denoted by . is the number of transitions from values to via in . For an 8-bit image, the size of the empirical matrixes is . The element of the empirical matrixes represents the proportion of spatially adjacent pixel group with a grayscale value of followed by and . A simple example of generating the empirical matrixes of first-order and second-order Markov chain is shown in Figure 1.
In Figure 1, the small block is derived from the standard image “Lena.” Its size is , including pixels 164 and 165. The example image pixels are scanned vertically. The size of the empirical matrixes of first-order Markov chain in Figure 1 is . The element represents the proportion of spatially adjacent pixel pairs with (164, 164), (164, 165), (165, 164), and (165, 165). The right-hand side of Figure 1 demonstrates the procedure of the empirical matrixes of second-order Markov chain. Its size is , in which the element represents the proportion of spatially adjacent pixel groups with (164, 164, 164), (164, 165, 164), (165, 164, 164), (165, 165, 164), and so forth.
Since the cover sources are strongly correlated, the probabilities of two adjacency samples are equal or nearly equal. As a result, in the empirical matrixes, the masses are more concentrated near the main diagonal in a correlated source. In , Harmsen and Pearlman considered that information hiding can be viewed as adding the additive noise to the cover image. The secret information (additive noise) is uncorrelated after hiding, and its empirical matrixes spread evenly over the main diagonal. Thus we see that hiding weakens the dependencies among the cover samples, which is illustrated in Figure 2(a). Figure 2(b) is part of the zoomed empirical matrixes. According to the above analysis, the steganography tends to spread the density of the pixels pairs away from the main diagonal of the empirical matrixes. This property may shed some light on designing of the security measure for a steganographic system. Thus, in Section 3, we will propose an n-order security measure in terms of the vague sets similarity measure by modeling the sequence of images pixels as an n-order Markov chain.
(a) The original empirical matrixes
(b) The zoomed empirical matrixes
3. Security Measure Based on Vague Sets Similarity Measure
The vague sets similarity measure [19, 20] describes the matching degree of two vague sets. In a practical steganographic system, there are many indeterministic factors introduced by steganography. In this work, we regard the responding probability distribution sets of the cover samples and the stego samples as two discrete vague sets. Then a new security measure is proposed below in terms of vague sets similarity measure to measure the similarity between cover images and stego images.
3.1. Vague Sets
Roughly speaking, a fuzzy set is a class with fuzzy boundaries. The fuzzy set is a class of objects along with a grade of membership function , . It assigns a single value to each object. This single value combines the evidence for and the evidence against . And it is only a measure of the pros/cons evidence. However, in many practical applications we often require pros and cons evidence simultaneously. Gau and Buehrer  advanced the concept of vague sets. The vague sets theory adopts a true membership function and a false membership function to record the lower bounds on . These lower bounds are used to create a subinterval on , namely, , to generalize of fuzzy sets, where . Vague sets expand the value of the membership function to a subinterval of instead of a single value; thus it has stronger ability to reveal the indeterminacy than the fuzzy set theory. The related definitions of vague sets are as follows.
Definition 1 (vague sets). Let be the universe of discourse, . denotes all the vague sets of , . The vague set is characterized by a true membership function and a false membership function : where is the lower bound on the grade of membership of derived from the evidence for . is a lower bound on the negation of derived from the evidence against , satisfying . The grade of membership of is bounded to a subinterval of . When is discrete, a vague set can be written as
Definition 2. Let be the universe of discourse, . A and are two vague sets of . The entropy of the vague set , , is defined as
Definition 3. Let be the universe of discourse, . A and are two vague sets of . The partial entropy of vague set against vague set , , is defined as
3.2. The n-Order Security Measure Based on Vague Sets Similarity Measure
As discussed in Section 2.3, the n-order Markov chain model can capture sufficient inherent correlations. Additionally, the changes in image statistical features, introduced by steganography, are indeterministic. Therefore, in the new security measure, we model the sequence of the image pixels as an n-order Markov chain. Simultaneously, the empirical matrixes of the n-order Markov chain of cover images and stego images are regarded as two vague sets. Then the n-order security measure based on the vague sets similarity measure is defined as follows.
Suppose and are n-order Markov chain sequence of cover images and stego images, respectively, and then scan them by a given mode (such as horizontal, vertical, zigzag, and Hilbert mode). MC and MS represent the corresponding empirical matrixes. , the element of empirical matrixes, denotes the joint probability distribution from pixels to via the states of and . The is the image pixel value, . denotes the set of all possible values of . Let be the universe of discourse composed of . Then MC and MS are two vague sets on . That is,
Definition 4. Let be the universe of discourse. MC and MS are two vague sets of . The similarity measure between the vague sets MC and MS is defined as the n-order secure measure for a steganographic system; that is,where and denote the entropy of the vague set MC and MS, respectively; stands for the partial entropy of vague set against vague set ; is the partial entropy of vague set MC against vague set MS. and can be written as Similarly, and can be written as Moreover, a steganographic system is called perfectly secure if or -secure if , . .
Theorem 5. Let be the n-order secure measure of a steganographic system based on vague set similarity measure. Then satisfies the following.
(1) Boundedness is (2) Commutativity is (3) Unity is provides a security measure for a steganographic system in terms of the similarity between cover images and stego images. is limited in a finite interval of , where 1 denotes “perfectly secure,” while 0 denotes “definitely unsecure.” However, other security measures under the deterministic statistical model calculate the difference between cover images and stego images. The values range in an infinite interval . The property of the boundedness guarantees the proposed security measure can measure a steganographic algorithm quantitatively. Hence, it has stronger ability to reveal the statistical changes of the cover images. When , the image pixels distribution is said to be i.i.d., and is called the zero-order security measure. When , the sequence of image pixels is considered to be a first-order Markov chain, and is defined as the first-order security measure. Thus, a different order security measure can be obtained by adjusting the value of .
4. Experimental Results and Discussion
In this section, we report experimental results that demonstrate the capability of the new security measure. First of all in Section 4.1 the image databases used for the experiment are described. Afterwards, in Section 4.2, we benchmark several different steganographic methods with -order security measure based on vague sets, with particular attention to the effectiveness of low embedding rate. Finally, we compare the proposed security measure with previously used benchmarks designed under the deterministic statistical model.
4.1. Image Database
For the experimental validation we used two image databases. The first one is BOWS2  image database including 10000 grayscale images with fixed size 512 × 512. The other one is NRCS Photo Gallery . We selected 1500 images from NRCS Photo Gallery. All images were converted into grayscale and central cropped to a size of 512 × 512 for experimental purposes. The images in our experiments show a wide range of scenarios including house, manmade objects, and animal. Some images are shown in Figure 3.
(a) Some images of BOWS2
(b) Some images of NRCS
4.2. Verification of the Effectiveness of the Proposed Security Measure
To evaluate the performance of the proposed method for measuring the security of the steganographic algorithms, the new security measure with different orders is used to measure the security of different steganographic algorithms with different embedding rates. First, we select some spatial-domain steganographic algorithms, including LSBM (least significant bit matching) , , HUGO  (highly undetectable steganography). We use 2000 images from BOWS2 image database; all the images are grayscale with the fixed size 512 × 512. As discussed in Section 2.3, first-order and second-order Markov chain models have captured sufficient interpixel correlations. Additionally, considering the computation complexity, we use the zero-order, first-order, and second-order security measure based on vague sets to measure the LSBM, LSBM2, and HUGO steganographic methods with the embedding rate ranging from 0.1 bpp (bits per pixel) to 1 bpp in a step size of 0.1 bpp. The average measure results for zero-order, first-order, and second-order security measure of 2000 images with different embedding rates are depicted in Figure 4.
(a) Zero-order security measure
(b) First-order security measure
(c) Second-order security measure
In Figure 4, all curves indicate that the value of security measure gradually decreases with an increase in the embedding rate for the same steganographic algorithm. It is consistent with the definition of the security measure based on vague sets. Its value is limited in an interval of , where 1 denotes “perfectly secure” for the steganographic system. Hence the value of the n-order security measure satisfies monotonic decreasing property; that is, the higher the security of the stego images, the larger the value of the security measure. Furthermore, as is evident in Figure 4, the values of the same order security measure are different for different stego schemes with the same embedding rate. Note that obtains the lowest value in Figure 4, implying that it is most unsecure among the three hiding methods under the same condition. On the contrary, HUGO gains the highest value. All the measure results are coincident with the theoretical analysis of the three embedding schemes.
Furthermore, in order to evaluate the measuring ability of different order security measures, we compare the security for the same steganographic algorithm using different order security measures. Figure 6 shows the average measure results of zero-order, first-order, and second-order security measure for LSBM, , and HUGO, respectively. In fact, all the data in Figure 5 is derived from Figure 4. As demonstrated in Figure 5, for the same steganographic method, the values of the zero-order, first-order, and second-order security measure are different at the same embedding rate. It is demonstrated that the value of the first-order security measure is smaller than that of the zero-order measure but larger than that of the second-order measure for the same steganographic method with the same embedding rate. The experiments show that the second-order security measure provides the largest measure interval to reveal the security change of the cover images with the embedding rate ranging from 0.1 bpp to 1 bpp. So we can conclude that second-order security measure can provide more obvious statistical distributed changes caused by steganography.
(a) For HUGO
(b) For LSBM
(c) For LSB2
To further verify the effectiveness of the proposed security measure. We used it to benchmark JPEG steganographic algorithms schemes on different database. And we focus on low payloads to see if any of the test steganographic schemes becomes distinguishable by using the vague sets security measure with finite image sample.
We selected 1500 images from NRCS Photo Gallery. All images were converted into grayscale and central cropped to a size of 512 × 512 for experimental purposes. The images were embedded with pseudorandom payloads with 5%, 10%, 15%, and 20% bpac (bits per nonzero AC coefficient). The tested stego schemes include F3, F5 without shrinkage (nsF5) , Model Based Steganography without deblocking (MB1) , and Model Based Steganography with deblocking (MB2) . The cover images were single-compressed JPEGs with quality factor 70. The measure results using zero-order, first-order, and second-order security measure based on vague sets are showed in Table 1. The data in Table 1 indicates that, for the same steganography, the larger the embedding rate, the lower the value of the same security measure. It also exhibited that, for the same steganography, the higher the order of the security measure, the smaller the value of the security measure, suggesting that second-order security measure can get a value lower than the other two security measures under the same condition.
The data in Table 1 also shows, according to the same order security measure, the MB2 is the least statistically detectable, followed by MB1 and nsF5, while F3 is the most detectable. All the measure results are coincident with the theoretical security among adopted stego algorithms. In a word, the experimental results indicate that the proposed security measure is effective for measuring the security for different steganographic methods on different image database. Meanwhile, the greater the order, the stronger the measure ability of the security measure.
4.3. Comparison with Security Measure under Deterministic Statistical Model
To show the superiority of the proposed security measure , we compare it with two security measures under the deterministic statistical model. One is the Kullback-Leibler (K-L) divergence between the probability mass functions (PMF) proposed by Anderson , denoted by . The other, denoted as , is the divergence distance between the two empirical matrices proposed by Cachin . To be unbiased, the zero-order measure is compared with when is used under the assumption that the image model is i.i.d. Similarly, the first-order measure is compared with since their image pixel sequences are all modeled as the first-order Markov chain. In the experiments, the same 2000 images from BOWS2 are adopted. , , , and are used to measure the security of the HUGO with the embedding rate ranging from 0.05 bpp to 1 bpp in a step size of 0.05 bpp. Figures 6(a) and 6(b) show the average measure of and with different embedding rates, respectively. The average measure values of and are also illustrated in Figures 7(a) and 7(b), respectively.
Looking at Figures 6 and 7, we see that the value of security measure based on vague sets decreases as the embedding rate increases, whereas the value of security measure under the deterministic distribution model increases as the embedding rate increases. All the curves in Figures 6 and 7 indicate that both the security measure models are effective in measuring the security of the steganography. In order to show the superiority of the proposed security measure, we define as the sensitivity of, where is the security measure variation of a given embedding rate change range, andis the total security measure variation of the embedding rate change. Obviously, Figures 6(b) and 7(b) demonstrate that of security measure is very small when embedding rate is lower than 0.5 bpp. So its corresponding security measure is not sensitive to the statistical distribution change. Hence, the new security measure can reveal more obvious statistical change than the security measures under deterministic statistical distribution model when embedding rate is low.
Vague sets similarity measure is a simple yet effective tool for measuring the similarity between two vague sets. In this work, a novel security measure for a steganographic system in terms of the vague sets similarity measure is proposed to measure the similarity between cover images and stego images. Particularly, in the new security measure, the sequence of image pixels is modeled as an n-order Markov chain to capture sufficient interpixel dependencies. The proposed security measure is proven to have such properties as boundedness, commutativity, and unity. Various order security measures can be obtained by adjusting the value of . Experimental results confirm the effectiveness of the proposed security measure for evaluating different steganographic algorithms. Meanwhile, the security measure with a higher order always has a better measure ability. Additionally, when the embedding rate is low, the n-order security measure based on vague sets is more sensitive than other security measures under the deterministic distribution model. Considering the computational complexity and steganalytic ability, two issues should be tackled in our further research. One is how to use the n-order security measure to design reliable steganalytic methods by extracting the statistical feature from the empirical matrixes. The other is how to use the new security measure to design highly secure steganographic algorithms.
Proof of Theorem 5. (1) Since the inequality satisfies , we haveHence , such that .
Since , and are all in the range of and , , and are all positive.
(2) According to the definition of the n-order security measure, is described as And it can also be described as Hence .
(3) From the proving procedure of property (1), we haveIf and only if Namely, when and , such that .
Conflicts of Interest
The authors declare that they have no conflicts of interest.
This work was supported by the National Natural Foundation of China (nos. 61462046, 61363014), the Science and Technology Research Projects of Jiangxi Province Education Department (nos. GJJ16079, GJJ160750), the Natural Science Foundation of Jiangxi Province (nos. 20151BAB207026, 20161BAB202050, and 20161BAB202049), Jinggangshan University Doctoral Scientific Research Foundation (nos. JZB1311, JZB15016), and Key Laboratory of Watershed Ecology and Geographical Environment Monitoring of NASG (nos. WE2015012, WE2016013).
- B. Li, J. He, J. Huang, and Y. Q. Shi, “A survey on image steganography and steganalysis,” Journal of Information Hiding and Multimedia Signal Processing, vol. 2, no. 2, pp. 142–172, 2011.
- X.-P. Zang, Z.-X. Qian, and S. Li, “Prospect of digital steganography research,” Journal of Applied Sciences-Electronics and Information Engineering, vol. 34, no. 5, pp. 475–489, 2016.
- J. Fridrich and J. Kodovský, “Rich models for steganalysis of digital images,” IEEE Transactions on Information Forensics and Security, vol. 7, no. 3, pp. 868–882, 2012.
- V. Holub and J. Fridrich, “Low-complexity features for JPEG steganalysis using undecimated DCT,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 2, article A1, pp. 219–228, 2015.
- V. Sedighi, R. Cogranne, and J. Fridrich, “Content-adaptive steganography by minimizing statistical detectability,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 2, pp. 221–234, 2016.
- N. Zhou, H. Li, D. Wang, S. Pan, and Z. Zhou, “Image compression and encryption scheme based on 2D compressive sensing and fractional Mellin transform,” Optics Communications, vol. 343, pp. 10–21, 2015.
- L. Guo, J. Ni, and Y. Q. Shi, “Uniform embedding for efficient JPEG steganography,” IEEE Transactions on Information Forensics and Security, vol. 9, no. 5, pp. 814–825, 2014.
- N. Zhou, S. Pan, S. Cheng, and Z. Zhou, “Image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing,” Optics and Laser Technology, vol. 82, pp. 121–133, 2016.
- R. Anderson, “Why information security is hard - An economic perspective,” in Proceedings of the 17th Annual Computer Security Applications Conference, ACSAC 2001, pp. 358–365, usa, December 2001.
- C. Cachin, “An information-theoretic model for steganography,” Information and Computation, vol. 192, no. 1, pp. 41–56, 2004.
- K. Sullivan, U. Madhow, S. Chandrasekaran, and B. S. Manjunath, “Steganalysis for Markov cover data with applications to images,” IEEE Transactions on Information Forensics and Security, vol. 1, no. 2, pp. 275–287, 2006.
- Z. Zhang, G. J. Wang, W. Jun et al., “Steganalysis of spread spectrum image steganography based on high-order markov chain mode,” ACTA Electronica Sinica, vol. 38, no. 11, pp. 2578–2584, 2010.
- G.-J. Liu, Y.-W. Dai, Y.-X. Zhao, and Z.-Q. Wang, “Modeling steganographic counterwork by game theory,” Journal of Nanjing University of Science and Technology, vol. 32, no. 2, pp. 199–204, 2008.
- P. Schöttle and R. Böhme, “Game theory and adaptive steganography,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 4, pp. 760–773, 2016.
- J. Liu and G.-M. Tang, “Game research on large-payload and adaptive steganographic counterwork,” Acta Electronica Sinica, vol. 42, no. 10, pp. 1963–1969, 2014.
- R. Chandramouli, M. Kharrazi, and N. Memon, “Image steganography and steganalysis: concepts and practice,” in Proceedings of the IWDW’03, vol. 2939, pp. 35–49, 2003.
- T. Pevný and J. Fridrich, “Benchmarking for steganography,” in Information Hiding. 10th International Workshop, pp. 251–267, Santa Barbara, Calif, USA, 2008.
- J. J. Harmsen and W. A. Pearlman, “Steganalysis of additive noise modelable information hiding,” in Proceedings of the IST/SPIE 15th Annu. Symp. Electronic Imaging Science Technology, pp. 21–24, San Jose, Calif, USA, January 2003.
- F. Li and Z.-Y. Xu, “Measures of similarity between vague sets,” Journal of Software, vol. 12, no. 6, pp. 922–927, 2001.
- S. Y. Quan, “The vague set similarity measure based on Meaning of Information,” Computer Engineering and Applications, vol. 43, no. 25, pp. 87–89, 2007.
- W. L. Gau and D. J. Buehrer, “Vague sets,” IEEE Transactions on Systems, Man and Cybernetics, vol. 23, no. 2, pp. 610–614, 1993.
- P. Bas, T. Filler, and T. Pevny, “Break our steganographic system—the ins and outs of organizing BOSS,” in Proceedings of the 13th International Workshop on Information Hiding, pp. 59–70, Berlin, Germany, 2011.
- United States Department of Agriculture, Natural resources conservation service photo gallery, [DB/OL] http://photogallery.nrcs.usda.gov, 2002.
- T. Sharp, “An implementation of key-based digital signal steganography,” in Proceedings of the Information Hiding Workshop, vol. 2137, pp. 13–26, 2001.
- T. Pevný, T. Filler, and P. Bas, “Using high-dimensional image models to perform highly undetectable steganography,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6387, pp. 161–177, 2010.
- J. Fridrich, D. Soukal, and M. Goljan, “Maximum likelihood estimation of length of secret message embedded using ±K steganography in spatial domain,” in Proceedings of SPIE-IS and T Electronic Imaging - Security, Steganography, and Watermarking of Multimedia Contents VII, vol. 5681, pp. 595–606, January 2005.
- P. Sallee, “Model-Based Steganography,” in Digital Watermarking, T. Kalker, Ed., vol. 2939 of Lecture Notes in Computer Science, pp. 154–167, Springer, Berlin, Heidelberg, 2004.
- P. Sallee, “Model-based methods for steganography and steganalysis,” International Journal of Image and Graphics, vol. 5, no. 1, pp. 167–189, 2005.
Copyright © 2017 Chun-Juan Ouyang et al. 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.