# DRHNet: A Deep Residual Network Based on Heterogeneous Kernel for Steganalysis

Authors: Yang Xu; Zixi Fu; Guiyong Xu; Sicong Zhang; Xiaoyao Xie
Journal: Security and Communication Networks
 (2020)

---

## Abstract

Convolutional neural networks as steganalysis have problems such as poor versatility, long training time, and limited image size. For these problems, we present a heterogeneous kernel residual learning framework called DRHNet—Dual Residual Heterogeneous Network—to save time on the networks during the training phase. Instead of using the image as an input of the network, we extract and merge the images into a feature matrix using the rich model and use the generated feature matrix as the real input of the network. The architecture we proposed has good versatility and can reduce the computation and the number of parameters while still getting higher accuracy. On BOSSbase 1.01, we evaluate the performance of DRHNet in the setting of the spatial domain and frequency domain. The preliminary experimental results show that DRHNet shows excellent steganalysis performance against the state-of-the-art steganographic algorithms.


---

## Body

## 1. Introduction

As the most commonly used scheme of modern steganography, the least significant bit (LSB) will inevitably change the correlation between adjacent pixels of the image and the correlation of adjacent pixels of the residual image (high-frequency component) of the image [1, 2]. Before the renaissance of the neural network, the mainstream steganographic analysis method extracts the statistic that can describe the correlation of adjacent pixels of the residual image as a steganographic analysis feature and then uses the machine learning tool to train the steganographic analysis classifier [3, 4].Convolutional neural network (CNN) has been widely used in the field of image classification [5–7]. Since steganalysis can be regarded as a two-class problem for images, the goal is to determine whether an image is embedded with the ciphertext. Steganalysis began to use convolutional neural networks to attack steganography. Qian et al. [8] first proposed the application of convolutional neural networks to steganalysis. They described a neural network steganalyzer with a Gaussian activation function equipped with a fixed preprocessing high-pass KV filter. The high-pass KV filter was used to suppress the image content, thus improving the signal-to-noise ratio (SNR) between the stego signal and the host image. Ye et al. [9] proposed a new network in which rather than a random strategy, the weights in the first layer of the proposed CNN are initialized with the basic high-pass filter set used in the calculation of residual maps in the spatial rich model (SRM), which acts as a regularizer to suppress the image content effectively. To better capture the structure of embedding signals, which usually have extremely low SNR (stego signal to image content), a new activation function called truncated linear unit (TLU) is adopted in their CNN model. Boroumand et al. [10] described a deep residual architecture, SRNet, designed to minimize the use of heuristics and externally enforced elements that are universal in the sense that it provides state-of-the-art detection accuracy for both spatial domain and JPEG steganography. The key part of the proposed architecture is a significantly expanded front part of the detector that “computes noise residuals” in which pooling has been disabled to prevent suppression of the stego signal.The problem with using neural networks as a steganographic analysis tool is that it is impossible to analyze larger sized images due to limitations in computer resources. And the versatility of such steganographic analysis tools is not good; that is, a network trained with a steganographic algorithm cannot analyze images with another steganographic algorithm. Finally, the training time of the neural network is too long.In this paper, we propose a heterogeneous kernel residual learning framework to save time on the networks during the training phase. Experimental results show that the DRHNet detection error achieves less than 10% when using S-UNIWARD [11] as the steganography algorithm, and the payload is 0.4 bpp. In summary, we make the following contributions in this paper:(i)
We address the accuracy-computation-time problem by introducing a versatile deep residual learning for steganalysis.(ii)
Instead of using the image as an input to the network, we extract and merge the images into a feature matrix through the rich model and use the generated feature matrix as the real input of the network.(iii)
The heterogeneous kernel is used as the convolution kernel of the network that we proposed. The heterogeneous kernel is adopted to reduce network parameters and reduce computational complexity.


## 2. Preliminaries

### 2.1. Feature Selection Method

The spatial rich model (SRM) [12] is a typical image steganographic analysis method. It designs a wide variety of spatial high-pass filters and uses these filters to filter the image to obtain a rich variety of residual images; then, it separately counts the frequency of occurrence of each adjacent residual sample pattern in a residual image. The cooccurrence matrix of the residual image is obtained. Finally, the elements of the cooccurrence matrix are rearranged into vectors as a steganographic analysis feature. The JPEG rich model (JRM) is the image steganographic analysis method that is widely used in the JPEG domain. JRM is similar to SRM. The only difference is that the features of JRM consist of the second-order cooccurrence matrices of the block coefficients of JPEG and their residual. However, the features of SRM are composed of the fourth-order cooccurrence matrices of different kinds of filter residuals. SRM is used in the spatial domain and JRM is used in the JPEG domain. The images of JPEG format are the carriers of the steganographic algorithms in the frequency domain.Ma et al. [13] proposed a general feature selection method based on decision rough set α-positive region reduction to reduce the dimension of steganalysis features. Their results show that the reduced feature set can obtain the detection ability comparable to the original feature set, which effectively decreases the computation cost.


### 2.2. The Deep Learning Method

