<!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>
      <journal-title-group>
        <journal-title>X. Sun, Z. Chen, L. Wang, C. He, A lossless image compression and encryption algorithm combining
jpeg-ls, neural network and hyperchaotic system, Nonlinear Dynamics</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1109/TCSET49122.2020.235540</article-id>
      <title-group>
        <article-title>Technique for encoding clustered transformants in diferentially-normalized space</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Volodymyr Barannik</string-name>
          <email>volodymyr.barannik@nure.ua</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Evgeniy Eliseev</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kyrylo Revva</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mykhailo Babenko</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksandr Yudin</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksii Yudin</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yurii Tsimura</string-name>
          <email>tsimur@ukr.net</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dniprovsk State Technical University</institution>
          ,
          <addr-line>Dniprobudivska Str.,2, Kamyanske, 51900</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Heroes of Kruty Military Institute of Telecommunications and Informatization</institution>
          ,
          <addr-line>Ostrozkyh Knyaziv Str., 45/1, Kyiv, 01011</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Kharkiv National University of Radio Electronics</institution>
          ,
          <addr-line>Nauky Ave., 14, Kharkiv, 61166</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>State Scientific and Research Institute of Cybersecurity Technologies and Information Protection</institution>
          ,
          <addr-line>M. Zaliznyak Str., 3/6, Kyiv, 03142</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>V. N. Karazin Kharkiv National University</institution>
          ,
          <addr-line>Svobody Square, 4, Kharkiv, 61022</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>111</volume>
      <issue>2023</issue>
      <fpage>699</fpage>
      <lpage>702</lpage>
      <abstract>
        <p>The article shows that one of the main purposes of projects for the development of informatization of the state is the proper provision of the necessary information to the centers of analysis and decision-making. It is important to comply with the requirements for the timeliness, reliability and security of information delivery processes. The necessity for the formation of homogeneity spaces for the group of transformants of the general video stream for the implementation of the possibility of accounting for inter-transformant dependencies in the SPD of arrays of spectral elements is substantiated. A model for constructing homogeneity spaces (clusters) from the transformant group based on the power of the SP by the number of spectral SP has been developed. This creates the conditions for the implementation of the compression procedure with the additional removal of the amount of inter-transformant redundancy in the SPD-transformant.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;video encoding</kwd>
        <kwd>transformant</kwd>
        <kwd>compression</kwd>
        <kwd>reduction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        One of the main objectives of state informatization projects is to adequately provide decision-making and
