<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A New Approach to Reducing the Distortion of the Digital Image Natural Model in the DCT Domain When Embedding Information According to the QIM Method</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>National Research University Higher School of Economics</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>O.O. Evsutin</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Tomsk State University of Control Systems and Radioelectronics</institution>
          ,
          <addr-line>Tomsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>One of the areas of digital image processing is the steganographic embedding of additional information into them. Digital steganography methods are used to ensure the information confidentiality, as well as to track the distribution of digital content on the Internet. Main indicators of the steganographic embedding effectiveness are invisibility to the human eye, characterized by the PSNR metric, and embedding capacity. However, even with full visual stealth of embedding, its presence may produce a distortion of the digital image natural model in the frequency domain. The article presents a new approach to reducing the distortion of the digital image natural model in the field of discrete cosine transform (DCT) when embedding information using the classical QIM method. The results of the experiments show that the proposed approach allows reducing the distortion of the histograms of the distribution of DCT coefficients, and thereby eliminating the unmasking signs of embedding.</p>
      </abstract>
      <kwd-group>
        <kwd>information security</kwd>
        <kwd>steganography</kwd>
        <kwd>digital images</kwd>
        <kwd>discrete cosine transform</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>One of the promising areas for solving the problem of
ensuring information security of multimedia data is the use of
digital steganography and digital watermarking (DWM)
technique, which allow you to hide additional information of
various purposes in digital objects, in particular, in digital
images.</p>
      <p>The methods for embedding information in digital images are
divided into methods for embedding in the spatial domain and in
the frequency domain of digital images. In practice, the use of
embedding methods in the frequency domain is more effective,
since such embedding in the general case provides greater
resistance to various destructive influences. However, most of
the known frequency embedding algorithms lead to significant
distortions of a digital image natural model in the frequency
domain. Such distortions are an unmasking feature that reduces
the stability of the steganographic algorithm before steganalysis,
aimed at identifying the presence of embedded additional
information in digital objects. Using steganalysis methods, an
intruder can detect the presence of an embedded message in a
given stego-image and subsequently compromise or destroy it.</p>
      <p>
        In general case, steganalysis of digital images is considered
as a two-class classification problem. Many modern methods of
steganalysis are the development of a classical study [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], which
proposes a set of features for conducting steganalysis. The
studies presented in articles [
        <xref ref-type="bibr" rid="ref5 ref8">5, 8</xref>
        ] are aimed at minimizing
distortions of the natural model of digital images by using
various feature spaces. The articles [
        <xref ref-type="bibr" rid="ref2 ref6">2, 6</xref>
        ] are devoted to
steganalysis, the improvement of steganographic algorithms to
counteract it and the expansion of feature spaces.
      </p>
      <p>This article proposes a new approach to reducing the
distortions of the digital image natural model in the discrete
cosine transform (DCT) domain by the steganographic
embedding of information. Embedding is performed according
to an algorithm based on the popular steganographic method of
quantization index modulation (QIM). The idea of the proposed
approach consists in adaptive selection of the quantization step
(the main parameter of the classical QIM method) depending on
the characteristics of a particular cover image. The aim of the
work is to study the effectiveness of this approach and its specific
algorithmic implementations.</p>
    </sec>
    <sec id="sec-2">
      <title>2. The embedding operation</title>
      <p>
        Embedding operation, i.e. operation of direct changes in the
values of frequency coefficients, is based on the QIM method.
The idea of the QIM method [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] is to modulate the brightness of
the pixels or the values of the frequency coefficients depending
on the values of the embedded bits. In this study, the QIM method
is used to embed information in DCT coefficients. Images are
processed in blocks of 8 × 8 pixels. The embedding area consists
of 36 high- and mid-frequency AC-coefficients. The embedding
of information is carried out by the formula
      </p>
      <p> c 
c  q    
 q 
q</p>
      <p> b ,