Because of gradient vanishment/explosion, the deep networks are normally difficult to train. He et al. [14] proposed ResNets, which solve the problem of gradient vanishment/explosion in deeper networks. This means the deeper network can show better accuracy rather than degradation. However, better accuracy comes with much more computation and time.To reduce computational complexity, Singh et al. [15] presented a deep learning architecture in which the convolution operation leverages heterogeneous kernels. They improved the convolution kernel and achieved 3× to 8× FLOPs based improvement in speed while still maintaining (and sometimes improving) the accuracy.Currently, deep learning is widely applied to improve the steganalysis performance. Hu et al. [16] proposed a new self-seeking steganalysis method based on visual attention and deep reinforcement learning. The visual attention method selects a region from the image and deep reinforcement learning is utilized to yield a summary region. Then, the summary regions are adopted to replace the misclassified training images to improve the steganalysis performance. Their experimental results show that their method can achieve steganalysis performance comparable to the state-of-the-art steganographic detection algorithms.


## 2.1. Feature Selection Method

The spatial rich model (SRM) [12] is a typical image steganographic analysis method. It designs a wide variety of spatial high-pass filters and uses these filters to filter the image to obtain a rich variety of residual images; then, it separately counts the frequency of occurrence of each adjacent residual sample pattern in a residual image. The cooccurrence matrix of the residual image is obtained. Finally, the elements of the cooccurrence matrix are rearranged into vectors as a steganographic analysis feature. The JPEG rich model (JRM) is the image steganographic analysis method that is widely used in the JPEG domain. JRM is similar to SRM. The only difference is that the features of JRM consist of the second-order cooccurrence matrices of the block coefficients of JPEG and their residual. However, the features of SRM are composed of the fourth-order cooccurrence matrices of different kinds of filter residuals. SRM is used in the spatial domain and JRM is used in the JPEG domain. The images of JPEG format are the carriers of the steganographic algorithms in the frequency domain.Ma et al. [13] proposed a general feature selection method based on decision rough set α-positive region reduction to reduce the dimension of steganalysis features. Their results show that the reduced feature set can obtain the detection ability comparable to the original feature set, which effectively decreases the computation cost.


## 2.2. The Deep Learning Method

Because of gradient vanishment/explosion, the deep networks are normally difficult to train. He et al. [14] proposed ResNets, which solve the problem of gradient vanishment/explosion in deeper networks. This means the deeper network can show better accuracy rather than degradation. However, better accuracy comes with much more computation and time.To reduce computational complexity, Singh et al. [15] presented a deep learning architecture in which the convolution operation leverages heterogeneous kernels. They improved the convolution kernel and achieved 3× to 8× FLOPs based improvement in speed while still maintaining (and sometimes improving) the accuracy.Currently, deep learning is widely applied to improve the steganalysis performance. Hu et al. [16] proposed a new self-seeking steganalysis method based on visual attention and deep reinforcement learning. The visual attention method selects a region from the image and deep reinforcement learning is utilized to yield a summary region. Then, the summary regions are adopted to replace the misclassified training images to improve the steganalysis performance. Their experimental results show that their method can achieve steganalysis performance comparable to the state-of-the-art steganographic detection algorithms.


## 3. DRHNet

The proposed network architecture is called DRHNet–Dual Residual Heterogeneous Network. The “residual” here has two meanings, one of which means that 34 layers of ResNet are used as the main network structure, and the other meaning is that the residual of the image is treated as the object. Firstly, we explain the method of preprocessing, that is, how to get the feature matrix, and the principle of discriminating embedded images with residuals and then demonstrate the architecture of the network. At last, we describe the details of the experiment.


### 3.1. Method and Principle

