# Patent

## Title
Method for identifying marked images using statistical moments based at least in part on a JPEG array

## Abstract

Briefly, embodiments of a method of identifying marked images, in which higher order statistical moments based at least in part on a JPEG array are employed, is described.

## Background
FIELD
This application is related to classifying or identifying content, such as marked images, for example.
BACKGROUND
In recent years digital data hiding has become an active research field. Various kinds of data hiding methods have been proposed. Some methods aim at content protection, and/or authentication, while some aim at covert communication. The latter category of data hiding is referred to here as steganography.



BRIEF DESCRIPTION OF THE DRAWINGS
Subject matter is particularly pointed out and distinctly claimed in the concluding portion of the specification. Claimed subject matter, however, both as to organization and method of operation, together with objects, features, and/or advantages thereof, may best be understood by reference of the following detailed description if read with the accompanying drawings in which:
FIG. 1 is a schematic diagram illustrating one embodiment of a 2 by 2 array of pixels; and
FIG. 2 is a block diagram illustrating an embodiment of feature generation.



DETAILED DESCRIPTION
In the following detailed description, numerous specific details are set forth to provide a thorough understanding of claimed subject matter. However, it will be understood by those skilled in the art that claimed subject matter may be practiced without these specific details. In other instances, well known methods, procedures, components and/or circuits have not been described in detail so as not to obscure claimed subject matter.
Some portions of the detailed description which follow are presented in terms of algorithms and/or symbolic representations of operations on data bits and/or binary digital signals stored within a computing system, such as within a computer and/or computing system memory. These algorithmic descriptions and/or representations are the techniques used by those of ordinary skill in the data processing arts to convey the substance of their work to others skilled in the art. An algorithm is here, and generally, considered to be a self-consistent sequence of operations and/or similar processing leading to a desired result. The operations and/or processing may involve physical manipulations of physical quantities. Typically, although not necessarily, these quantities may take the form of electrical and/or magnetic signals capable of being stored, transferred, combined, compared and/or otherwise manipulated. It has proven convenient, at times, principally for reasons of common usage, to refer to these signals as bits, data, values, elements, symbols, characters, terms, numbers, numerals and/or the like. It should be understood, however, that all of these and similar terms are to be associated with appropriate physical quantities and are merely convenient labels. Unless specifically stated otherwise, as apparent from the following discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing”, “computing”, “calculating”, “determining” and/or the like refer to the actions and/or processes of a computing platform, such as a computer or a similar electronic computing device, that manipulates and/or transforms data represented as physical electronic and/or magnetic quantities and/or other physical quantities within the computing platform's processors, memories, registers, and/or other information storage, transmission, and/or display devices.
Owing to the popular usage of JPEG images, steganographic tools for JPEG images emerge increasingly nowadays, among which model based steganography (MB), F5 and OutGuess are the most advanced. However, it continues to be desirable to develop new tools to identify images that include hidden data. In accordance with claimed subject matter, one embodiment described herein includes a method based at least in part on statistical moments derived at least in part from an image 2-D array and a JPEG 2-D array. In this particular embodiment, a first order histogram and/or a second order histogram may be employed, although claimed subject matter is not limited in scope in this respect. For example, higher order histograms may be utilized in other embodiments, for example. However, continuing with this particular embodiment, from these histograms, moments of 2-D characteristic functions are also used, although, again, other embodiments are not limited in this respect. For example, higher order moments may be employed.
The popularity of computer utilization accelerates the wide spread use of the Internet. As a result, millions of pictures flow on the Internet everyday. Nowadays, the interchange of JPEG (Joint Photographic Experts Group) images becomes more and more frequent. Many steganographic techniques operating on JPEG images have been published and have become publicly available. Most of the techniques in this category appear to modify an 8×8 block discrete cosine transform (BDCT) coefficients in the JPEG domain to embed hidden data. Among the steganographic techniques, the recent published schemes, OutGuess, F5, and the model-based steganography (MB) appear to be the most advanced. See, N. Provos, “Defending against statistical steganalysis,” 10th USENIX Security Symposium, Washington D.C., USA, 2001; A. Westfeld, “F5 a steganographic algorithm: High capacity despite better steganalysis,” 4th International Workshop on Information Hiding, Pittsburgh, Pa., USA, 2001; P. Sallee, “Model-based steganography,” International Work-shop on Digital Watermarking, Seoul, Korea, 2003. OutGuess embeds the to-be-hidden data using redundancy of the cover image. In this context, the cover image refers to the content without the hidden data embedded. For JPEG images, OutGuess attempts to preserve statistics based at least in part on the BDCT histogram. To further this, OutGuess identifies redundant BDCT coefficients and embeds data into these coefficients to reduce effects from data embedding. Furthermore, it adjusts coefficients in which data has not been embedded to attempt to preserve the original BDCT histogram. F5, developed from Jsteg, F3, and F4, employs the following techniques: straddling and matrix coding. Straddling scatters the message as uniformly distributed as possible over a cover image. Matrix coding tends to improve embedding efficiency (defined here as the number of embedded bits per change of the BDCT coefficient). MB embedding tries to make the embedded data correlated to the cover medium. This is implemented by splitting the cover medium into two parts, modeling the parameter of the distribution of the second part given the first part, encoding the second part by using the model and to-be-embedded message, and then combining the two parts to form the stego medium. Specifically, the Cauchy distribution is used to model the JPEG BDCT mode histogram and the embedding attempts to keep the lower precision histogram of the BDCT modes unchanged.
To detect hidden information in a stego image, many steganalysis methods have been proposed. A universal steganalysis method using higher order statistics has been proposed by Farid. See H. Farid, “Detecting hidden messages using higher-order statistical models”, International Conference on Image Processing, Rochester, N.Y., USA, 2002. (hereinafter, “Farid”) Quadrature mirror filters are used to decompose a test image into wavelet subbands. The higher order statistics are calculated from wavelet coefficients of high-frequency subbands to form a group of features. Another group of features is similarly formulated from the prediction errors of wavelet coefficients of high-frequency subband. In Y. Q. Shi, G. Xuan, D. Zou, J. Gao, C. Yang, Z. Zhang, P. Chai, W. Chen, C. Chen, “Steganalysis based on moments of characteristic functions using wavelet decomposition, prediction-error image, and neural network,” International Conference on Multimedia and Expo, Amsterdam, Netherlands, 2005, (hereinafter, “Shi et al.), a described method employs statistical moments of characteristic functions of a test image, its prediction-error image, and their discrete wavelet transform (DWT) subbands as features.
However, steganalysis method specifically designed for addressing JPEG steganographic schemes has been proposed by Fridrich. See J. Fridrich, “Feature-based steganalysis for JPEG images and its implications for future design of steganographic schemes,” 6th Information Hiding Workshop, Toronto, ON, Canada, 2004. With a relatively small-size set of well-selected features, this method outperforms other steganalysis methods, such as those previously mentioned, when detecting images that have hidden data created by OutGuess, F5 and MB. See M. Kharrazi, H. T. Sencar, N. D. Memon, “Benchmarking steganographic and steganalysis techniques”, Security, Steganography, and Watermarking of Multimedia Contents 2005, San Jose, Calif., USA, 2005.
As suggested above, in contrast to these, an embodiment described herein provides a method based at least in part on statistical moments derived at least in part from image 2-D array and JPEG 2-D array. In this particular embodiment, first order histograms and/or second order histograms may be employed, although in other embodiments higher order histograms may also or alternately be employed, depending, for example, on the application and a host of other possible factors. However, for this embodiment, the moments of 2-D characteristic functions are also therefore utilized for steganalysis.
In this context, steganalysis is considered as a task of two-class pattern recognition. Thus, a test image, for example, may be classified as either a stego image (with hidden data) or as a non-stego image (without hidden data). As described in the previously referenced work, Shi et al., 78-D feature vectors are used in steganalysis, although claimed subject matter is not limited in scope in this respect. Nonetheless, as described in Shi et al., the first half of features are generated based at least in part on a given test image and its 3-level Haar wavelet decomposition. The second half of features are based at least in part on the prediction-error image and its 3-level Haar wavelet decomposition. Denoting the test image and the prediction-error image as the LL0 subbands, provides 26 subbands. The discrete Fourier transform of a histogram of an image is referred to in this context as a characteristic function (CF). Thus, in Shi et al. the CF of these subbands is calculated. The first three absolute moments of these CF's are used to form the 78-D feature vectors. The absolute moments are defined as follows:




  
    
      
        
          
            M
            n
          
          =
          
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  /
                  2
                
              
              ⁢
              
                
                  x
                  i
                  n
                
                ⁢
                
                  
                  
                    H
                    ⁡
                    
                      (
                      
                        x
                        i
                      
                      )
                    
                  
                  
                
              
            
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  /
                  2
                
              
              ⁢
              
                
                
                  H
                  ⁡
                  
                    (
                    
                      x
                      i
                    
                    )
                  
                
                
              
            
          
        
        ,
      
    
    
      
        (
        1
        )
      
    
  