2 i
where c is the DCT coefficient before embedding, c – is the
DCT coefficient after embedding, b is the secret message bit,
i
q is the quantization step.</p>
      <p>
        The algorithm used in this study is distinguished by the
possibility of error-free extraction of embedded information due
to an iterative embedding procedure. Since this feature of the
algorithm does not affect the distortion of the digital image
natural model in the frequency domain, typical for the QIM
method, we shall omit its description. The authors of this study
give more information on the principle of iterative correction of
extraction errors by example of the discrete Fourier transform in
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Proposed Approach</title>
      <p>The application of the QIM method to the DCT domain is
associated with the problem of distortion of the digital image
natural model. In the present work, as a digital image natural
model in the DCT domain we mean a histogram of distribution
of the DCT coefficient values. An example of a typical histogram
of DCT-coefficients of the image is shown in Fig. 1 (a).</p>
      <p>
        If we embed a message in the corresponding image using the
QIM method with a predefined quantization step q , the
histogram of the DCT coefficients will take the form shown in
Fig. 1 (b). The obtained histogram is markedly different from the
original. This is due to the fact that the classical QIM method
narrows the number of possible variants of the DCT coefficient
values [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        One of the solutions to this problem was previously proposed
by the authors of this study in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], where to redistribute the
a)
b)
c)
8000
s 6000
e
u
l
a
v
f
o
re 4000
b
m
u
n
e
hT2000
Fig. 1. The histogram of the image: a) before the embedding; b)
after the embedding with a constant quantization step; c) after
the embedding with a variable quantization step from [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>This study proposes to develop the idea of using the ratio of
domains within a block to select a quantization step.</p>
      <p>
        Obviously, the embedding area undergoes the most
significant distortions. At the same time, a change in the
nonembedding area, i.e. in the other AC-coefficients of the block is
negligible. Therefore, to select the quantization step, it is
proposed to use the non-embedding area of the corresponding
block. The invariance of the non-embedding area will allow to
extract embedded data without errors, since the quantization step
selected over the non-embedding area will be the same for both
the cover and the stego-images. It does not require knowledge of
any additional key information. This means that the transmission
of the stego-image does not require a preliminary exchange of
keys, the presence of which would contradict the very idea of
arising distortions of the histogram, the quantization step was
variable and depended on the ratio of the average values of the
AC-coefficients moduli of the one-dimensional DCT in and out
of the embed area. This approach demonstrated a positive effect
on the compensation of distortions of the histogram, but the
problem was not completely solved. The form of the histogram
for a number of images still made it possible to unambiguously
determine the presence of a steganographic attachment. Fig. 1 (c)
demonstrates the influence of the approach described in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] on
the reduction of histogram distortions.
steganography due to the compromise of the fact of the hidden
transmission of information.
      </p>
      <p>In order to decide how the non-embedding area can be
interconnected with the value q , it is necessary to pay attention
on the nature of the distortions that arise when embedding
information with a constant quantization step. The histogram in
Fig. 1 (b) corresponds to the stego-image obtained with q  8 .
The peaks that appear in the histogram correspond to the values
 4 , i.e.  q 2 . So, a certain predetermined value leads to the
fact that the frequency of occurrence of values equal to  q 2
increases. To reduce the probability that some new value of the
quantization step for the next block will coincide with the most
frequently occurring value of DCT coefficients, i.e. in order not
to enhance the growth of possible peaks in the histogram, it is
proposed to choose the least frequently encountered value of
DCT coefficients from the non-embedding area as the value of
the quantization step. It should be defined more exactly that the
quantization step is a positive integer, while the DCT coefficients
are real values; therefore, to select the next quantization step, the
DCT coefficients from the non-embedding area must be taken
modulo and rounded (an example is shown in Fig. 2). To
determine the least common values of DCT coefficients, it is
necessary to construct a histogram of the distribution of their
converted values over the non-embedding area.</p>
      <p>-16,9 -8,4 -0,6 2,4 5,2 0,4</p>
      <p>The authors of the study considered two options for choosing