analysis centers with necessary information [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. It is crucial to meet the requirements for timeliness,
reliability, and security in the information delivery processes [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ]. In modern conditions, monitoring
objects are often located far from the analysis centers that assess their condition. This necessitates the
development of remote information collection and transmission means using various technological
solutions. Unmanned systems have become particularly in demand [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This is due to several advantages
that these systems ofer for monitoring hard-to-reach areas or regions experiencing emergencies [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ].
Consequently, this approach to information provision is actively utilized by governmental organizations
and relevant ministries. Therefore, unmanned systems (UAS) play an important role in the overall chain
of organizing information support for decision-making subsystems. As a result, certain requirements
are set regarding the performance characteristics of UAS, such as the generation of the initial format of
digitized images, processing, and transmission of information [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ].
      </p>
      <p>
        It is important to note that these UAS characteristics depend on many factors, including the external
conditions of monitoring and internal factors such as the energy capacity and payload of the UAS [
        <xref ref-type="bibr" rid="ref11 ref12 ref13 ref14 ref15">11, 12,
13, 14, 15</xref>
        ]. In practice, such factors often limit the capabilities of the UAS telecommunication equipment.
Consequently, the timeliness and reliability of information transmission are feasible only for lower-level
image formats [16, 17].
      </p>
      <p>On the other hand, the information analysis procedure, including the use of intelligent analysis,
calls for implementing higher-level image formats on UAS [18, 19, 20]. Clearly, a contradiction arises
regarding the discrepancy between acceptable and necessary levels of image formats for unmanned
systems [21, 22, 23]. This increases the risk of losing access and reliability of the transmitted information.</p>
      <p>Localization of such conflicts can be achieved by appropriately reducing the information load created
by digitized images. Specific methods aimed at reducing redundancy are used for this purpose [ 21, 22, 23].
These methods are referred to as image compression technologies. Therefore, enhancing the image
format level for UAS based on compression methods is a relevant scientific and practical task.</p>
    </sec>
    <sec id="sec-2">
      <title>2. The main material presentation</title>
      <p>Currently, there are established standards for implementing image compression, with the majority
being based on reducing redundancy in the spectral space of individual fragments. These methods
are built by considering certain characteristics in the description of image fragments. Compression
processes are implemented by predicting the presence of: fragments with low visual sensitivity; and
fragments with a high level of correlation dependencies. In the spectral space, these characteristics of
fragments are manifested as follows: transformation of range intervals towards a limited number of
low-frequency components; presence of sequences of spectral components with insignificant deviation
of range interval—spectral sub-bands (; )  [24, 25, 26, 27, 28, 29, 30, 31].</p>
      <p>The existence of these characteristics forms the basis for constructing compression methods in the
spectral-parametric description of transformants (SPOT). This representation is formed by a set of
parameters {(; )  ; sign(; )  } for each spectral sub-band (SB) (; )  , which are determined by
the zig-zag direction through the two-dimensional transformant. Diferent approaches are used to
process the set of parameters (; )  ; sign(; )  [24, 25, 26, 27].</p>
      <p>Most of these approaches take into account local statistical dependencies either for individual
components (; )  and (; )  independently or try to consider the dependency between these
components in pairs (; )  . Thus, higher-order statistical dependencies are insuficiently tested
in redundancy reduction processes. Moreover, the dependencies between fragments in a group of
video frames are often not considered. This lack of consideration decreases the efectiveness of image
compression methods and reduces the opportunities to address the contradictions. Therefore, the
purpose of this article is to develop image compression methods based on their spectral-parametric
description, considering higher-order dependencies.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Development of a model for representing the transformant in spectral-parametric description</title>
      <p>As a result of performing discrete cosine transformation (DCT) on an image fragment, an array of
spectral components  (; ) (1) is formed. Here,  is the index of the spectral component array within
the general video stream group, and  represents the quantization parameter. Accordingly, to construct
its spectral-parametric description, a sub-band discretization process is implemented by constructing
vectors (; )  of two components (; )  = {(; )  ; (; )  }: (; )  is the length of the
spectral sub-bands; (; )  is the level of spectral sub-bands.</p>
      <p>The number (; )  of vectors (; )  depends on the number of spectral sub-bands within
the transformant. In turn, the number of spectral sub-bands depends on the complexity of the SPOT
structure. In the general case, the values of (; )  for each spectral component array within the
video stream group will be diferent, (; )  = . The value (; )  for the -th transformant also
depends on the level () of informativeness of the original video fragment and the quantization
strategy  (; )  for the spectral space. Hence, in the general case, we have the following functional
relationship:
(; )  =  (() ;  (; ) ).
(1)</p>
      <p>The informativeness () of video fragments is often considered in three levels. Each level is
determined by the concentration of fine details within the video fragment (VF). Accordingly, we have
VFs with low, medium, and high detail density. Through the conducted procedure, the initial array
 (; ) (1) is transformed into SPOT  (; ) . In this description, each of the columns forms a
vectorcomponent of the SPOT: the left column represents the component (; ) (1) of the lengths of the
spectral sub-bands (; ) = {(; ) 1; . . . ; (; ) (;)  }; the right column represents the component
(; ) (1) of the levels of the spectral sub-bands (; ) = {(; ) 1; . . . ; (; ) (;)  }.</p>
      <p>It is clear that, to account for the dependencies within the SPOT-transformants group, their
corresponding features must be considered. Therefore, it is necessary to ensure their homogeneity. This
will enable the compression procedure to be implemented with a higher level of redundancy reduction.
The solution approach involves clustering the SPOT-transformants within the video stream group by
the parameter (; ) . Thus, it is proposed to implement the features among SPOT-transformants
within the group during compression. To do this, homogeneous spaces are first formed. Clusters include
spectral element arrays with homogeneous SPOT parameters. The process of recombining the group of
transformants into homogeneous clusters is organized by the parameter (; )  – the power of the
spectral-parametric description of the transformant by the number of spectral sub-bands. Then, if we
denote a group of  spectral element arrays in the SPOT as P()  , P()  = { (; ); . . . ;  ( ; )} , a
sequence ()  is formed, ()  = {(; ) }=1. The power (; )  of SPOT, according to formula
(1), depends on the quantization mode level  and the informativeness () of the image fragment. Thus,
constructing homogeneous spaces from the transformants is proposed based on the power of their
SPOT.</p>
      <p>Constructing homogeneous spaces from transformants by the power of their SPOT allows us to
realize the inter-transformant features. Such clusters are denoted as Ω(; ) , where  is the cluster
marker. Each such cluster is characterized by a value of (; ) . The current transformant  (; ) in
SPOT is then added to the cluster Ω(; ) , that is,  (; ; ) :=  (; ) , if the condition is satisfied:
((; )  − (; )  ) = 0 ⇒ (; )  := |Ω(; )| + 1,  = 1, . . . ,  .</p>
      <p>Here:  (; ; ) is the  -th transformant in the cluster Ω(; ) , and (; ) is the number of
transformants in the  -th homogeneity space. The total number of clusters for a group of transformants in
SPOT equals Λ,  = 1, Λ.</p>
      <p>Clustering ensures that the number of spectral sub-band parameters is balanced for adequately
detecting dependencies in the sequence of transformants. Accordingly, dividing the transformant group
into homogeneous spaces enables implementing the procedure for accounting for dynamic dependencies
in the inter-transformant SPOT space. This approach allows identifying features among the components
of parameters (; )  and (; )  of SP slices: slice () (1) of spectral sub-band lengths, and slice
() (1) of spectral sub-band levels.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Creation of a method for binary block coding of structural components of spectral-parametric description</title>
      <p>Let’s consider the processing of transformants within a specific -th cluster. In the process of encoding
the set of transformants  (; ; ) belonging to cluster  , the following aspects need to be taken into
account:
• each transformant  (; ; ) is represented in a spectral-parametric description,</p>
      <p>(; ; ) = {(; ; ), (; ; )},
where (; ; ) and (; ; ) are structural components of the SPOT of the -th transformant
in the -th cluster;
• each transformant  (; ; ),  = 1, . . . , | (; )| in this cluster contains the same number;
• there are dependencies in the structural-parametric SP slices (; ) and (; ):
(; ) = {(
1; ), (
2; ), . . . , (</p>
      <p>; )},
(; ) = {sign(</p>
      <p>1; ), sign( 2; ), . . . , sign( ; )}.</p>
      <p>For the set of transformants within the  -th cluster, such dependencies are due to the homogeneity
of the properties for the corresponding spectral sub-bands. To account for this feature, it is proposed to
determine the upper and lower bounds of the defined intervals for the components of the respective SP
slices (; ) and (; ):
max((; )),</p>
      <p>max(sign(; )),
min((; )),</p>
      <p>min(sign(; )).</p>
      <p>Considering the constraints min((; )) , min((; )) in the direction of the slices, the
corresponding actual values of the components (; ) and (; ) of the SP slices will belong to smaller intervals
diap((; )) , diap((; )) of definiteness. In this case, their values will be truncated from below
(normalized). To describe the significance of reducing the magnitudes of diap((; )) , diap((; )) ,
it is proposed to use coeficients ((; )) and ((; )).</p>
      <p>Then, for SP slices within individual clusters, the conditions hold:</p>
      <p>diap((; )) &lt; ((; )) · max{(; )}, 0 &lt; ((; )) &lt; 1,
diap((; )) &lt; ((; )) · max{sign(; )}, 0 &lt; ((; )) &lt; 1.</p>
      <p>The smaller these parameters are, the shorter the interval of definiteness for the components of the
corresponding SP slices will be. The nature of changes in the values of parameters ((; )) and
((; )) from position  will difer depending on the type of structural-parametric components of
SPOT. Since the components of SPOT have diferent structural origins, we have the following:</p>
      <sec id="sec-4-1">
        <title>1. For components of the structural component (; ; ):</title>
        <p>((; )) ∼ .</p>
        <p>(1 − ((; ))) ∼ .</p>
        <p>At positions of vector (; ) corresponding to smaller values of  , the length of the definiteness
interval of the diferential normalized components (; ) will approach zero.
2. For components of the component (; ; ) of the SPOT transformant:</p>
        <p>At positions of vector (; ) corresponding to smaller values of  , the length of the definiteness
interval of the diferential-normalized components sign(; ) will be the largest.</p>
        <p>Hence, the amount of information ( (; ; )) in the transformant  (; ; ) , represented by the
components (; ; ) and (; ; ) of its spectral-parametric description, changes. The value of
( (; ; )) , depending on the nature of constraints  ((; ; ))  and  ((; ; ))  in the
SPOT components, is described generally as follows:
( (; ; )) = (; ; ) · log
, if diap((; )) ≥ min((; ))
 ((; ; ))
 =
⎨
⎩1,
⎧ diap((; ))
pow((; ))
, if diap((; )) ≥ min((; ))
Second approach: finding the amount of redundancy ((; ; ))
per LKM of SPOT when
additional constraints are considered on the range of values of components (; ; )
and (; ; )
. From
here, we can determine the amount of information ((; ; ))
that is on average contained in one
LKM (; )
for the transformant in the spectral-parametric description  (; ; )
. The following
expression is used for this purpose:
((; ; )) = (; ; ) · log
 ·  ((; ; ))
)</p>
        <p>Thus, depending on the type of constraints imposed on the components of the SPOT structural
components, two approaches can be used to determine redundancy.</p>
        <p>First approach: determining the amount of redundancy ((; ; ))
per LKM of SPOT for the case
where additional dependencies on SP slices are not considered. In this case, the value ((; ; ))
is
determined by the following expression:
((; ; )) = 100 ·
(; ; ) − log</p>
        <p>2(diap((; ; )) · diap((; ; )))
Given this, the value ((; ; )) is estimated by the formula:
((; ; )) = 100 ·
︂(
1
−
log2(diap((; ; )) · diap((; ; )))
︂)</p>
        <p>In these expressions, the value (; ; ) represents the number of bits on average contained in one
spectral sub-band (SSP) for the SPOT of the -th transformant of the -th cluster.
(; ; )</p>
        <p>(; ; )
((; ; )) =
(;)
∑︁
=1</p>
        <p>1
 (; )</p>
        <p>Thus, the need for forming homogeneous spaces for the group of transformants of the general video
stream is substantiated to allow for the accounting of inter-transformant dependencies in the SPOT
arrays of spectral elements. This makes it possible to align sub-groups of homogeneous transformants
according to the characteristics of their SPOT (number of spectral-SP).</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>1. A model for describing the transformant based on spectral-parametric representation parameters,
considering the formation of spectral-SP, has been developed.</p>
      <p>2. The necessity of forming homogeneous spaces for groups of transformants of the general video
stream has been substantiated to allow for the consideration of inter-transformant dependencies in
SPOT arrays of spectral elements. This enables alignment of homogeneous sub-groups of transformants
according to the characteristics of their SPOT (number of spectral-SP).</p>
      <p>3. A model for constructing homogeneous spaces (clusters) from a group of transformants based
on SPOT power by the number of spectral SP has been developed. This creates conditions for
implementing the compression procedure with additional removal of inter-transformant redundancy in
SPOT-transformants.</p>
      <p>4. Models have been created to estimate the amount of redundancy in the SPOT representation of
transformants in a cluster, determined by two types of dependencies: spectral-parametric dependencies
within the transformants of the cluster; inter-transformant dependencies in the structural-parametric
slices of the transformant sequence in the cluster. This allows estimating additional redundancy that
can potentially be reduced by considering inter-transformant constraints in the direction of SP slices.</p>
      <p>5. A comparative assessment of the characteristic of dynamic change in the bit volume of images
in the sequence showed that for peak signal-to-noise ratio levels of 27 dB – 37 dB, the developed
compression method provides an average gain of 17% and 11%.</p>
    </sec>
    <sec id="sec-6">
      <title>Declaration on Generative AI</title>
      <sec id="sec-6-1">
        <title>The authors have not employed any Generative AI tools.</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ni</surname>
          </string-name>
          ,
          <article-title>An enhanced approach for detecting double jpeg compression with the same quantization matrix</article-title>
          ,
          <source>Signal Processing: Image Communication</source>
          <volume>76</volume>
          (
          <year>2019</year>
          )
          <fpage>89</fpage>
          -
          <lpage>96</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>X.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <article-title>A fast and eficient multiple images encryption based on single-channel encryption and chaotic system</article-title>
          ,
          <source>Nonlinear Dynamics</source>
          <volume>108</volume>
          (
          <year>2022</year>
          )
          <fpage>613</fpage>
          -
          <lpage>636</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <article-title>Steganographic coding technology for hiding information in infocommunication systems of critical infrastructure</article-title>
          ,
          <source>in: 2022 IEEE 4th International Conference on Advanced Trends in Information Theory (ATIT)</source>
          , Kyiv, Ukraine,
          <year>2022</year>
          , pp.
          <fpage>88</fpage>
          -
          <lpage>91</lpage>
          . doi:
          <volume>10</volume>
          .1109/ATIT58178.
          <year>2022</year>
          .
          <volume>10024185</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , C. Qin,
          <article-title>Progressive histogram modification for jpeg reversible data hiding</article-title>
          ,
          <source>IEEE Transactions on Circuits and Systems for Video Technology</source>
          <volume>34</volume>
          (
          <year>2024</year>
          )
          <fpage>1241</fpage>
          -
          <lpage>1254</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. K.</given-names>
            <surname>Shaw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <article-title>Level by level image compression-encryption algorithm based on quantum chaos map</article-title>
          ,
          <source>Journal of King Saud University - Computer and Information Sciences</source>
          <volume>33</volume>
          (
          <year>2021</year>
          )
          <fpage>844</fpage>
          -
          <lpage>851</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Belikova</surname>
          </string-name>
          ,
          <article-title>Decoding method of information-psychological destructions in the phonetic space of information resources</article-title>
          ,
          <source>in: 2nd IEEE International Conference Advanced Trends in Information Theory (ATIT)</source>
          ,
          <year>Kyiv</year>
          ,
          <year>2020</year>
          , pp.
          <fpage>87</fpage>
          -
          <lpage>91</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <article-title>A novel triple-image encryption and hiding algorithm based on chaos, compressive sensing and 3d dct</article-title>
          ,
          <source>Information Sciences 574</source>
          (
          <year>2021</year>
          )
          <fpage>505</fpage>
          -
          <lpage>527</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Ruzhentsev</surname>
          </string-name>
          , et al.,
          <article-title>Radio-heat contrasts of UAVs and their weather variability at</article-title>
          12 GHz, 20 GHz, 34 GHz, and
          <article-title>94 GHz frequencies</article-title>
          ,
          <source>ECTI Transactions on Electrical Engineering, Electronics, and Communications</source>
          <volume>20</volume>
          (
          <year>2022</year>
          )
          <fpage>163</fpage>
          -
          <lpage>173</lpage>
          . doi:
          <volume>10</volume>
          .37936/ecti-eec.
          <volume>2022202</volume>
          .246878.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Anju</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shreelekshmi</surname>
          </string-name>
          ,
          <article-title>Secure content-based image retrieval using combined features in cloud</article-title>
          ,
          <source>in: Distributed Computing and Internet Technology</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>179</fpage>
          -
          <lpage>197</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>K.</given-names>
            <surname>Dergachov</surname>
          </string-name>
          , et al.,
          <article-title>GPS usage analysis for angular orientation practical tasks solving</article-title>
          ,
          <source>in: Proceedings of the IEEE 9th International Conference on Problems of Infocommunications Science and Technology (PICST)</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>187</fpage>
          -
          <lpage>192</lpage>
          . doi:
          <volume>10</volume>
          .1109/PICST57299.
          <year>2022</year>
          .
          <volume>10238629</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>O.</given-names>
            <surname>Kulitsa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Komolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhurbynskyy</surname>
          </string-name>
          ,
          <article-title>Selective method for hiding of video information resource in telecommunication systems based on encryption of energy-significant blocks of reference i-frame</article-title>
          ,
          <source>in: 1st International Conference on Advanced Information and Communication Technologies (AICT)</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>80</fpage>
          -
          <lpage>83</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lan</surname>
          </string-name>
          ,
          <article-title>Usability enhanced thumbnail-preserving encryption based on data hiding for jpeg images</article-title>
          ,
          <source>IEEE Signal Processing Letters</source>
          <volume>30</volume>
          (
          <year>2023</year>
          )
          <fpage>793</fpage>
          -
          <lpage>797</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shulgin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <article-title>Method of coding subbands of non-homogeneous spectrum of video segments in uneven diagonal space</article-title>
          ,
          <source>in: 2022 IEEE 4th International Conference on Advanced Trends in Information Theory (ATIT)</source>
          , Kyiv, Ukraine,
          <year>2022</year>
          , pp.
          <fpage>72</fpage>
          -
          <lpage>75</lpage>
          . doi:
          <volume>10</volume>
          .1109/ ATIT58178.
          <year>2022</year>
          .
          <volume>10024236</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Morales</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fierrez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Vera-Rodriguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tolosana</surname>
          </string-name>
          ,
          <article-title>Sensitivenets: Learning agnostic representations with application to face images</article-title>
          ,
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          <volume>43</volume>
          (
          <year>2021</year>
          )
          <fpage>2158</fpage>
          -
          <lpage>2164</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Bammey</surname>
          </string-name>
          , Jade owl:
          <article-title>Jpeg 2000 forensics by wavelet ofset consistency analysis</article-title>
          ,
          <source>in: 2023 8th International Conference on Image, Vision and Computing (ICIVC)</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>