The steganographic embedding process makes subtle changes to the image, which is similar to introducing weak noise (stealth noise) into the image. At the same time, the steganographic embedding process not only changes the adjacent pixel correlation of the natural image but also changes the adjacent pixel correlation of the residual image (noise component) of the natural image. SRM and other residual image based steganographic analysis methods [17, 18] model the residual image instead of directly modeling the image itself, mainly to weaken the interference of the image content on the steganalysis feature.The residual of the cover image or stego image is extracted withk high-pass filters to form k submodels. Then, quantize, round, and truncate each submodel and extract the cooccurrence matrix in both horizontal and vertical directions. At this time, 2k cooccurrence matrices are generated for each picture. Cooccurrence matrices with similar properties are symmetrically merged and all elements are rearranged into feature vectors. At this point, the feature has been obtained, and its form is as follows [12]:(1)Fkcx⇀←RangeMergeMhcx,Mvcx,where Fkcx⇀ is the feature of the xth cover image cx calculated by using the kth submodel. Merge⋅ is to make two matrices merge to be one by combining elements having the same or similar statistical laws in the horizontal cooccurrence matrices Mh⋅ and vertical one Mv⋅. Range⋅ is a function to rearrange the merged matrices into a feature vector. Among them, x=1,2,…,z, where z is the last image of the train set; the feature of the stego image sx can also be calculated. cx,sx∈ℤn1×n2 are spatial domain images of size n1×n2 in which each value in the matrix is between 0 and 255.Mh⋅ can be obtained by the following formula [12], and Mv⋅ can be obtained in the same way:(2)Mhcxi,j←ExtrhdTruncTRoundHPkcxi,jq,where the positive vertex q is a quantization factor and the positive integer T is a truncation threshold; there are two important parameters that affect the dimensionality and steganalysis performance of SRM features. d is the order of the symbiotic matrix. If d is too large, sparse features will appear. If d is too small, the statistical diversity is not rich enough. HPk⋅ demonstrates the residual extracted by the kth high-pass filter; the specific definition is as follows:(3)HPk⋅←x^i,jNi,j−∂xi,j,where x∈ℤn1×n2 is the pixel value of the cover or stego image at i,j, HPk⋅∈ℝn1×n2 is the residual value of the residual f obtained by using a high-pass filter on the cover or stego image at i,j, and ∂∈ℤ is the coefficient before the pixel value xi,j. Ni,j is the pixel value of xi,j neighborhood xi,j∉Ni,j, and xi,j,Ni,j is the support set of image residuals. x^i,j⋅ is the calculation result of the correlation between xi,j and it is the neighborhood Ni,j on different filters. Round⋅ means rounding up by element, and TruncT⋅ means a truncation operation by element. Extrhd⋅ extracts the residual as a cooccurrence matrix. The common filters used in SRM are shown in Figure 1.Figure 1
The commonly used filters of SRM.We chooseq=0.5,1,2, T=2, and d=4 and use all the merge rules designed by SRM. The obtained SRM feature instance is called the SRMQ3 (SRM feature using 3 kinds of quantization factors). It has 106 features, 17 of which are 338-dimensional features and 89 of which are 325-dimensional features. The dimension of the RMQ3 feature is 338×17+325×89=34671. We use 0, 0 as the segmentation between each feature to fill it into a feature matrix of 187×187 , and null values after the last feature in the matrix are filled with 0. It is defined as follows:(4)MFcx←F1cx⇀,0,0,F2cx⇀,0,0,…F106cx⇀,0,…,0.By observing the feature vectors, we find that there are no elements with a value of 1 in the vector. We intended to split the feature vectors by “1, 1″, but considering that the maximum pooling is used in the subsequent network design, this will cause the network to train the separator we set as an important parameter, so, finally, we use “0, 0″ as the separator.After obtaining the feature matrix of the cover imageMFcx and the stego image MFsx, our goal is to use DRHNet to train a mapping Map⋅ based on the difference between them, so that the mapping satisfies the following equation:(5)MapMFsx=1,MapMFcx=0,Map⋅←DRHNetMFcx,MFsx.As discussed in Section2, the feature extraction procedure of JRM is similar to SRM. The difference is that the features of JRM consist of the second-order cooccurrence matrices of the block coefficients of JPEG and their residual. JRM will double the feature dimension through Cartesian calibration, which produces 22510 features. Finally, a 151×151 feature matrix is generated.


### 3.2. Dual Residual Heterogeneous Network Architecture

#### 3.2.1. Deep Residual Network

The structure used in this paper is similar to the 34-layer structure of ResNet [14]. We also adopt batch normalization (BN) [19] after each convolution and before ReLU [20]. The difference is that we added the SRM-Extract-Merge (SRMEM) layer between the image and the first convolutional layer of DRHNet for steganographic analysis of the spatial domain; we added the JRM-Extract-Merge (JRMEM) layer between the image and the first convolutional layer of DRHNet for steganographic analysis of the frequency domain. This reduces the data dimension that the network actually handles from 256 × 256 to 187 × 187 or 151 × 151. And the image represented by the feature matrix is no longer the content of the image. On the contrary, it is the statistical feature of the image residual, so it is more abstract. In addition, since Adamx [21] can reach convergence faster than stochastic gradient descent (SGD), we use Adamx as the optimizer to replace SGD.The structure of the network is shown in Figure2. The layered structure in the figure is not just a layer of convolution, but a convolution block containing two layers of convolution. The DRHNet network parameter settings are shown in Table 1. Please note that the DRHNet used for the steganographic analysis of the spatial domain is known as S-DRHNet in the following sections and the DRHNet used for the steganographic analysis of the frequency domain is known as J-DRHNet. The S-DRHNet and J-DRHNet share similar network architecture. The only difference is that they own different feature extraction layers. The S-DRHNet adopts the SRMEM as the feature extraction layer and the J-DRHNet uses the JRMEM as the feature extraction layer.Figure 2
Network architectures for DRHNet.Table 1
Parameters for DRHNet.
Layer nameOutput sizeConvolution kernelConv_194 × 947 × 7,64Max poolConv_247 × 473×3,643×3,64×3Conv_324 × 243×3,1283×3,128×4Conv_412 × 123×3,2563×3,256×6Conv_56 × 63×3,5123×3,512×3Avg poolFc 1000Softmax


#### 3.2.2. Heterogeneous Kernel

Another difference of DRHNet compared to ResNet is that the HetConv [15] is used as the convolution kernel, instead of the conventional convolution kernel. The channel is filled in the order of a 3 × 3 and three 1 × 1 convolution kernels. The convolution kernel of the next convolutional layer remains in this order, but the overall arrangement is shifted to the right by a convolution kernel. The structure of the DRHNet convolution kernel is shown in Figure 3.Figure 3
3 × 3 × 64 convolutional block structure in DRHNet.It can be seen that there are two convolutional layers in the convolution block, each layer consisting of 64 convolution kernels of 3 × 3 and 1 × 1 sizes, arranged and offset in the above order. Using HetConv instead of a conventional convolution kernel can reduce network parameters and reduce computational complexity.


## 3.1. Method and Principle