the quantization step based on the obtained histogram of the
nonembedding area:
‒ from a group of values with a frequency not exceeding
the set one;
‒ from all values of the non-embedding area.</p>
      <p>To implement the first option, it is necessary to pre-set the
threshold for the frequency of occurrence of rounded absolute
values of the DCT coefficients, among which the quantization
step will be selected. Then the values that occur no more often
than the quantity of the threshold value will form a group. The
quantization step will be equal to the smallest value in the group.
The second option does not require explicitly setting a threshold
value. In this case, the smallest of the most rarely found values
in the block is selected as the quantization step.</p>
      <p>These approaches are somewhat similar, since in both cases
the decision to select the quantization step is made using the
threshold value of the frequency of occurrence of DCT
coefficients. However, the fundamental difference between them
is that the first option operates on a single threshold value for all
image blocks, while the second option uses different threshold
values for different blocks.</p>
      <p>It is empirically found that the choice of a quantization step
of less than three provides a very small capacity, insufficient for
effective operation, and the selection of a quantization step of
more than twenty leads to a significant deterioration in the visual
quality of images, therefore we introduce the condition:
3  q  20 .</p>
      <p>Fig. 3 shows an example of selecting a quantization step q
over the non-embedding area for both variants. In the first case,
the choice of q is made according to a group of values, the
4
4
se3
u
l
a
v
ro2 2
f
e
b
m
u
n1
e
h
T
0
occurrence frequency of which should be no more than two. The
smallest among these values is three, therefore q  3 . In the
second case, the lowest frequency of occurrence of individual
values should be firstly determined, in this case it is equal to one.
Then from the values encountered only once, the smallest is
selected, and in the end q  7 .</p>
    </sec>
    <sec id="sec-4">
      <title>4. The results of the experiments</title>
      <p>To evaluate the effectiveness of the proposed approach and
to compare the two options described above, computing
experiments were conducted. For the experiments, 20 classic test
images of 512 × 512 pixels in grayscale were taken from the
“USC-SIPI Image Database”.</p>
      <p>When evaluating the effectiveness, such standard
characteristics as capacity is used, i.e. the ratio of the number of
embedded bits to the size of the container, and the PSNR metric,
which is calculated by the formula
 255 
PSNR  20 log10  RMSE </p>
      <p> ,
RMSE 
1 n
n i1 Pi  Q1 2 ,
where n is the total number of pixels, Pi is the pixel value of
the cover image, Qi is the pixel value of the stego-image.</p>
      <p>Since when choosing a quantization step over a group, its
value is on average less than when choosing it over the entire
non-embedding area, the algorithm capacity when using the first
option is much lower. So, the maximum capacity for the first
option is an average of 201 bit/pixel over 20 test images, with the
corresponding average PSNR of 36.19 dB, while for the second
option, the average capacity is 0.34 bits/pixel with a PSNR of
35.63 dB. The comparison of the histogram of the container, the
histogram of the stego-image obtained with a constant
quantization step q  8 at the maximum capacity, and the
histogram of the stego-image obtained using the second option at
the maximum capacity is shown in Fig. 4. The form of the
histogram of the stego-image obtained using the selection of q
over the non-embedding area is close to the form of the histogram
of the container. However, for a correct assessment of the
effectiveness of the proposed approach and both its variants, the
a)
capacity in all cases was further set equal to the capacity obtained
in the case of a selection over a group.</p>
      <p>0
-80 -60 -40 -20 0 20 40 60 80</p>
      <p>The DCT coefficient values
Fig. 4. Histograms for the “Airplane” image: a) container; b)
stego-image (constant q , maximum capacity); c) stego-image
(new approach, option No. 2, maximum capacity).</p>
      <p>Fig. 5 and Fig. 6 present the results of comparing the