where H(xi) is the CF component at frequency xi and N is the total number of different value level of coefficients in a subband under consideration. A prediction-error image here is the difference between the original image and the prediction image. A prediction is illustrated by (2) below and a 2 by 2 array shown in FIG. 1.





  
    
      
        
          x
          ^
        
        =
        
          {
          
            
              
                
                  
                    max
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                  ,
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    c
                  
                  ≤
                  
                    min
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                
              
            
            
              
                
                  
                    min
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                  ,
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    c
                  
                  ≥
                  
                    max
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                
              
            
            
              
                
                  
                    a
                    +
                    b
                    -
                    c
                  
                  ,
                
              
              
                otherwise
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




This particular embodiment departs from this prior approach. For example, as previously suggest, this embodiment now includes statistical moments derived at least in part from a JPEG 2-D array associated with the image. For example, consider a 2-D array generated by applying an 8×8 block DCT to the image followed by quantization using a JPEG quantization table. Note that these quantized JPEG BDCT coefficients may be either positive, or negative, or zero. Therefore, in this embodiment, apply the absolute value to the coefficients, as how by 205 in FIG. 2. This resultant 2-D array is referred to here for this embodiment as a JPEG 2-D array.
Applying the procedure previously referred to from Shi et al. to this JPEG 2-D array results in another set of 78 features. This is illustrated in part by block diagram 200 of FIG. 2 and processing illustrated as being applied to a frequency domain representation of the image, here a block DCT representation. For this embodiment, the moments of the CF's are defined as in Equation (1), where N is the total number of different absolute values of JPEG quantized BDCT coefficients in a subband under consideration, although claimed subject matter is not limited in scope in this respect. In this particular embodiment, computing a prediction-error 2-D array from the JPEG 2-D array, however, is not precisely the same as computing a predication error 2-D array for the image. For those zero elements in the JPEG 2-D array, prediction values for zero element in the JPEG 2-D array are set as zero, as shown in Equation (3). Thus, in this embodiment, zero DCT coefficients remain zero in the prediction-error 2-D array. Furthermore, an absolute-value operation is applied to produce a prediction error 2-D array, as shown by 215 of FIG. 2.




  
    
      
        
          x
          ^
        
        =
        
          {
          
            
              
                
                  0
                  ,
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    x
                  
                  =
                  0
                
              
            
            
              
                
                  
                    max
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                  ,
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    c
                  
                  ≤
                  
                    min
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                
              
            
            
              
                
                  
                    min
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                  ,
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    c
                  
                  ≥
                  
                    max
                    ⁡
                    
                      (
                      
                        a
                        ,
                        b
                      
                      )
                    
                  
                
              
            
            
              
                
                  
                    a
                    +
                    b
                    -
                    c
                  
                  ,
                
              
              
                
                  otherwise
                  .
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




Modern steganographic schemes, such as OutGuess and MB, try to keep a histogram change as slight as possible in order to resist identification or detection. For instance, MB embedding attempts to keeps the lower precision histogram of the BDCT modes relatively unchanged. Thus, higher order histograms and moments may be useful in this context.
A second-order histogram may provide a measure of the joint occurrence of pairs of pixels separated by a specified distance and orientation. Denote the distance by ρ, and the angle with respect to the horizontal axis by θ. The second-order histogram is defined as




  
    
      
        
          
            
              h
              d
            
            ⁡
            
              (
              
                
                  j
                  1
                
                ,
                
                  
                    j
                    2
                  
                  ;
                  ρ
                
                ,
                θ
              
              )
            
          
          =
          
            
              N
              ⁡
              
                (
                
                  
                    j
                    1
                  
                  ,
                  
                    
                      j
                      2
                    
                    ;
                    ρ
                  
                  ,
                  θ
                
                )
              
            
            
              
                N
                T
              
              ⁡
              
                (
                
                  ρ
                  ,
                  θ
                
                )
              
            
          
        
        ,
      
    
    
      
        (
        4
        )
      
    
  




where N(j1,j1; ρ,θ) is the number of pixel pairs for which the first pixel value is i1 while the second pixel value is i2, and NT(ρ,θ) is the total number of pixel pairs in the image with separation (ρ,θ). A second-order histogram may also be used in JPEG 2-D array, although claimed subject matter is not limited in scope in this respect. A second-order histogram corresponds to a 2-D array, often called dependency matrix or co-occurrence matrix.

For a wavelet subband derived at least in part from a JPEG 2-D array, three second-order histograms are generated with the following three separations:





  
    
      
        
          
            (
            
              ρ
              ,
              θ
            
            )
          
          =
          
            {
            
              
                (
                
                  1
                  ,
                  0
                
                )
              
              ,
              
                (
                
                  1
                  ,
                  
                    -
                    
                      π
                      2
                    
                  
                
                )
              
              ,
              
                (
                
                  1
                  ,
                  
                    -
                    
                      π
                      4
                    
                  
                
                )
              
            
            }
          
        
        ,
      
    
    
      
        (
        5
        )
      
    
  




which are referred to here as a horizontal 2-D histogram, a vertical 2-D histogram, and a diagonal 2-D histogram, respectively. For example, looking at FIG. 1, the pair (x, a), (x, b), (x, c) are separated by (1, 0), (1,−π/2) and respectively. After applying a 2-D DFT to the second-order histograms to obtain 2-D CF's, the two marginal moments of 2-D CF's may be calculated by





  
    
      
        
          
            M
            
              u
              ,
              n
            
          
          =
          
            
              
                ∑
                
                  j
                  =
                  1
                
                
                  N
                  /
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  
                    N
                    /
                    2
                  
                
                ⁢
                
                  
                    u
                    i
                    n
                  
                  ⁢
                  
                    
                    
                      H
                      ⁡
                      
                        (
                        
                          
                            u
                            i
                          
                          ,
                          
                            v
                            j
                          
                        
                        )
                      
                    
                    
                  
                
              
            
            
              
                ∑
                
                  j
                  =
                  1
                
                
                  N
                  /
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  
                    N
                    /
                    2
                  
                
                ⁢
                
                  
                  
                    H
                    ⁡
                    
                      (
                      
                        
                          u
                          i
                        
                        ,
                        
                          v
                          j
                        
                      
                      )
                    
                  
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        6
        )
      
    
  
  
    
      
        
          
            M
            
              v
              ,
              n
            
          
          =
          
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  /
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  
                    N
                    /
                    2
                  
                
                ⁢
                
                  
                    v
                    j
                    n
                  
                  ⁢
                  
                    
                    
                      H
                      ⁡
                      
                        (
                        
                          
                            u
                            i
                          
                          ,
                          
                            v
                            j
                          
                        
                        )
                      
                    
                    
                  
                
              
            
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  /
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  
                    N
                    /
                    2
                  
                
                ⁢
                
                  
                  
                    H
                    ⁡
                    
                      (
                      
                        
                          u
                          i
                        
                        ,
                        
                          v
                          j
                        
                      
                      )
                    
                  
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        7
        )
      
    
  