The steganographic embedding process makes subtle changes to the image, which is similar to introducing weak noise (stealth noise) into the image. At the same time, the steganographic embedding process not only changes the adjacent pixel correlation of the natural image but also changes the adjacent pixel correlation of the residual image (noise component) of the natural image. SRM and other residual image based steganographic analysis methods [17, 18] model the residual image instead of directly modeling the image itself, mainly to weaken the interference of the image content on the steganalysis feature.The residual of the cover image or stego image is extracted withk high-pass filters to form k submodels. Then, quantize, round, and truncate each submodel and extract the cooccurrence matrix in both horizontal and vertical directions. At this time, 2k cooccurrence matrices are generated for each picture. Cooccurrence matrices with similar properties are symmetrically merged and all elements are rearranged into feature vectors. At this point, the feature has been obtained, and its form is as follows [12]:(1)Fkcx⇀←RangeMergeMhcx,Mvcx,where Fkcx⇀ is the feature of the xth cover image cx calculated by using the kth submodel. Merge⋅ is to make two matrices merge to be one by combining elements having the same or similar statistical laws in the horizontal cooccurrence matrices Mh⋅ and vertical one Mv⋅. Range⋅ is a function to rearrange the merged matrices into a feature vector. Among them, x=1,2,…,z, where z is the last image of the train set; the feature of the stego image sx can also be calculated. cx,sx∈ℤn1×n2 are spatial domain images of size n1×n2 in which each value in the matrix is between 0 and 255.Mh⋅ can be obtained by the following formula [12], and Mv⋅ can be obtained in the same way:(2)Mhcxi,j←ExtrhdTruncTRoundHPkcxi,jq,where the positive vertex q is a quantization factor and the positive integer T is a truncation threshold; there are two important parameters that affect the dimensionality and steganalysis performance of SRM features. d is the order of the symbiotic matrix. If d is too large, sparse features will appear. If d is too small, the statistical diversity is not rich enough. HPk⋅ demonstrates the residual extracted by the kth high-pass filter; the specific definition is as follows:(3)HPk⋅←x^i,jNi,j−∂xi,j,where x∈ℤn1×n2 is the pixel value of the cover or stego image at i,j, HPk⋅∈ℝn1×n2 is the residual value of the residual f obtained by using a high-pass filter on the cover or stego image at i,j, and ∂∈ℤ is the coefficient before the pixel value xi,j. Ni,j is the pixel value of xi,j neighborhood xi,j∉Ni,j, and xi,j,Ni,j is the support set of image residuals. x^i,j⋅ is the calculation result of the correlation between xi,j and it is the neighborhood Ni,j on different filters. Round⋅ means rounding up by element, and TruncT⋅ means a truncation operation by element. Extrhd⋅ extracts the residual as a cooccurrence matrix. The common filters used in SRM are shown in Figure 1.Figure 1
The commonly used filters of SRM.We chooseq=0.5,1,2, T=2, and d=4 and use all the merge rules designed by SRM. The obtained SRM feature instance is called the SRMQ3 (SRM feature using 3 kinds of quantization factors). It has 106 features, 17 of which are 338-dimensional features and 89 of which are 325-dimensional features. The dimension of the RMQ3 feature is 338×17+325×89=34671. We use 0, 0 as the segmentation between each feature to fill it into a feature matrix of 187×187 , and null values after the last feature in the matrix are filled with 0. It is defined as follows:(4)MFcx←F1cx⇀,0,0,F2cx⇀,0,0,…F106cx⇀,0,…,0.By observing the feature vectors, we find that there are no elements with a value of 1 in the vector. We intended to split the feature vectors by “1, 1″, but considering that the maximum pooling is used in the subsequent network design, this will cause the network to train the separator we set as an important parameter, so, finally, we use “0, 0″ as the separator.After obtaining the feature matrix of the cover imageMFcx and the stego image MFsx, our goal is to use DRHNet to train a mapping Map⋅ based on the difference between them, so that the mapping satisfies the following equation:(5)MapMFsx=1,MapMFcx=0,Map⋅←DRHNetMFcx,MFsx.As discussed in Section2, the feature extraction procedure of JRM is similar to SRM. The difference is that the features of JRM consist of the second-order cooccurrence matrices of the block coefficients of JPEG and their residual. JRM will double the feature dimension through Cartesian calibration, which produces 22510 features. Finally, a 151×151 feature matrix is generated.


## 3.2. Dual Residual Heterogeneous Network Architecture

### 3.2.1. Deep Residual Network

