<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">50899</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2024.050899</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Robust Information Hiding Based on Neural Style Transfer with Artificial Intelligence</article-title>
<alt-title alt-title-type="left-running-head">Robust Information Hiding Based on Neural Style Transfer with Artificial Intelligence</alt-title>
<alt-title alt-title-type="right-running-head">Robust Information Hiding Based on Neural Style Transfer with Artificial Intelligence</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Zhang</surname><given-names>Xiong</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Zhang</surname><given-names>Minqing</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref><xref ref-type="aff" rid="aff-3">3</xref><email>api_zmq@126.com</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Wang</surname><given-names>Xu An</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Jiang</surname><given-names>Wen</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Jiang</surname><given-names>Chao</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Yang</surname><given-names>Pan</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<aff id="aff-1"><label>1</label><institution>College of Cryptography Engineering, Engineering University of People&#x2019;s Armed Police</institution>, <addr-line>Xi&#x2019;an, 710086</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Key Laboratory of People&#x2019;s Armed Police for Cryptology and Information Security</institution>, <addr-line>Xi&#x2019;an, 710086</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Key Laboratory of CTC &#x0026; Information Engineering (Engineering University of People&#x2019;s Armed Police), Ministry of Education</institution>, <addr-line>Xi&#x2019;an, 710086</addr-line>, <country>China</country></aff>
<aff id="aff-4"><label>4</label><institution>Staff Department of People&#x2019;s Armed Police Ningxia Corps</institution>, <addr-line>Yinchuan, 750000</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Minqing Zhang. Email: <email>api_zmq@126.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2024</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>15</day>
<month>5</month>
<year>2024</year></pub-date>
<volume>79</volume>
<issue>2</issue>
<fpage>1925</fpage>
<lpage>1938</lpage>
<history>
<date date-type="received">
<day>21</day>
<month>2</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>15</day>
<month>4</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 Zhang et al.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Zhang et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_50899.pdf"></self-uri>
<abstract>
<p>This paper proposes an artificial intelligence-based robust information hiding algorithm to address the issue of confidential information being susceptible to noise attacks during transmission. The algorithm we designed aims to mitigate the impact of various noise attacks on the integrity of secret information during transmission. The method we propose involves encoding secret images into stylized encrypted images and applies adversarial transfer to both the style and content features of the original and embedded data. This process effectively enhances the concealment and imperceptibility of confidential information, thereby improving the security of such information during transmission and reducing security risks. Furthermore, we have designed a specialized attack layer to simulate real-world attacks and common noise scenarios encountered in practical environments. Through adversarial training, the algorithm is strengthened to enhance its resilience against attacks and overall robustness, ensuring better protection against potential threats. Experimental results demonstrate that our proposed algorithm successfully enhances the concealment and unknowability of secret information while maintaining embedding capacity. Additionally, it ensures the quality and fidelity of the stego image. The method we propose not only improves the security and robustness of information hiding technology but also holds practical application value in protecting sensitive data and ensuring the invisibility of confidential information.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Information hiding</kwd>
<kwd>neural style transfer</kwd>
<kwd>robustness</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>62272478</award-id>
<award-id>61872384</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Natural Science Foundation of Shanxi Province</funding-source>
<award-id>2023-JC-YB-584</award-id>
</award-group>
<award-group id="awg3">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>62172436</award-id>
</award-group>
<award-group id="awg4">
<funding-source>Engineering University of PAP&#x2019;s Funding for Scientific Research Innovation Team, Engineering University of PAP&#x2019;s Funding for Key Researcher</funding-source>
<award-id>KYGG202011</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Information hiding refers to embedding secret information into non secret information to achieve covert communication or embedding copyright information into digital content to achieve copyright protection of digital media. Due to its higher concealment, larger capacity, and wider application scenarios, image information hiding has been widely studied and utilized by academia and industry.</p>
<p>According to the implementation me thods, image information hiding can be divided into traditional image information hiding methods and image information hiding methods based on deep learning [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-4">4</xref>]. Traditional image information hiding usually relies on hand-designed features and models, using classical digital embedding techniques. Examples include Least Significant Bit (LSB) [<xref ref-type="bibr" rid="ref-5">5</xref>], Discrete Cosine Transform (DCT) [<xref ref-type="bibr" rid="ref-6">6</xref>], or Discrete Wavelet Transform (DWT) [<xref ref-type="bibr" rid="ref-7">7</xref>]. These methods are simple to implement and easy to understand. However, their limitation is that some statistical characteristics of the image may be changed [<xref ref-type="bibr" rid="ref-8">8</xref>&#x2013;<xref ref-type="bibr" rid="ref-10">10</xref>], which increases the possibility of secret communication exposure. The image information hiding method based on deep learning uses Convolutional Neural Networks (CNN) [<xref ref-type="bibr" rid="ref-11">11</xref>] to extract image features and merge them with secret information to generate an image with hidden information. Compared with traditional methods, the image information hiding technology based on deep learning has the characteristics of fast design speed and strong performance improvement ability. However, its embedding capacity and robustness [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>] still need to be improved.</p>
<p>To solve the above problems, style transfer technology is introduced into information hiding. Style transfer [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>] refers to extracting the features of the reference style image and the target image using the deep learning model and recombining these features to generate a new image. This allows the new image to have the visual effect of the style image while maintaining the content of the target image. Style transfer is applied to information hiding by embedding the information to be hidden into the style of the image. This takes advantage of the highly nonlinear characteristics of style transfer, mixing the hidden information with the appearance of the image to improve the concealment of the hiding. Additionally, since style transfer preserves the edge, texture, and other features of the image, the hidden information of the image has good visual quality and is difficult to be detected by the attacker.</p>
<sec id="s1_1">
<label>1.1</label>
<title>Related Works</title>
<p>STNet [<xref ref-type="bibr" rid="ref-16">16</xref>], proposed by Wang et al., can embed secret information in the process of image style transfer. The algorithm combines the steganography process and the style transfer process, showcasing the style transfer function while hiding the steganography function, thereby improving the security of the steganography algorithm.</p>
<p>Building upon this, Bi et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] proposed ISTNet. By improving the decoder of STNet, the secret image features were fused with the results of the Multi-scale Adaptive Instance Normalization (AdaIN) [<xref ref-type="bibr" rid="ref-18">18</xref>] layer, and the gray image was hidden in the process of image style transmission to improve the steganography ability.</p>
<p>AdaIN is a scalable and effective image style transfer technique that has been widely used in image style transfer, image enhancement, and image generation. This approach allows for the application of one image&#x2019;s style to another, creating images with different styles.</p>
<p>The structure of AdaIN is depicted in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, where the input image undergoes feature extraction through a convolutional neural network. Subsequently, the features are normalized by calculating the mean and variance of each channel. Similarly, the features of the reference image are normalized during style transfer. The mean and variance of the input image&#x2019;s features are then adjusted to align with those of the reference image. Finally, the adjusted features pass through a deconvolutional neural network to generate the transformed image.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>AdaIN model diagram</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-1.tif"/>
</fig>
<p>To overcome the dependence of the algorithm on pre-trained CNNs, Hu et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] proposed an end-to-end steganography algorithm without pre-training, which embedded the secret message while converting the style of the content image.</p>
<p>Aiming at the problem of color image embedding, Yang et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] extracted the semantic information of the carrier image, the style information of the style image, and the feature information of the color image based on the style transfer process and the feature extraction advantages of the convolutional neural network. They fused these together and realized the style transfer of the carrier image and the embedding of the color image through the decoder.</p>
</sec>
<sec id="s1_2">
<label>1.2</label>
<title>Objective of This Study</title>
<p>Specifcally, thenovelties and contributions of this work are three-fold:
<list list-type="bullet">
<list-item>
<p>In order to better ensure the security of information during transmission, this paper designs an information hiding algorithm based on neural style transfer. By stylizing and disguising stego-images, attackers cannot visually determine whether they are stego-images, thereby improving the security of stego-images.</p></list-item>
<list-item>
<p>This paper designs an attack layer in the network structure to simulate attacks and noise from real environments. Through adversarial training, the algorithm&#x2019;s anti attack ability is improved, making the transmission of stego-images more secure, thereby improving the security and accuracy of secret information.</p></list-item>
<list-item>
<p>This paper introduces the Inception module into the network structure, which uses multiple convolutional kernels of different sizes at the same level to extract image features. This improves the model&#x2019;s expressive power, reduces computational costs, and enhances the algorithm&#x2019;s anti attack ability and extraction accuracy.</p></list-item>
</list></p>
<p>The algorithm in this paper aims to ensure the secure transmission of secret information on public channels, and it can improve the concealment and unknowability of secret information while ensuring the quality and fidelity of stego-images. It has certain application value for improving the robustness of information hiding.</p>
</sec>
</sec>
<sec id="s2">
<label>2</label>
<title>The Proposed Scheme</title>
<p>The current image information hiding methods based on style transfer face a challenge in balancing embedding capacity and robustness simultaneously. To address this, a robust information hiding algorithm based on style transfer is proposed in this paper. This algorithm utilizes a deep learning model to extract features from the reference style image and the content image, reorganizing these features to generate a new image while preserving the content of the target image. The addition of an Inception Block on the basis of convolution enhances the model&#x2019;s expressive capability and accuracy. Furthermore, to ensure high embedding capacity while considering robustness, an attack layer is designed to simulate various real-world attacks. Through joint training of the hidden network and the extraction network, the extractor&#x2019;s ability to extract the secret image is enhanced, thereby improving the algorithm&#x2019;s robustness.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Model Framework</title>
<p>The overall structure of the proposed algorithm, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, comprises three main parts: The hidden network, noise attack layer, and extraction network. The hiding network includes a feature extraction network and a decoder network. It combines the style image&#x2019;s characteristics to transform the content image into an artistic image with the style image&#x2019;s features, embedding the information of the secret image to generate the stego image. The attack layer simulates various real-world attacks, while the extraction network facilitates the extraction of secret images from stego images.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Overall framework of robust information hiding algorithm based on neural style transfer</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-2.tif"/>
</fig>
<sec id="s2_1_1">
<label>2.1.1</label>
<title>Hiding Networks</title>
<p>The hiding network comprises two components: A feature extraction network and a decoder network. Leveraging the convolutional neural network&#x2019;s efficacy in image tasks, the feature extraction network predominantly employs the VGG [<xref ref-type="bibr" rid="ref-21">21</xref>] convolutional neural network. This network sequentially extracts features from input images layer by layer. Enhancing training efficacy, we utilize the pre-trained VGG model in PyTorch, trained on the ImageNet dataset. Employing a pre-trained feature extraction network reduces training overhead and time, yielding superior feature extraction outcomes. Inputting any content image and style image into the hidden network results in the generation of a stylized image that amalgamates the content of the former with the style of the latter. That is, the content feature (<italic>f</italic><sub><italic>c</italic></sub>) of the content image and the style feature (<italic>f</italic><sub><italic>s</italic></sub>) of the style image are obtained. In the proposed algorithm, <italic>f</italic><sub><italic>c</italic></sub> and <italic>f</italic><sub><italic>s</italic></sub> are encoded into a feature through the AdaIN layer, as shown in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, which is combined with the same size feature of the secret image to achieve style fusion. It is then input to the decoder, through which the obtained feature is mapped back to the image space.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mtext>AdalN</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where <italic>T</italic> is the output content of AdaIN, <italic>f</italic><sub><italic>c</italic></sub> is the content feature of the content image, <italic>f</italic><sub><italic>s</italic></sub> represents the feature information of the style image, <bold><italic>&#x03BC;</italic></bold> represents the mean value, and <bold><italic>&#x03C3;</italic></bold> represents the standard deviation.</p>
<p>The feature extraction network employed in this study consists primarily of convolutional networks and Inception [<xref ref-type="bibr" rid="ref-22">22</xref>] structures. The Inception module, depicted in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, utilizes multi-channel convolution, employing multiple convolution kernels of different sizes at the same level for feature extraction. This approach improves the model&#x2019;s expressive power to a certain extent. Additionally, it mitigates the issues caused by excessive parameters and lengthy computation time when using a large number of convolution kernels simultaneously for dimension reduction and expansion. The computational cost of the model is significantly reduced, while the feature information of the secret image is maximized. This, in turn, facilitates subsequent resistance against various attacks from the attack layer, ultimately enhancing the accuracy of secret extraction within the extraction network.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Inception block structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-3.tif"/>
</fig>
<p>The input feature information is decoded by the decoder to generate the stylized stego-image, as depicted in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. Reflectionpad is used for mirror filling, and ReLU is utilized as the activation function.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Decoder structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-4.tif"/>
</fig>
</sec>
<sec id="s2_1_2">
<label>2.1.2</label>
<title>Attack Layer</title>
<p>Image attacks are prevalent in real-world scenarios. To enhance the practical applications of information hiding technology, an attack layer is incorporated into the network in this paper. We propose a parameterless noise layer that introduces distortion in the encoded image, resulting in a noisy image. The network is trained by introducing noise, and the attack image is employed for adversarial training, following a similar approach to HiDDeN [<xref ref-type="bibr" rid="ref-1">1</xref>], Common digital attacks are simulated using differentiable methods. The decoder then generates the predicted message from the noisy image. We demonstrate the simulation of dimension-reducing noise, such as cropping, without requiring the encoded image and the noisy image to have identical dimensions. Various attacks, including JPEG compression, crop, and Gaussian noise, are applied to the stego-image. Each non-identity noise layer is associated with a scalar hyperparameter to regulate the intensity of distortion: Crop retains a small portion of the pixels, Gaussian has a kernel width <bold><italic>&#x03C3;</italic></bold>, and JPEG has a quality factor <bold><italic>Q</italic></bold> &#x2208; (0,100).</p>
<p>To limit the information transmitted through specific frequency domain channels, we have developed noise layers that mimic JPEG compression. These layers utilize 8 &#x00D7; 8 stride 8 convolutional layers to implement the DCT transformation, with each filter corresponding to a basis vector in the DCT transform. As a result, the network activations represent the DCT domain coefficients of the encoded image. Subsequently, masking is applied to the DCT coefficients to constrain information flow. Transposed convolution is then used to perform inverse DCT transformation and generate the noisy image. JPEG-Mask applies a fixed mask, retaining only 25 low-frequency DCT coefficients in the one channel and 9 coefficients in the other two channels. Other coefficients are set to zero. This approach effectively produces models robust to actual JPEG compression.</p>
<p>During training, four models are trained using different noise layers: Crop ( <bold><italic>p</italic></bold> &#x003D; 0.035), Gaussian (<bold><italic>&#x03C3;</italic></bold> &#x003D; 2.0), JPEG-mask and JPEG-drop. These noise-resistant models are known as specialized models, as they are trained to withstand specific types of noise. Additionally, a noise-resistant combination model is trained by employing different noise layers for each mini-batch during training.</p>
<p>All models are trained on 10,000 cover images from the COCO dataset, adjusted to fit the dimensions of the specific experiment. Evaluation is conducted on a test set of 1000 images that were not used during training. Message sampling involves random bit extraction. For gradient descent, we utilize Adam with a learning rate of 0.001 and default hyperparameters. All models are trained in batches of 10, with the training lasting for 100 epochs.</p>
</sec>
<sec id="s2_1_3">
<label>2.1.3</label>
<title>Extracting Networks</title>
<p>The primary objective of the extraction network is to retrieve the secret image from the stego image, enabling the recovery of the concealed content. During model training, both the extraction network and the hidden network can be trained jointly. The stego-image, generated by the hidden network, undergoes various types of noise attacks to produce the attacked stego image. Upon receiving the noise-attacked stego-image, the extraction network conducts a series of convolution operations to extract the secret image and uncover the hidden message. The network structure is depicted in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. During convolution operations, the default convolution kernel size is 3 &#x00D7; 3 with a stride of 1.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Extracting network neural structure diagram</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-5.tif"/>
</fig>
</sec>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Loss Function</title>
<p>The overall model&#x2019;s loss function comprises three components: The content loss function (<italic>Lc</italic>), the style loss function (<italic>Ls</italic>), and the loss function (<italic>Le</italic>) for the secret image. The content loss is defined as the Euclidean distance between the target feature and the output image feature. The style loss is calculated based on the mean and standard deviation of the feature maps from both the style image and the hidden image. To achieve faster convergence and preserve the content features of the carrier image, the output <italic>T</italic> from AdaIN is utilized as the target feature to constrain the features of the generated image.</p>
<p>The content loss function <italic>Lc</italic> aims to constrain the generated stego image and preserve its content information. Thus, the loss function is represented by <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>L</mml:mi><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:msub><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The style loss function <italic>Ls</italic> primarily measures the degree of stylistic similarity between the style of the secret-containing image and the style image. Initially, the encoder is employed to acquire the feature maps of the secret image features <italic>f</italic><sub><italic>m</italic></sub> and the style image (<italic>s</italic>) in different layers. Subsequently, the mean and variance of these feature maps are computed. <italic>Ls</italic> is calculated as the sum of Euclidean distances between the mean and the variance, as depicted in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>L</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>+</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>As illustrated in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow></mml:math></inline-formula> represents the norm, <italic>A</italic> denotes the discriminator, <italic>G</italic> denotes the generator, <italic>N</italic> denotes the noise vector, and <italic>L</italic><sub><italic>G</italic></sub> represents the generator&#x2019;s loss function. The generator&#x2019;s objective is to induce the discriminator to classify the generated samples as real ones. The loss function <italic>L</italic><sub><italic>G</italic></sub> is computed by summing the squared errors of the discriminator outputs.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>L</mml:mi><mml:mi>G</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>To enhance the recovery effect of the secret image, the reconstruction loss function, <italic>Le</italic>, primarily measures the disparity between the original image and the extracted image. Here, <italic>g</italic> represents the distance between secret image (<italic>s</italic>) and extracted image (<inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mo>&#x2032;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>). The secret loss is expressed in <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>, <bold><italic>&#x03B1;</italic></bold> as a hyper-parameter.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>L</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mo>&#x2032;</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mi>L</mml:mi><mml:mi>G</mml:mi></mml:math></disp-formula></p>
<p>The overall loss function is a weighted combination of content loss, style loss, and secret image loss. The weight factors, <bold><italic>&#x03B2;</italic></bold> and <bold><italic>&#x03B3;</italic></bold>, control the significance of each loss term, as depicted in <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mi>L</mml:mi><mml:mi>c</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mi>L</mml:mi><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mi>L</mml:mi><mml:mi>e</mml:mi></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Experimental Results and Analysis</title>
<p>The experimental platform utilizes PyTorch 1.9, employs Python 3.7 as the programming language, and utilizes an RTX3080 graphics card with 12 GB of video memory. The dataset for the experimental secret image comprises the COCO number set, and the sample dataset is the ukiyoe2photo dataset. The size of each image is uniformly adjusted to 256 &#x00D7; 256, and the hyper-parameters are set to <bold><italic>&#x03B1;</italic> </bold>&#x003D; 0.05, <bold><italic>&#x03B2;</italic> </bold>&#x003D; 10, <bold><italic>&#x03B3;</italic> </bold>&#x003D; 10.</p>
<p>The algorithm proposed in this paper represents a robust improvement of the information hiding algorithm based on neural style migration. The primary focus is to enhance the utility of the algorithm in lossy channels.</p>
<p>In the comparison of image stylistic migration effect, the addition of the attack layer does not impact the stylistic effect of the stego-image. The robustness enhancement is primarily achieved by adding the attack layer after generating the stego-image, by which time the stylistic effect of the image has already been generated.</p>
<sec id="s3_1">
<label>3.1</label>
<title>The Visual Effect of the Image</title>
<p>The visual effect of an image serves as the most fundamental and intuitive evaluation index for information hiding algorithms. Four groups of images, including content images, style images, secret images, and stego-images along with extracted images, are randomly selected from the experimental results, as illustrated in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. And it demonstrates the algorithm&#x2019;s improved capability in achieving style migration and embedding secret information.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Image effect of the algorithm</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-6.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>The Quality of the Stego Image</title>
<p>To assess the quality of dense-containing images, a set of images subjected to various noise attacks is randomly chosen for residual analysis, depicted in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Residual analysis of encrypted images under different attacks</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-7.tif"/>
</fig>
<p>The residual information is then separated into the three color channels: Red (R), green (G), and blue (B). From <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, it is evident that the differences between the images in the three channels are minimal. This suggests that the image color is well-balanced, devoid of noticeable color deviation or brightness disparity. The details are more intact, without obvious loss or blurring. The image exhibits higher color accuracy and superior color reproduction. Therefore, it can be inferred that the density-containing image exhibits better quality.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Robustness Testing</title>
<p>To validate the quality of the extracted images, 200 sets of embedding experiments are conducted. Secret images are extracted after subjecting the 200 generated stego-images to various attacks, as depicted in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The extracted secret images are compared with the original ones.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Comparison of extracting images under different attacks</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-8.tif"/>
</fig>
<p>In this paper, Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity (SSIM) serve as measures to evaluate the efficacy of extracted secret images. A consistent noise attack is applied 1&#x2013;100 times to the same image. The PSNR and SSIM values of the extracted image post-attack are illustrated in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. The overall stability of the extracted images remains consistent, albeit with a decline in quality compared to the no-attack condition. The PSNR values are roughly distributed around 30 dB, indicating that the distortion loss of image quality is within an acceptable range. From the distribution of SSIM values, it can be seen that our algorithm can effectively resist attacks from Gaussian noise.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Scatter plots for extracting image quality after different attacks</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_50899-fig-9.tif"/>
</fig>
<p>Additionally, the algorithm presented in this paper is compared with other robust information hiding algorithms, as illustrated in <xref ref-type="table" rid="table-1">Tables 1</xref> and <xref ref-type="table" rid="table-2">2</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of PSNR of different algorithms</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Algorithm</th>
<th>Original image</th>
<th>JPEG compression</th>
<th>Crop</th>
<th>Gaussian blur</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td>30.48</td>
<td>/</td>
<td>/</td>
<td>/</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td>25.22</td>
<td>17.64</td>
<td>17.41</td>
<td>14.63</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>29.76</td>
<td>26.69</td>
<td>28.47</td>
<td>28.32</td>
</tr>
<tr>
<td>Ours</td>
<td>27.81</td>
<td>25.42</td>
<td>24.635</td>
<td>25.31</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparison of SSIM for different algorithms</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Algorithm</th>
<th>Original image</th>
<th>JPEG compression</th>
<th>Crop</th>
<th>Gaussian</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td>0.75</td>
<td>/</td>
<td>/</td>
<td>/</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td>0.867</td>
<td>0.634</td>
<td>0.625</td>
<td>0.498</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>0.916</td>
<td>0.875</td>
<td>0.895</td>
<td>0.905</td>
</tr>
<tr>
<td>Ours</td>
<td>0.970</td>
<td>0.874</td>
<td>0.823</td>
<td>0.913</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-1">Tables 1</xref> and <xref ref-type="table" rid="table-2">2</xref> reveal that, comparing to similar stylised relocation-based information hiding algorithms [<xref ref-type="bibr" rid="ref-17">17</xref>], the SSIM in this paper is significantly larger than that in the literature [<xref ref-type="bibr" rid="ref-17">17</xref>], albeit with a slightly smaller PSNR value. When compared with ADH-GAN [<xref ref-type="bibr" rid="ref-23">23</xref>] and Ying et al. [<xref ref-type="bibr" rid="ref-24">24</xref>], the image quality of the extracted images outperforms that of literature [<xref ref-type="bibr" rid="ref-23">23</xref>], but certain metrics are inferior to those of Ying et al.&#x2019;s algorithm. The disparity arises primarily because Ying et al.&#x2019;s algorithm gradually recovers the secret image through the residuals of the contained image and the carrier image. In contrast, the algorithm presented in this paper is tested by attacking the stylised contained image, which precludes the use of gradual recovery for image extraction. Instead, it adopts direct extraction. Additionally, both style conversion and noise attack result in damage to the secret image, making extraction more challenging.</p>

</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Analysis of Embedding Capacity</title>
<p>Regarding hiding capacity, the algorithm presented in this paper embeds a 256 &#x00D7; 256 color image into a 256 &#x00D7; 256 style image. In other words, each pixel can conceal 24 bits, resulting in a hiding capacity of 24 bpp.</p>
<p>As depicted in <xref ref-type="table" rid="table-3">Table 3</xref>, the algorithm presented in this paper exhibits a significantly larger embedding capacity when compared with similar style migration-based information hiding algorithms in literature [<xref ref-type="bibr" rid="ref-16">16</xref>] and literature [<xref ref-type="bibr" rid="ref-17">17</xref>]. In literature [<xref ref-type="bibr" rid="ref-23">23</xref>], to ensure the robustness and imperceptibility of the target image, the maximum embedded secret pixel ratio should be designed to be less than 0.5. In literature [<xref ref-type="bibr" rid="ref-24">24</xref>], while the embedding capacity for a single secret image is 24 bpp, the proposed method involves embedding multiple secret images. Based on this, in subsequent stages, the embedding capacity is expected to surpass 24 bpp when embedding multiple secret images. In literature [<xref ref-type="bibr" rid="ref-24">24</xref>], while the embedding capacity for a single secret image is 24 bpp, the proposed method involves embedding multiple secret images. The embedding capacity for multiple secret images is expected to surpass 24 bpp.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparison of embedding capacity of different algorithms</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Algorithm</th>
<th>Content image (pixel)</th>
<th>Secret image (bit)</th>
<th>Capacity (bpp)</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-16">16</xref>]</td>
<td>Arbitrary</td>
<td>Arbitrary</td>
<td>0.4</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td>256 &#x00D7; 256</td>
<td>256 &#x00D7; 256 &#x00D7; 8</td>
<td>8</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td>256 &#x00D7; 256</td>
<td>&#x003C;256 &#x00D7; 128 &#x00D7; 24</td>
<td>&#x003C;12</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>256 &#x00D7; 256</td>
<td>256 &#x00D7; 256 &#x00D7; 24</td>
<td>24</td>
</tr>
<tr>
<td>Ours</td>
<td>256 &#x00D7; 256</td>
<td>256 &#x00D7; 256 &#x00D7; 24</td>
<td>24</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Security Analysis</title>
<p>The secure transmission of confidential images holds paramount importance in the realm of information hiding. Unlike traditional information hiding algorithms, which focus on detecting whether an image contains concealed information, steganalysis in neural style migration-based techniques faces the unique challenge of distinguishing between stylized images and confidential ones. This is because the stylization process inherently serves as a form of protection for the confidential image. By altering the pixels of the image, the stylization effectively masks any modifications made to the confidential content, rendering steganalysis significantly more challenging.</p>
<p>In addition, during the robustness testing, it was demonstrated through residual analysis that the noise attack does not pose a threat to the security of the secret image. Therefore, the generated image containing the secret image can be deemed secure.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>This paper proposes a robust information embedding scheme for style migration based on neural networks. The scheme achieves color secret image stylization and enhances the algorithm&#x2019;s attack layer. This enhancement effectively withstands noise attacks in real environments with lossy channels, thereby improving the robustness of the hiding algorithm through training. Experimental results demonstrate that, compared to other robust information hiding algorithms, this paper enhances algorithm robustness while ensuring large capacity and security.</p>
<p>Additionally, experiments on concealing multiple images within one image, while ensuring robustness, it should be conducted in the next phase.</p>
</sec>
</body>
<back>
<ack><p>The authors are highly thankful to the National Natural Science Foundation of China.</p>
</ack>
<sec><title>Funding Statement</title>
<p>The authors are highly thankful to the National Natural Science Foundation of China (Nos. 62272478, 61872384). Natural Science Foundation of Shanxi Province (No. 2023-JC-YB-584). This work is also supported by National Natural Science Foundation of China (No. 62172436) and Engineering University of PAP&#x2019;s Funding for Scientific Research Innovation Team, Engineering University of PAP&#x2019;s Funding for Key Researcher (No. KYGG202011).</p>
</sec>
<sec><title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: Study conception and design: X. Zhang, M. Zhang, X. Wang; data collection: W. Jiang, C. Jiang; analysis and interpretation of results: P. Yang; draft manuscript preparation: X. Zhang. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Kaplan</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Johnson</surname></string-name>, and <string-name><given-names>F. L.</given-names> <surname>Hidden</surname></string-name></person-group>, &#x201C;<article-title>Hiding data with deep networks</article-title>,&#x201D; in <conf-name>Proc. ECCV</conf-name>, <publisher-loc>Munich, Germany</publisher-loc>, <year>2018</year>, pp. <fpage>682</fpage>&#x2013;<lpage>697</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. C.</given-names> <surname>Hou</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Ou</surname></string-name>, <string-name><given-names>H. W.</given-names> <surname>Tian</surname></string-name>, and <string-name><given-names>Z.</given-names> <surname>Qin</surname></string-name></person-group>, &#x201C;<article-title>Reversible data hiding based on multiple histograms modification and deep neural networks</article-title>,&#x201D; <source>Signal Process.: Image Commun.</source>, vol. <volume>92</volume>, no. <issue>2</issue>, pp. <fpage>116118</fpage>, <year>2021</year>. doi: <pub-id pub-id-type="doi">10.1016/j.image.2020.116118</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Meng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Peng</surname></string-name>, and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>A data hiding scheme based on U-Net and wavelet transform</article-title>,&#x201D; <source>Knowl. Based Syst.</source>, vol. <volume>223</volume>, no. <issue>6</issue>, pp. <fpage>107022</fpage>, <year>Apr. 2021</year>. doi: <pub-id pub-id-type="doi">10.1016/j.knosys.2021.107022</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. R.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>R. B.</given-names> <surname>Krishnan</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Manikandan</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Subramaniyaswamy</surname></string-name>, and <string-name><given-names>K.</given-names> <surname>Kotecha</surname></string-name></person-group>, &#x201C;<article-title>Reversible data hiding scheme using deep learning and visual cryptography for medical image communication</article-title>,&#x201D; <source>J. Electron. Imaging</source>, vol. <volume>31</volume>, no. <issue>6</issue>, pp. <fpage>63028</fpage>, <year>Nov. 2022</year>. doi: <pub-id pub-id-type="doi">10.1117/1.JEI.31.6.063028</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Fridrich</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Goljan</surname></string-name>, and <string-name><given-names>R.</given-names> <surname>Du</surname></string-name></person-group>, &#x201C;<article-title>Detecting lsb steganography in color, and gray-scale images</article-title>,&#x201D; <source>IEEE Multimed.</source>, vol. <volume>8</volume>, no. <issue>4</issue>, pp. <fpage>22</fpage>&#x2013;<lpage>28</lpage>, <year>Nov. 2001</year>. doi: <pub-id pub-id-type="doi">10.1109/93.959097</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Yun</surname></string-name>, and <string-name><given-names>W.</given-names> <surname>Cheng</surname></string-name></person-group>, &#x201C;<article-title>Image watermarking in DCT: An embedding strategy and algorithm</article-title>,&#x201D; (in Chinese), <source>Acta Electonica Sinica</source>, vol. <volume>28</volume>, no. <issue>4</issue>, pp. <fpage>57</fpage>, <year>Apr. 2000</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>Q.</given-names> <surname>Zheng</surname></string-name></person-group>, &#x201C;<article-title>Audio steganography algorithm based on lifting wavelet transform and matrix coding</article-title>,&#x201D; <source>(in Chinese), Comput. Appl.</source>, vol. <volume>29</volume>, no. <issue>11</issue>, pp. <fpage>2942</fpage>&#x2013;<lpage>2945</lpage>, <year>Dec. 2009</year>. doi: <pub-id pub-id-type="doi">10.3724/SP.J.1087.2009.02942</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Bhuiyan</surname></string-name>, <string-name><given-names>A. H.</given-names> <surname>Sarower</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Karim</surname></string-name>, and <string-name><given-names>M.</given-names> <surname>Hassan</surname></string-name></person-group>, &#x201C;<article-title>An image steganography algorithm using LSB replacement through XOR substitution</article-title>,&#x201D; in <conf-name>Proc. IEEE ICOIACT</conf-name>, <year>Aug. 2019</year>, pp. <fpage>44</fpage>&#x2013;<lpage>49</lpage>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Liao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Chen</surname></string-name>, and <string-name><given-names>Z.</given-names> <surname>Qin</surname></string-name></person-group>, &#x201C;<article-title>Adaptive payload distribution in multiple images steganography based on image texture features</article-title>,&#x201D; <source>IEEE Trans. Dependable Secure Comput.</source>, vol. <volume>19</volume>, no. <issue>2</issue>, pp. <fpage>897</fpage>&#x2013;<lpage>911</lpage>, <year>2020</year>. doi: <pub-id pub-id-type="doi">10.1109/TDSC.2020.3004708</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Liao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Li</surname></string-name>, and <string-name><given-names>Z.</given-names> <surname>Qin</surname></string-name></person-group>, &#x201C;<article-title>A new payload partition strategy in color image steganography</article-title>,&#x201D; <source>IEEE Trans. Circuits Syst. Video Technol.</source>, vol. <volume>30</volume>, no. <issue>3</issue>, pp. <fpage>685</fpage>&#x2013;<lpage>696</lpage>, <year>2019</year>. doi: <pub-id pub-id-type="doi">10.1109/TCSVT.2019.2896270</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Lecun</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Bottou</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Bengio</surname></string-name>, and <string-name><given-names>P.</given-names> <surname>Haffner</surname></string-name></person-group>, &#x201C;<article-title>Gradient-based learning applied to document recognition</article-title>,&#x201D; <source>Proc. IEEE</source>, vol. <volume>86</volume>, no. <issue>11</issue>, pp. <fpage>2278</fpage>&#x2013;<lpage>2324</lpage>, <year>1998</year>. doi: <pub-id pub-id-type="doi">10.1109/5.726791</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Fan</surname></string-name>, and <string-name><given-names>Q. M. J.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>Faster-rcnn based robust coverless information hiding system in cloud environment</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>179891</fpage>&#x2013;<lpage>179897</lpage>, <year>Nov. 2019</year>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2955990</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Si</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Qin</surname></string-name>, and <string-name><given-names>H.</given-names> <surname>Yao</surname></string-name></person-group>, &#x201C;<article-title>Robust coverless data hiding based on texture classification and synthesis</article-title>,&#x201D; <source>(in Chinese), J. Appl. Sci.</source>, vol. <volume>38</volume>, no. <issue>3</issue>, pp. <fpage>441</fpage>&#x2013;<lpage>454</lpage>, <year>2020</year>. doi: <pub-id pub-id-type="doi">10.3969/j.issn.0255-8297.2020.03.010</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L. A.</given-names> <surname>Gatys</surname></string-name>, <string-name><given-names>A. S.</given-names> <surname>Ecker</surname></string-name>, and <string-name><given-names>M.</given-names> <surname>Bethge</surname></string-name></person-group>, &#x201C;<article-title>Image style transfer using convolutional neural networks</article-title>,&#x201D; in <conf-name>Proc. CVPR</conf-name>, <publisher-loc>Las Vegas, Nevada</publisher-loc>, <year>2016</year>, pp. <fpage>2414</fpage>&#x2013;<lpage>2423</lpage>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Jing</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Feng</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ye</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yu</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Song</surname></string-name></person-group>, &#x201C;<article-title>Neural style transfer: A review</article-title>,&#x201D; <source>IEEE Trans. Vis. Comput. Graph</source>, vol. <volume>26</volume>, no. <issue>11</issue>, pp. <fpage>3365</fpage>&#x2013;<lpage>3385</lpage>, <year>2019</year>. doi: <pub-id pub-id-type="doi">10.1109/TVCG.2019.2921336</pub-id>; <pub-id pub-id-type="pmid">31180860</pub-id></mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Xiang</surname></string-name>, and <string-name><given-names>G.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>STNet: A style transformation network for deep image steganography</article-title>,&#x201D; in <conf-name>Proc. ICONIP</conf-name>, <publisher-loc>Sydney, NSW, Australia</publisher-loc>, <year>2019</year>, pp. <fpage>3</fpage>&#x2013;<lpage>14</lpage>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Bi</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Wang</surname></string-name>, and <string-name><given-names>J.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>High-capacity image steganography algorithm based on image style transfer</article-title>,&#x201D; <source>Secur. Commun. Netw.</source>, vol. <volume>2021</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2021</year>. doi: <pub-id pub-id-type="doi">10.1155/2021/4179340</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Belongie</surname></string-name></person-group>, &#x201C;<article-title>Arbitrary style transfer in real-time with adaptive instance normalization</article-title>,&#x201D; in <conf-name>Proc. ICCV</conf-name>, <publisher-loc>Venice, Italy</publisher-loc>, <year>2017</year>, pp. <fpage>1501</fpage>&#x2013;<lpage>1510</lpage>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, and <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Image steganography based on style transfer</article-title>,&#x201D; <comment>arXiv preprint arXiv:2203.04500</comment>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Ge</surname></string-name>, and <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Color image information hiding algorithm based on style transfer process</article-title>,&#x201D; <source>Comput. Appl.</source>, vol. <volume>46</volume>, no. <issue>6</issue>, pp. <fpage>1730</fpage>&#x2013;<lpage>1735</lpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Simonyan</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Zisserman</surname></string-name></person-group>, &#x201C;<article-title>Very deep convolutional networks for large-scale image recognition</article-title>,&#x201D; <comment>arXiv preprint arXiv:1409.1556</comment>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Szegedy</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Going deeper with convolutions</article-title>,&#x201D; in <conf-name>Proc. CVPR</conf-name>, <publisher-loc>Boston, USA</publisher-loc>, <year>2015</year>, pp. <fpage>1</fpage>&#x2013;<lpage>9</lpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Yu</surname></string-name></person-group>, &#x201C;<article-title>Attention based data hiding with generative adversarial networks</article-title>,&#x201D; in <source>Proc. AAAI Conf. Artif. Intell.</source>, vol. <volume>34</volume>, no. <issue>1</issue>, pp. <fpage>1120</fpage>&#x2013;<lpage>1128</lpage>, <year>2020</year>. doi: <pub-id pub-id-type="doi">10.1609/aaai.v34i01.5463</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Ying</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zeng</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Qian</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Hiding images into images with real-world robustness</article-title>,&#x201D; in <conf-name>Proc. ICIP</conf-name>, <publisher-loc>Tel Aviv, Israel</publisher-loc>, <year>2022</year>, pp. <fpage>111</fpage>&#x2013;<lpage>115</lpage>.</mixed-citation></ref>
</ref-list>
</back></article>