where H(ui,vj) is the 2-D CF component at frequency (ui,vj) and N is the total number of different absolute values of coefficients in a subband under consideration. For a direction, we can generate two marginal moments according to Equations (6) and (7), we thus have, in this embodiment, an additional 78×3=234 feature components. Hence, for this embodiment, we have 390-D feature vectors, as shown in FIG. 2, although claimed subject matter is not limited in scope in this respect.

A variety of techniques are available to analyze data, here referred to as features, in a variety of contexts. In this context, we use the term “analysis of variance process” to refer to processes or techniques that may be applied so that differences attributable to statistical variation are sufficiently distinguished from differences attributable to non-statistical variation to correlate, segment, classify, analyze or otherwise characterize data based at least in part on application of such processes or techniques. Examples, without intending to limit the scope of claimed subject matter includes: artificial intelligence techniques and processes, including pattern recognition; neutral networks; genetic processes; heuristics; and support vector machines (SVM).
Although claimed subject matter is not limited in scope to SVM or SVM processes, it may be a convenient approach for two-class classification. See, for example, C. Cortes and V. Vapnik, “Support-vector networks,” in Machine Learning, 20, 273-297, Kluwer Academic Publishers, 1995. SVM may, for example, be employed to handle linear and non-linear cases or situations. For linearly separable cases, for example, an SVM classifier may be applied to search for a hyper-plane that separates a positive pattern from a negative pattern. For a non-linearly separable case, a “learning machine” may map input feature vectors to a higher dimensional space in which a linear hyper-plane may potentially be located. In this embodiment, a transformation from non-linear feature space to linear higher dimensional space may be performed using a kernel function. Examples of kernels include: linear, polynomial, radial basis function and sigmoid. For this particular embodiment, a linear kernel may be employed in connection with a linear SVM process, for example. Likewise, other kernels may be employed in connection with a non-linear SVM process.
Thus, while Shi et al. employed neural networks, for this embodiment a support vector machine (SVM) is used as a classifier. This particular embodiment, as described below, employs a polynomial kernal, although, again, claimed subject matter is not limited in scope in this respect.
Having formulated an embodiment system for identifying or classifying marked content, such as images, for example, it is desirable to construct and evaluate performance. However, again, we note that this is merely a particular embodiment for purposes of illustration and claimed subject matter is not limited in scope to this particular embodiment or approach.
An image database comprising 7,560 JPEG images with quality factors ranging from 70 to 90 was employed. One third of these images were an essentially random set of pictures taken at different times and places with different digital cameras. The other two thirds were downloaded from the Internet. Each image was cropped (central portion) to the size of either 768×512 or 512×768.
This performance evaluation is focused on detecting Outguess, F5, and MB1 steganography. The codes for these three approaches are publicly available. See http://www.outguess.org/; http://wwwrn.inf.tu-dresden.de/ ̃westfeld/f5.html; http://redwood.ucdavis.edu/phil/papers/iwdw03.htm. Since there are quite a few zero BDCT coefficients in the JPEG images and the quantity of zero coefficients varies, the data embedding capacity differs from image to image. A common practice is to use the ratio between the length of hidden data and the number of non-zero BDCT AC coefficients as the measure of data embedding capacity for JPEG images. For OutGuess, 0.05, 0.1, and 0.2 bpc (bits per non-zero BDCT AC coefficient) were embedded. The resultant numbers of stego image were 7498, 7452, and 7215, respectively. For F5 and MB1, 0.05, 0.1, 0.2, and 0.4 bpc were embedded, which provides 7560 stego images. Note that the step size of MB1 embedding equals to two for this evaluation.
One half of the images (and the associated stego image) were randomly selected to train the SVM classifier and the remaining pairs were employed to evaluate the trained classifier. Approaches previously discussed, such as Farid's, Shi et al.'s, Fridrich's, as well the previously described embodiment were applied to evaluation detection of OutGuess, F5 and MB schemes. The results shown in Table 1 are the arithmetic average of 20 random experiments.