The structure used in this paper is similar to the 34-layer structure of ResNet [14]. We also adopt batch normalization (BN) [19] after each convolution and before ReLU [20]. The difference is that we added the SRM-Extract-Merge (SRMEM) layer between the image and the first convolutional layer of DRHNet for steganographic analysis of the spatial domain; we added the JRM-Extract-Merge (JRMEM) layer between the image and the first convolutional layer of DRHNet for steganographic analysis of the frequency domain. This reduces the data dimension that the network actually handles from 256 × 256 to 187 × 187 or 151 × 151. And the image represented by the feature matrix is no longer the content of the image. On the contrary, it is the statistical feature of the image residual, so it is more abstract. In addition, since Adamx [21] can reach convergence faster than stochastic gradient descent (SGD), we use Adamx as the optimizer to replace SGD.The structure of the network is shown in Figure2. The layered structure in the figure is not just a layer of convolution, but a convolution block containing two layers of convolution. The DRHNet network parameter settings are shown in Table 1. Please note that the DRHNet used for the steganographic analysis of the spatial domain is known as S-DRHNet in the following sections and the DRHNet used for the steganographic analysis of the frequency domain is known as J-DRHNet. The S-DRHNet and J-DRHNet share similar network architecture. The only difference is that they own different feature extraction layers. The S-DRHNet adopts the SRMEM as the feature extraction layer and the J-DRHNet uses the JRMEM as the feature extraction layer.Figure 2
Network architectures for DRHNet.Table 1
Parameters for DRHNet.
Layer nameOutput sizeConvolution kernelConv_194 × 947 × 7,64Max poolConv_247 × 473×3,643×3,64×3Conv_324 × 243×3,1283×3,128×4Conv_412 × 123×3,2563×3,256×6Conv_56 × 63×3,5123×3,512×3Avg poolFc 1000Softmax


### 3.2.2. Heterogeneous Kernel

Another difference of DRHNet compared to ResNet is that the HetConv [15] is used as the convolution kernel, instead of the conventional convolution kernel. The channel is filled in the order of a 3 × 3 and three 1 × 1 convolution kernels. The convolution kernel of the next convolutional layer remains in this order, but the overall arrangement is shifted to the right by a convolution kernel. The structure of the DRHNet convolution kernel is shown in Figure 3.Figure 3
3 × 3 × 64 convolutional block structure in DRHNet.It can be seen that there are two convolutional layers in the convolution block, each layer consisting of 64 convolution kernels of 3 × 3 and 1 × 1 sizes, arranged and offset in the above order. Using HetConv instead of a conventional convolution kernel can reduce network parameters and reduce computational complexity.


## 3.2.1. Deep Residual Network

The structure used in this paper is similar to the 34-layer structure of ResNet [14]. We also adopt batch normalization (BN) [19] after each convolution and before ReLU [20]. The difference is that we added the SRM-Extract-Merge (SRMEM) layer between the image and the first convolutional layer of DRHNet for steganographic analysis of the spatial domain; we added the JRM-Extract-Merge (JRMEM) layer between the image and the first convolutional layer of DRHNet for steganographic analysis of the frequency domain. This reduces the data dimension that the network actually handles from 256 × 256 to 187 × 187 or 151 × 151. And the image represented by the feature matrix is no longer the content of the image. On the contrary, it is the statistical feature of the image residual, so it is more abstract. In addition, since Adamx [21] can reach convergence faster than stochastic gradient descent (SGD), we use Adamx as the optimizer to replace SGD.The structure of the network is shown in Figure2. The layered structure in the figure is not just a layer of convolution, but a convolution block containing two layers of convolution. The DRHNet network parameter settings are shown in Table 1. Please note that the DRHNet used for the steganographic analysis of the spatial domain is known as S-DRHNet in the following sections and the DRHNet used for the steganographic analysis of the frequency domain is known as J-DRHNet. The S-DRHNet and J-DRHNet share similar network architecture. The only difference is that they own different feature extraction layers. The S-DRHNet adopts the SRMEM as the feature extraction layer and the J-DRHNet uses the JRMEM as the feature extraction layer.Figure 2
Network architectures for DRHNet.Table 1
Parameters for DRHNet.
Layer nameOutput sizeConvolution kernelConv_194 × 947 × 7,64Max poolConv_247 × 473×3,643×3,64×3Conv_324 × 243×3,1283×3,128×4Conv_412 × 123×3,2563×3,256×6Conv_56 × 63×3,5123×3,512×3Avg poolFc 1000Softmax


## 3.2.2. Heterogeneous Kernel

Another difference of DRHNet compared to ResNet is that the HetConv [15] is used as the convolution kernel, instead of the conventional convolution kernel. The channel is filled in the order of a 3 × 3 and three 1 × 1 convolution kernels. The convolution kernel of the next convolutional layer remains in this order, but the overall arrangement is shifted to the right by a convolution kernel. The structure of the DRHNet convolution kernel is shown in Figure 3.Figure 3
3 × 3 × 64 convolutional block structure in DRHNet.It can be seen that there are two convolutional layers in the convolution block, each layer consisting of 64 convolution kernels of 3 × 3 and 1 × 1 sizes, arranged and offset in the above order. Using HetConv instead of a conventional convolution kernel can reduce network parameters and reduce computational complexity.


## 4. Experimental Results and Analysis