histograms for the “Airplane” and “Baboon” images obtained for
the cover and stego-images with different options for choosing
the quantization step. For the “Airplane” test image, the
embedding capacity is 0.29 bit / pixel, for the “Baboon” test
image, it is 0.11 bit / pixel. These images are selected as
examples, as they belong to different types: the “Airplane” image
contains many one-colour areas, while the “Baboon” image has
a high degree of detail.</p>
      <p>According to Fig. 5 and Fig. 6, the application of the
proposed approach significantly reduces the distortions that
occur when embedding information. The histograms shown in
Fig. 5 (b) and Fig. 6 (b) unambiguously show the presence of a
steganographic embedding in the corresponding images ( q  8 )
while histograms corresponding to stego-images obtained with
the proposed approach conform with the natural form of the
histograms of cover images. So we can conclude that the
proposed approach can reduce the distortions of the digital image
natural model in the frequency domain, and therefore, increase
the imperceptibility of embedding.
a)
b)
c)
d)</p>
      <p>To evaluate the differences of the histograms numerically,
the value of the RMSE metric between the histograms of the
cover images and the corresponding stego-images was
calculated. On average, for 20 test images, the RMSE value
between the histograms of cover and stego-images obtained with
a constant q  8 was 1017,80, for the “Airplane” and the
“Baboon” images it was 513,13 and 268,55 respectively. The
results for the first option of the variable q : 565.81 on average,
799.21 for "Airplane", 184.76 for "Baboon". Results for the
second variant of the variable q : 598.06 on average, 680.40 for
the “Airplane”, 288.72 for the “Baboon”. It can be concluded that
the differences between the histograms of cover and
stegoimages are much smaller when using a variable q. The choice of
quantization step over a group (the first option) demonstrates an
average RMSE value less than for all values (the second option),
but the difference between them is not significant. It is also worth
noting that the second option allows you to provide a larger
embedding capacity, so the first option is preferable with a small
embedment volume, but you should use the second option if you
need to embed a larger message.</p>
      <p>The analysis of the presented histograms showed that, on the
one hand, they do not contain characteristic peaks, and, on the
other hand, the proposed approach allows us to restore exactly
the natural form of the initial histograms and does not lead to
excessive “uniformity”, which could also become an unmasking
sign.</p>
      <p>-80 -60 -40 -20 0 20 40</p>
      <p>The DCT coefficient values
60
80
-80 -60 -40 -20 0 20 40</p>
      <p>The DCT coefficient values
60
80
-80 -60 -40 -20 0 20 40</p>
      <p>The DCT coefficient values
60
80
-80 -60 -40 -20 0 20 40</p>
      <p>The DCT coefficient values