TABLE 1









Farid's
Shi et al.'s
Fridrich's
Our Proposed





















bpc
TN
TP
AR
TN
TP
AR
TN
TP
AR
TN
TP
AR
























OG
0.05
59.0
57.6
58.3
55.6
58.5
57.0
49.8
75.4
62.6
71.2
70.8
71.0


OG
0.1
70.0
63.5
66.8
61.4
66.3
63.9
68.9
83.3
76.1
84.3
87.3
85.8


OG
0.2
81.9
75.3
78.6
72.4
77.5
75.0
90.0
93.6
91.8
93.0
95.6
94.3


F5
0.05
55.6
45.9
50.8
57.9
45.0
51.5
46.1
61.0
53.6
53.2
54.4
53.8


F5
0.1
55.5
48.4
52.0
54.6
54.6
54.6
58.4
63.3
60.8
58.8
61.6
60.2


F5
0.2
55.7
55.3
55.5
59.5
63.3
61.4
77.4
77.2
77.3
72.8
76.2
74.5


F5
0.4
62.7
65.0
63.9
71.5
77.1
74.3
92.6
93.0
92.8
89.9
92.3
91.1


MB1
0.05
48.5
53.2
50.8
57.0
49.2
53.1
39.7
66.9
53.3
65.2
59.0
62.1