All experiments in this paper were evaluated and contrasted on BOSSbase 1.01, which contains 10,000 grayscale images with a size of 512 × 512. The experimental environment for this article is a host with an NVIDIA GeForce 1080 Ti graphics card and an Intel i7-9700 CPU. The more pixels image has, the more information it can embed, as well as the higher the computational complexity in the steganographic analysis process. This does not affect the performance of DRHNet, regardless of which size of the image will be extracted in the preprocessing into a feature matrix of 187 × 187 or 151 × 151. To facilitate comparison with the other steganalysis methods, we resized all the images into 256 × 256. In the setting of the spatial domain, WOW [22], S-UNIWARD [11], and MiPOD [23] are used as steganographic algorithms to embed ciphertext in the image. The SCA-TLU-CNN [9] and the SRNet [10] are utilized as the competing steganographic analysis method to be compared with S-DRHNet. In the setting of the frequency domain, the UED [24] and J-UNIWARD [11] are chosen as the steganographic algorithms. Because SRNet can also be used in the frequency domain, we compare J-DRHNet with SRNet to evaluate the effectiveness of DRHNet in the setting of the frequency domain. The payload of each steganographic algorithm is set from 0.2 to 0.4 bits per pixel (bpp), respectively. For the dataset, 5000 cover-stego image pairs, 10000 images, were randomly selected as the training set. For clarity of expression, the following are all counted in cover-stego image pairs. As the same, 2500 were selected as the validation set, and the remaining 2500 combined with the 2500 randomly selected unembedded image pairs were used as the test set. The experimental epoch of this paper is 100 times, the minibatch size of the training set is 20 cover-stego image pairs, and the validation set is 10. The first 80 epochs of the experiment trained the network at a learning rate of 0.001 and trained it at 0.0001 for the last 20 epochs.


### 4.1. DRHNet Steganalysis Level Experiment

We adopt the detection errorPerror as the evaluation criteria. The definition of Perror is as follows:(6)Perror=nFP+nFNn,where n is the total number of images in the test set, and nFP and nFN are the number of false positive and false negative errors in the machine learning concept.


#### 4.1.1. The Performance of S-DRHNet in the Spatial Domain

The performance of S-DRHNet in the spatial domain is shown in Figures4–6. It is observed in Figures 4–6 that SRNet’s [10] Perror is less than 1% lower than our proposed structure when applying the WOW steganography algorithm and with a payload of 0.4 bpp; SCA-TLU-CNN [9] has a detection error rate of 6% lower than the DRHNet when applying the S-UNIWARD steganography algorithm and with a payload of 0.2 bpp. Apart from the above two situations, DRHNet generally has better performance than the other two steganographic analysis networks. And it can be seen that as the payload increases, Perror of DRHNet decreases faster than the other two networks.Figure 4
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against WOW.Figure 5
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against S-UNIWARD.Figure 6
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against MiPOD.The ROC curves of SCA-TLU-CNN, SRNet, and S-DRHNet against S-UNIWARD at 0.4 bpp are shown in Figure7. The AUC of S-DRHNet, SRNet, and SCA-TLU-CNN are 0.97, 0.94, and 0.92. The accuracy of S-DRHNet against S-UNIWARD is higher than SRNet and SCA-TLU-CNN at the high payload.Figure 7
ROC curves of SCA-TLU-CNN, SRNet, and S-DRHNet for S-UNIWARD at 0.4 bpp.The training of DRHNet was iterated 100 times in total. The learning rate was set to 0.001 in the first 80 iterations and 0.0001 in the last 20 iterations. Figure8 shows the changes in detection error during training and validation of S-DRHNet. The data are obtained on S-UNIWARD at payload 0.4 bpp.Figure 8
S-DRHNet’s training and validation detection errorPerror for S-UNIWARD at 0.4 bpp.Figure9 shows the progression of the training and validation loss when training S-DRHNet in the same circumstance. Because the curves of detection error and loss of J-DRHNet during training and validation are similar to S-DRHNet, we only show the corresponding curves of S-DRHNet here.Figure 9
S-DRHNet’s training and validation loss for S-UNIWARD at 0.4 bpp.


#### 4.1.2. The Performance of J-DRHNet in the Frequency Domain

The performance of J-DRHNet in the frequency domain is shown in Figures10 and 11. The J-DRHNet shows better performance than SRNet against J-UNIWARD. When the payload is high, the J-DRHNet shows better performance than SRNet against UED.Figure 10
Detection errorPerror of SRNet and J-DRHNet against UED.Figure 11
Detection errorPerror of SRNet and J-DRHNet against J-UNIWARD.The ROC curves of SRNet and J-DRHNet against UED at 0.4 bpp are shown in Figure10. We can observe from Figure 12 that the accuracy of J-DRHNet against UED is close to that of SRNet.Figure 12
ROC curves of SRNet and J-DRHNet against UED at 0.4 bpp.


### 4.2. DRHNet Steganalysis Generality Experiment

Using the feature matrix extracted by SRM or JRM as the input of the network makes DRHNet have good versatility. To evaluate the versatility of DRHNet, we adopt one steganographic algorithm to generate steganographic images as the training set and validation set. Then, the steganographic images generated by another steganographic algorithm are used as the test set. We observe the detection error of DRHNet in this situation. Because the J-DRHNet and S-DRHNet own similar architecture except for the feature extraction modules, we only show the results of the cross test of S-DRHNet here. The detection error of the cross test of S-DRHNet is shown in Table2. The detection error obtained by using the same steganography algorithm for the test set and training set is shown in bold in Table 2, and the error rate of the cross test is shown in normal font. The detection error obtained by adopting different steganographic algorithms is generally 0.01–0.03 higher than that of using the same steganography algorithm. From the results in Table 2, we can conclude that the S-DRHNet shows good versatility against different steganographic methods.Table 2
The detection error of the cross test of S-DRHNet.
Train\testPayload (bpp)WOWS-UNIWARDMiPODWOW0.20.15840.18070.18020.30.10500.12680.13410.40.09170.10990.1125S-UNIWARD0.20.29430.28720.29600.30.14960.13950.15610.40.10830.09260.1069MiPOD0.20.31820.32970.29540.30.20490.20880.18610.40.16090.16530.1557