60
80
Fig. 6. Histograms for the “Baboon” image: a) container; b)
stego-image (constant q ); c) stego-image (new approach,
option No. 1); d) stego-image (new approach, option No. 2.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>The article presented and investigated a new approach to
reducing the distortions of a digital image natural model in the
DCT domain when embedding information using the QIM
method. As it can be seen from the results of the experiments, the
application of this approach has a positive effect on reducing the
unmasking signs of the embedding in the frequency domain. In
the future, it is planned to continue work to reduce the distortions
of the natural model of images in the frequency domain by
adapting the embedding parameters to a specific container.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Acknowledgments</title>
      <p>This work was financially supported by a grant from the
Russian Foundation for Basic Research and the Tomsk Region
in the framework of project No. 19-47-703003 and financially
supported by a grant from the Russian Foundation for Basic
Research in the framework of project No. 18-29-22104.</p>
    </sec>
    <sec id="sec-7">
      <title>7. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Evsutin</surname>
            <given-names>O.O.</given-names>
          </string-name>
          <article-title>Steganographic embedding of information into the frequency domain of the DCT of digital images using the QIM method with variable quantization step / O.</article-title>
          <string-name>
            <surname>O. Evsutin</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          <string-name>
            <surname>Kokurina</surname>
          </string-name>
          , R.V. Meshcheryakov //
          <source>Proceedings of the 28th International Conference on Computer Graphics and Vision «GraphiCon</source>
          <year>2018</year>
          ». -
          <fpage>2018</fpage>
          . - Russia, Tomsk. -
          <volume>297</volume>
          -300.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Denemark</surname>
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Steganalysis</surname>
          </string-name>
          <article-title>Features for Content-Adaptive JPEG Steganography / T</article-title>
          . Denemark,
          <string-name>
            <given-names>M.</given-names>
            <surname>Boroumand</surname>
          </string-name>
          , J. Fridrich // IEEE Transactions on Information Forensics and
          <string-name>
            <surname>Security</surname>
          </string-name>
          . -
          <year>2016</year>
          . - Vol.
          <volume>11</volume>
          (
          <issue>8</issue>
          ). - P.
          <fpage>1736</fpage>
          -
          <lpage>1746</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Evsutin</surname>
            <given-names>O.</given-names>
          </string-name>
          <article-title>The adaptive algorithm of information unmistakable embedding into digital images based on the discrete Fourier transformation / O.</article-title>
          <string-name>
            <surname>Evsutin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Kokurina</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Meshcheryakov</surname>
          </string-name>
          , O. Shumskaya // Multimedia Tools and
          <string-name>
            <surname>Applications</surname>
          </string-name>
          . - 2018. - Vol.
          <volume>77</volume>
          (
          <issue>21</issue>
          ). - P.
          <fpage>28567</fpage>
          -
          <lpage>28599</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Fridrich</surname>
            <given-names>J.</given-names>
          </string-name>
          <article-title>Feature-Based Steganalysis for JPEG Images and its Implications for Future Design</article-title>
          of Steganographic Schemes // Lecture Notes in Computer Science. -
          <year>2004</year>
          . - Vol.
          <volume>3200</volume>
          . - P.
          <fpage>67</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Holub</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Universal</surname>
          </string-name>
          <article-title>Distortion Function for Steganography in an Arbitrary Domain / V. Holub</article-title>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fridrich</surname>
          </string-name>
          , T. Denemark //
          <source>EURASIP Journal on Information Security. - 2014</source>
          . -
          <fpage>№</fpage>
          1. - P.
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Kodovsky</surname>
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Ensemble</surname>
          </string-name>
          <article-title>Classifiers for Steganalysis of Digital Media /</article-title>
          J. Kodovsky,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fridrich</surname>
          </string-name>
          , V. Holub // IEEE Transactions on Information Forensics and
          <string-name>
            <surname>Security</surname>
          </string-name>
          . -
          <year>2012</year>
          . - Vol.
          <volume>7</volume>
          (
          <issue>2</issue>
          ). - P.
          <fpage>432</fpage>
          -
          <lpage>444</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Mitekin</surname>
            <given-names>V.</given-names>
          </string-name>
          <article-title>A new QIM-based watermarking algorithm robust against multi-image histogram attack / V.</article-title>
          <string-name>
            <surname>Mitekin</surname>
          </string-name>
          , V. Fedoseev // Procedia Engineering.
          <article-title>-</article-title>
          <year>2017</year>
          . - Vol.
          <volume>201</volume>
          . - P.
          <fpage>453</fpage>
          -
          <lpage>462</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Sedighi</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Content-Adaptive Steganography</surname>
            by Minimizing Statistical Detectability // V. Sedighi,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Cogranne</surname>
          </string-name>
          , J. Fridrich // IEEE Transactions on Information Forensics and
          <string-name>
            <surname>Security</surname>
          </string-name>
          . -
          <year>2016</year>
          . -Vol.
          <volume>11</volume>
          (
          <issue>2</issue>
          ). - P.
          <fpage>221</fpage>
          -
          <lpage>234</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>