MB1
0.1
51.9
52.3
52.1
57.6
56.6
57.1
45.6
70.1
57.9
74.9
75.7
75.3


MB1
0.2
52.3
56.7
54.5
63.2
66.7
65.0
58.3
77.5
67.9
86.8
90.6
88.7


MB1
0.4
55.3
63.6
59.4
74.2
80.0
77.1
82.9
86.8
84.8
94.2
97.0
95.6





Please note that for table 1 the units are %; OG stands for OutGuess, TN stands for true negative rate, TP stands for true positive rate, and AR stands for accuracy.






It will, of course, be understood that, although particular embodiments have just been described, the claimed subject matter is not limited in scope to a particular embodiment or implementation. For example, one embodiment may be in hardware, such as implemented to operate on a device or combination of devices, for example, whereas another embodiment may be in software. Likewise, an embodiment may be implemented in firmware, or as any combination of hardware, software, and/or firmware, for example. Likewise, although claimed subject matter is not limited in scope in this respect, one embodiment may comprise one or more articles, such as a storage medium or storage media. This storage media, such as, one or more CD-ROMs and/or disks, for example, may have stored thereon instructions, that when executed by a system, such as a computer system, computing platform, or other system, for example, may result in an embodiment of a method in accordance with claimed subject matter being executed, such as one of the embodiments previously described, for example. As one potential example, a computing platform may include one or more processing units or processors, one or more input/output devices, such as a display, a keyboard and/or a mouse, and/or one or more memories, such as static random access memory, dynamic random access memory, flash memory, and/or a hard drive. For example, a display may be employed to display one or more queries, such as those that may be interrelated, and or one or more tree expressions, although, again, claimed subject matter is not limited in scope to this example.
In the preceding description, various aspects of claimed subject matter have been described. For purposes of explanation, specific numbers, systems and/or configurations were set forth to provide a thorough understanding of claimed subject matter. However, it should be apparent to one skilled in the art having the benefit of this disclosure that claimed subject matter may be practiced without the specific details. In other instances, well known features were omitted and/or simplified so as not to obscure the claimed subject matter. While certain features have been illustrated and/or described herein, many modifications, substitutions, changes and/or equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and/or changes as fall within the true spirit of claimed subject matter.