### 4.3. The Time Consumption and Computational Complexity of DRHNet

DRHNet also reduces time consumption while improving accuracy. Table3 shows the parameters, computational complexity, and time consumption of the above four types of steganalysis networks. The network structure of SCA-TLU-CNN has ten layers, and the SRNet has twelve layers, so ResNet is higher than SCA-TLU-CNN in the three metrics mentioned in Table 3. Although the DRHNet designed in this paper is a 34-layer network structure, the application of HetCov as a convolution kernel greatly reduces the parameters of the network, resulting in shortened computational complexity and time consumption than the other two networks, while still ensuring considerable accuracy. Because the feature matrix of J-DRHNet is smaller than S-DRHNet, the time consumption of J-DRHNet is lower than that of S-DRHNet.Table 3
The computational complexity of the three networks.
NetworkInput resolutionParameters (M)FLOPs (G)HoursSCA-LTU-CNN256 × 25610.521.7444SRNet256 × 25612.182.0953S-DRHNet256 × 2569.881.6741J-DRHNet256 × 2569.881.5937


## 4.1. DRHNet Steganalysis Level Experiment

We adopt the detection errorPerror as the evaluation criteria. The definition of Perror is as follows:(6)Perror=nFP+nFNn,where n is the total number of images in the test set, and nFP and nFN are the number of false positive and false negative errors in the machine learning concept.


### 4.1.1. The Performance of S-DRHNet in the Spatial Domain

The performance of S-DRHNet in the spatial domain is shown in Figures4–6. It is observed in Figures 4–6 that SRNet’s [10] Perror is less than 1% lower than our proposed structure when applying the WOW steganography algorithm and with a payload of 0.4 bpp; SCA-TLU-CNN [9] has a detection error rate of 6% lower than the DRHNet when applying the S-UNIWARD steganography algorithm and with a payload of 0.2 bpp. Apart from the above two situations, DRHNet generally has better performance than the other two steganographic analysis networks. And it can be seen that as the payload increases, Perror of DRHNet decreases faster than the other two networks.Figure 4
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against WOW.Figure 5
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against S-UNIWARD.Figure 6
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against MiPOD.The ROC curves of SCA-TLU-CNN, SRNet, and S-DRHNet against S-UNIWARD at 0.4 bpp are shown in Figure7. The AUC of S-DRHNet, SRNet, and SCA-TLU-CNN are 0.97, 0.94, and 0.92. The accuracy of S-DRHNet against S-UNIWARD is higher than SRNet and SCA-TLU-CNN at the high payload.Figure 7
ROC curves of SCA-TLU-CNN, SRNet, and S-DRHNet for S-UNIWARD at 0.4 bpp.The training of DRHNet was iterated 100 times in total. The learning rate was set to 0.001 in the first 80 iterations and 0.0001 in the last 20 iterations. Figure8 shows the changes in detection error during training and validation of S-DRHNet. The data are obtained on S-UNIWARD at payload 0.4 bpp.Figure 8
S-DRHNet’s training and validation detection errorPerror for S-UNIWARD at 0.4 bpp.Figure9 shows the progression of the training and validation loss when training S-DRHNet in the same circumstance. Because the curves of detection error and loss of J-DRHNet during training and validation are similar to S-DRHNet, we only show the corresponding curves of S-DRHNet here.Figure 9
S-DRHNet’s training and validation loss for S-UNIWARD at 0.4 bpp.


### 4.1.2. The Performance of J-DRHNet in the Frequency Domain

The performance of J-DRHNet in the frequency domain is shown in Figures10 and 11. The J-DRHNet shows better performance than SRNet against J-UNIWARD. When the payload is high, the J-DRHNet shows better performance than SRNet against UED.Figure 10
Detection errorPerror of SRNet and J-DRHNet against UED.Figure 11
Detection errorPerror of SRNet and J-DRHNet against J-UNIWARD.The ROC curves of SRNet and J-DRHNet against UED at 0.4 bpp are shown in Figure10. We can observe from Figure 12 that the accuracy of J-DRHNet against UED is close to that of SRNet.Figure 12
ROC curves of SRNet and J-DRHNet against UED at 0.4 bpp.


## 4.1.1. The Performance of S-DRHNet in the Spatial Domain

The performance of S-DRHNet in the spatial domain is shown in Figures4–6. It is observed in Figures 4–6 that SRNet’s [10] Perror is less than 1% lower than our proposed structure when applying the WOW steganography algorithm and with a payload of 0.4 bpp; SCA-TLU-CNN [9] has a detection error rate of 6% lower than the DRHNet when applying the S-UNIWARD steganography algorithm and with a payload of 0.2 bpp. Apart from the above two situations, DRHNet generally has better performance than the other two steganographic analysis networks. And it can be seen that as the payload increases, Perror of DRHNet decreases faster than the other two networks.Figure 4
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against WOW.Figure 5
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against S-UNIWARD.Figure 6
Detection errorPerror of SCA-TLU-CNN, SRNet, and S-DRHNet against MiPOD.The ROC curves of SCA-TLU-CNN, SRNet, and S-DRHNet against S-UNIWARD at 0.4 bpp are shown in Figure7. The AUC of S-DRHNet, SRNet, and SCA-TLU-CNN are 0.97, 0.94, and 0.92. The accuracy of S-DRHNet against S-UNIWARD is higher than SRNet and SCA-TLU-CNN at the high payload.Figure 7
ROC curves of SCA-TLU-CNN, SRNet, and S-DRHNet for S-UNIWARD at 0.4 bpp.The training of DRHNet was iterated 100 times in total. The learning rate was set to 0.001 in the first 80 iterations and 0.0001 in the last 20 iterations. Figure8 shows the changes in detection error during training and validation of S-DRHNet. The data are obtained on S-UNIWARD at payload 0.4 bpp.Figure 8
S-DRHNet’s training and validation detection errorPerror for S-UNIWARD at 0.4 bpp.Figure9 shows the progression of the training and validation loss when training S-DRHNet in the same circumstance. Because the curves of detection error and loss of J-DRHNet during training and validation are similar to S-DRHNet, we only show the corresponding curves of S-DRHNet here.Figure 9
S-DRHNet’s training and validation loss for S-UNIWARD at 0.4 bpp.