## Claims

1. A method of classifying an image comprising:
generating, in a device configured to process images, features based at least in part on a block frequency domain representation of said image, wherein at least one of said features is based at least in part on one or more statistical moments generated based at least in part on at least one second order histogram of said block frequency domain representation of said image, wherein a second-order histogram is defined as





  
    
      
        h
        d
      
      ⁡
      
        (
        
          
            
              
                j
                1
              
              ⁢
              
                j
                2
              
            
            ;
            ρ
          
          ,
          θ
        
        )
      
    
    =
    
      
        N
        ⁡
        
          (
          
            
              j
              1
            
            ,
            
              
                j
                2
              
              ;
              ρ
            
            ,
            θ
          
          )
        
      
      
        
          N
          T
        
        ⁡
        
          (
          
            ρ
            ,
            θ
          
          )
        
      
    
  
  ,



 where N(j1,j2;ρ,θ) is a number of pixel pairs for which the first pixel value is j1 while the second pixel value is j2, where the distance between pixels is defined as ρ and the angle between pixels, with respect to horizontal, is θ, and where NT(ρ,θ) is the total number of pixel pairs in the image with separation (ρ,θ); and
classifying said image based at least in part on said generated features.

2. The method of claim 1, wherein said block frequency domain representation comprises a block discrete cosine transform (DCT) representation.

3. The method of claim 2, wherein said block DCT representation comprises a two-dimensional JPEG array of said image.

4. The method of claim 1, wherein said image is classified as either a stego image or a non-stego image.

5. The method of claim 1, wherein said generating features includes generating a prediction image and a prediction error image based at least in part on said image.

6. The method of claim 1, wherein said generating features includes generating a two-dimensional prediction error array based at least in part on said block frequency domain representation of said image.

7. The method of claim 1, wherein classifying said image comprises applying a trained classifier to said generated features, wherein the trained classifier is trained based on features generated from a set of test images.

8. The method of claim 7, wherein said trained classifier is trained based at least in part on statistical moments of frequency domain representations of the set of test images.

9. The method of claim 8, wherein said frequency domain representations of images comprise block DCT representations.

10. The method of claim 9, wherein said block DCT representations comprise JPEG representations.

11. The method of claim 1, wherein said features include at least one third-order statistical moment.

12. The method of claim 1, wherein said generating comprises generating at least one of said statistical moments based at least in part on a characteristic function obtained from the at least one second order histogram.

13. An article comprising:
a storage medium having stored thereon instructions that, upon execution by a computing device, result in operations comprising:
generating features based at least in part on a block frequency domain representation of an image, wherein at least one of said features is based at least in part on one or more statistical moments generated based at least in part on at least one second order histogram of said block frequency domain representation of said image, wherein a second-order histogram is defined as






  
    
      
        h
        d
      
      ⁡
      
        (
        
          
            
              
                j
                1
              
              ⁢
              
                j
                2
              
            
            ;
            ρ
          
          ,
          θ
        
        )
      
    
    =
    
      
        N
        ⁡
        
          (
          
            
              j
              1
            
            ,
            
              
                j
                2
              
              ;
              ρ
            
            ,
            θ
          
          )
        
      
      
        
          N
          T
        
        ⁡
        
          (
          
            ρ
            ,
            θ
          
          )
        
      
    
  
  ,




 where N(j1,j2;ρ,θ) is a number of pixel pairs for which the first pixel value is j1 while the second pixel value is j2, where the distance between pixels is defined as ρ and the angle between pixels, with respect to horizontal, is θ, and where NT(ρ,θ) is the total number of pixel pairs in the image with separation (ρ,θ); and

classifying said image based at least in part on said generated features.

14. The article of claim 13, wherein said block frequency domain representation comprises a block discrete cosine transform (DCT) representation.

15. The article of claim 14, wherein said block DCT representation comprises a two-dimensional JPEG array of said image.

16. The article of claim 13, wherein said instructions upon execution further result in said image being classified as either a stego image or a non-stego image.

17. The article of claim 13, wherein said instructions upon execution further result in said generating features including generating a prediction image and a prediction error image based at least in part on said image.

18. The article of claim 13, wherein said instructions upon execution further result in said generating features including generating a two-dimensional prediction error array based at least in part on said block frequency domain representation of said image.

19. The article of claim 13, wherein classifying said image comprises applying a trained classifier to said generated features, wherein the trained classifier is trained based on features generated from a set of test images.

20. The article of claim 19, wherein said instructions upon execution further result in said trained classifier being trained based at least in part on statistical moments of frequency domain representations of the set of test images.

21. The article of claim 20, wherein said frequency domain representations of images comprise block DCT representations.

22. The article of claim 21, wherein said block DCT representations comprise JPEG representations.

23. The article of claim 13, wherein said features include at least one third-order statistical moment.

24. The article of claim 13, wherein said generating comprises generating at least one of said statistical moments based at least in part on a characteristic function obtained from the at least one second order histogram.

25. An apparatus comprising:
means for generating classification features based at least in part on a block frequency domain representation of said image, wherein at least one of said classification features is based at least in part on one or more statistical moments generated based at least in part on at least one second order histogram of said block frequency domain representation of said image, wherein a second-order histogram is defined as





  
    
      
        h
        d
      
      ⁡
      
        (
        
          
            
              
                j
                1
              
              ⁢
              
                j
                2
              
            
            ;
            ρ
          
          ,
          θ
        
        )
      
    
    =
    
      
        N
        ⁡
        
          (
          
            
              j
              1
            
            ,
            
              
                j
                2
              
              ;
              ρ
            
            ,
            θ
          
          )
        
      
      
        
          N
          T
        
        ⁡
        
          (
          
            ρ
            ,
            θ
          
          )
        
      
    
  
  ,



 where N(j1,j2;ρ,θ) is a number of pixel pairs for which the first pixel value is j1 while the second pixel value is j2, where the distance between pixels is defined as ρ and the angle between pixels, with respect to horizontal, is θ, and where NT(ρ,θ) is the total number of pixel pairs in the image with separation (ρ,θ); and