## 4.1.2. The Performance of J-DRHNet in the Frequency Domain

The performance of J-DRHNet in the frequency domain is shown in Figures10 and 11. The J-DRHNet shows better performance than SRNet against J-UNIWARD. When the payload is high, the J-DRHNet shows better performance than SRNet against UED.Figure 10
Detection errorPerror of SRNet and J-DRHNet against UED.Figure 11
Detection errorPerror of SRNet and J-DRHNet against J-UNIWARD.The ROC curves of SRNet and J-DRHNet against UED at 0.4 bpp are shown in Figure10. We can observe from Figure 12 that the accuracy of J-DRHNet against UED is close to that of SRNet.Figure 12
ROC curves of SRNet and J-DRHNet against UED at 0.4 bpp.


## 4.2. DRHNet Steganalysis Generality Experiment

Using the feature matrix extracted by SRM or JRM as the input of the network makes DRHNet have good versatility. To evaluate the versatility of DRHNet, we adopt one steganographic algorithm to generate steganographic images as the training set and validation set. Then, the steganographic images generated by another steganographic algorithm are used as the test set. We observe the detection error of DRHNet in this situation. Because the J-DRHNet and S-DRHNet own similar architecture except for the feature extraction modules, we only show the results of the cross test of S-DRHNet here. The detection error of the cross test of S-DRHNet is shown in Table2. The detection error obtained by using the same steganography algorithm for the test set and training set is shown in bold in Table 2, and the error rate of the cross test is shown in normal font. The detection error obtained by adopting different steganographic algorithms is generally 0.01–0.03 higher than that of using the same steganography algorithm. From the results in Table 2, we can conclude that the S-DRHNet shows good versatility against different steganographic methods.Table 2
The detection error of the cross test of S-DRHNet.
Train\testPayload (bpp)WOWS-UNIWARDMiPODWOW0.20.15840.18070.18020.30.10500.12680.13410.40.09170.10990.1125S-UNIWARD0.20.29430.28720.29600.30.14960.13950.15610.40.10830.09260.1069MiPOD0.20.31820.32970.29540.30.20490.20880.18610.40.16090.16530.1557


## 4.3. The Time Consumption and Computational Complexity of DRHNet

DRHNet also reduces time consumption while improving accuracy. Table3 shows the parameters, computational complexity, and time consumption of the above four types of steganalysis networks. The network structure of SCA-TLU-CNN has ten layers, and the SRNet has twelve layers, so ResNet is higher than SCA-TLU-CNN in the three metrics mentioned in Table 3. Although the DRHNet designed in this paper is a 34-layer network structure, the application of HetCov as a convolution kernel greatly reduces the parameters of the network, resulting in shortened computational complexity and time consumption than the other two networks, while still ensuring considerable accuracy. Because the feature matrix of J-DRHNet is smaller than S-DRHNet, the time consumption of J-DRHNet is lower than that of S-DRHNet.Table 3
The computational complexity of the three networks.
NetworkInput resolutionParameters (M)FLOPs (G)HoursSCA-LTU-CNN256 × 25610.521.7444SRNet256 × 25612.182.0953S-DRHNet256 × 2569.881.6741J-DRHNet256 × 2569.881.5937


## 5. Conclusion

In this paper, a deep neural network with high accuracy and low time consumption is proposed for steganalysis. The SRMEM and JRMEM layers are used to extract features from the original images and combine them into a feature matrix, which provides versatility for the steganographic analysis method while reducing the network dimension. Furthermore, we select HetConv as the convolution kernel of the DRHNet network, which greatly reduces the computational complexity while ensuring accuracy. By combining different feature preprocessing modules, that is, SRMEM and JRMEM, DRHNet can be flexibly applied in both spatial domain and frequency domain. The preliminary experimental results show that the DRHNet shows excellent steganalysis performance in both the spatial domain and frequency domain. The DRHNet outperforms the existing state-of-the-art steganographic analysis algorithms such as SCA-TLU-CNN and SRNet and shows excellent performance against the state-of-the-art steganographic methods such as S-UNIWARD, J-UNIWARD, and WOW. The image embedded in ciphertext may be compressed during transmission.The cross test of SRNet and J-DRHNet will be further studied and verified in the following research. How to extract the embedded image after compression will be our next research direction.



---

*Source: 8847741-2020-12-12.xml*