means for classifying said image based at least in part on said generated classification features.

26. The apparatus of claim 25, wherein said block frequency domain representation comprises a block discrete cosine transform (DCT) representation.

27. The apparatus of claim 26, wherein said block DCT representation comprises a two-dimensional JPEG array of said image.

28. The apparatus of claim 25, wherein said means for classifying comprises a means for classifying an image as either a stego image or a non-stego image.

29. The apparatus of claim 25, wherein said means for generating classification features includes means for generating a prediction image and a prediction error image based at least in part on said image.

30. The apparatus of claim 25, wherein said means for generating classification features includes means for generating a two-dimensional prediction error array based at least in part on said block frequency domain representation of said image.

31. The apparatus of claim 25, further comprising:
means for applying a training set to said means for classifying, wherein said training set comprises a set of classification features generated based on a set of training images.

32. The apparatus of claim 31, wherein said training set comprises one or more statistical moments of frequency domain representations of the set of training images.

33. The apparatus of claim 32, wherein said frequency domain representations of images comprise block DCT representations.

34. The apparatus of claim 33, wherein said block DCT representations comprise JPEG representations.

35. The apparatus of claim 25, wherein said classification features include at least one third-order statistical moment.

36. An apparatus for analyzing an image, comprising:
a frequency domain transformer configured to process the image and provide a block frequency domain representation of the image;
at least one statistical moment generator configured to generate a first set of image features based at least in part on the block frequency domain representation, the first set of image features including one or more statistical moments generated based at least in part on at least one second order histogram of said block frequency domain representation, wherein a second-order histogram is defined as





  
    
      
        h
        d
      
      ⁡
      
        (
        
          
            
              
                j
                1
              
              ⁢
              
                j
                2
              
            
            ;
            ρ
          
          ,
          θ
        
        )
      
    
    =
    
      
        N
        ⁡
        
          (
          
            
              j
              1
            
            ,
            
              
                j
                2
              
              ;
              ρ
            
            ,
            θ
          
          )
        
      
      
        
          N
          T
        
        ⁡
        
          (
          
            ρ
            ,
            θ
          
          )
        
      
    
  
  ,



 where N(j1,j2;ρ,θ) is a number of pixel pairs for which the first pixel value is j1 while the second pixel value is j2, where the distance between pixels is defined as ρ and the angle between pixels, with respect to horizontal, is θ, and where NT(ρ,θ) is the total number of pixel pairs in the image with separation (ρ,θ); and
a classifier configured to classify the image based at least in part of the first set of image features.

37. The apparatus of claim 36, further comprising:
at least one histogram former configured to obtain at least one frequency domain histogram based on the block frequency domain transformation, wherein at least one statistical moment generator is configured to form one or more of the first set of image features based on the at least one frequency domain histogram.

38. The apparatus of claim 37, wherein the at least one histogram former is configured to provide at least one frequency domain histogram selected from the group consisting of a horizontal two-dimensional (2-D) histogram, a vertical 2-D histogram, and a diagonal 2-D histogram.

39. The apparatus of claim 36, further comprising:
an error predictor configured to obtain a 2-D prediction error array based on the block frequency domain representation, wherein at least one statistical moment generator forms one or more of the first set of image features based on the 2-D prediction error array based on the block frequency domain representation.

40. The apparatus of claim 36, further comprising:
a histogram former configured to obtain an image histogram based on a spatial representation of the image;
wherein at least one statistical moment generator is configured to generate a second set of image features based on the image histogram; and
wherein the classifier is further configured to classify the image based on the second set of image features.

41. The apparatus of claim 40, further comprising:
an error predictor to obtain a 2-D prediction error array based on a spatial representation of the image;
wherein at least one statistical moment generator is configured to generate at least a portion of the second set of image features based on the 2-D prediction error array based on the spatial representation of the image.

42. The apparatus of claim 36, wherein the apparatus is configured to operate the frequency domain transformer and the at least one statistical moment generator on one or more training images to generate at least one set of training features and to train the classifier based on the at least one set of training features.

43. The apparatus of claim 36, wherein at least one said statistical moment generator is configured to generate at least one image feature corresponding to a third-order statistical moment.