<!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>December</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Model of Transformation of the Alphabet of the Encoded Data as a Tool to Provide the Necessary Level of Video Image Quality in Aeromonitoring Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Serhii Khmelevskiy</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivan Tupitsya</string-name>
          <email>ivan20081982@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maksim Parkhomenko</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yan Borovensky</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ivan Kozhedub Kharkiv National Air Force University</institution>
          ,
          <addr-line>Sumskaya Str. 77/79, Kharkiv, 61000</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <volume>0</volume>
      <fpage>1</fpage>
      <lpage>03</lpage>
      <abstract>
        <p>The drawbacks of the existing algorithms for coding data of video information resources in the aero monitoring system are analyzed. The main ones are: the complexity of the algorithmic implementation; loss of informative data that determine the semantic component (carry semantic load) of the information resource. To solve these problems, a model for transforming the alphabet of encoded data is being developed. The essence of the developed model is to determine and take into account the significance of the elements of the encoded data. The significance of message elements means taking into account the probabilistic distribution of elements in the message and the structural features of the color model to which the initial data is presented. Experimental studies are being carried out to confirm the adequacy of the developed model. The effectiveness of the developed model is assessed from the standpoint of ensuring the reduction of the power of the alphabet of the encoded data, provided that the high quality of video images is ensured. The directions of further research are determined, which involve the synthesis of the developed model with technologies for coding data information resources without losses. transformation, information resource data, redundancy, significance, coding, aeromonitoring ORCID: 0000-0001-6216-3006 (S. Khmelevskiy); 0000-0001-6806-4914 (I. Tupitsya); 0000-0001-6062-7743 (M. Parkhomenko); 0000-</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In the system of information support of departmental bodies, a rather important role is assigned to
the use of the aero segment [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]. This is due to the fact that obtaining information in real time allows
for both timely detection and prompt response to crisis situations by organizing coordinated
interaction of the relevant departmental bodies.
      </p>
      <p>
        Accordingly, the requirements for the video information resource are increasing. The main ones
among them [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7 ref8">4-8</xref>
        ] are: a compact representation of the encoded data, a high level of quality of
reconstructed images in conditions of limited bandwidth of data transmission channels. For this
purpose, image coding algorithms based on conceptual approaches, which are implemented on the
basis of the JPEG platform [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14 ref15 ref16 ref17 ref9">9-17</xref>
        ], are quite actively used. However, it should be noted that
algorithms of the JPEG family have a number of significant drawbacks [
        <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15 ref16 ref17 ref18 ref19 ref20 ref21 ref22 ref23 ref24 ref25 ref26 ref27">12-27</xref>
        ]. The
main
disadvantages include the following: the complexity of the algorithmic implementation; loss of
informative data (key information) that determine the semantic component (carry semantic load) of
the information resource. Therefore, the question of finding new approaches to the compact
representation of encoded data in terms of ensuring a high level of quality becomes relevant.
      </p>
      <p>
        The analysis of the latest scientific research indicates that the existing compression technologies
are built on the principle of multilevel processing (they assume the implementation of step-by-step
data processing) [
        <xref ref-type="bibr" rid="ref28 ref29 ref30 ref31 ref32 ref33 ref34">28-34</xref>
        ]. This means that the original alphabet is used only at the initial stage of video
      </p>
      <p>2022 Copyright for this paper by its authors.
data processing. All subsequent stages (preparation for encoding and encoding, respectively) are
associated with the processing of intermediate data. And accordingly, an increase in the number of
processing stages implies an increase in the complexity of the algorithmic implementation (which
increases the time for data processing) and a decrease in the quality of the restored images.</p>
      <p>Therefore, it is proposed to use an approach to ensure the required level of video image quality
under conditions of limited bandwidth of data transmission channels, the essence of which is to
transform the original alphabet of the encoded data in the direction of reducing psycho-visual
redundancy by determining the significance of the encoded data elements.</p>
      <p>Thus, the purpose of the article is to develop a model for transforming the alphabet of encoded
data to ensure the required level of video image quality in conditions of limited bandwidth of data
transmission channels in aero monitoring systems.
2. Development of a transformation model for the alphabet of encoded data
to ensure the required level of video image quality in aeromonitoring
systems</p>
      <p>It is proposed to develop a model for transforming the alphabet of the encoded data, which will
take into account the significance of the encoded elements according to some quantitative criterion
the sign of the element's significance. So for the message, which is given by the following expression:
where xi - i - th message element X(n) , i  1, n , message alphabet X(n) will look like this:
X(n)  {x1; ...;xi ; ...;x n } , i  1, n ,</p>
      <p>X(m)  {x1; ...;xi ; ...;x m} , i  1, m ,
RGB color space with the size 3 , i.e.:</p>
      <p>VRGB  3 ,
where VRGB - the volume of the cube in the RGB color model;
 - the length of the side of the cube, in pixels.</p>
      <p>To assess the significance of elements xi messages X(n) it is proposed to use a quantitative
feature, which is given by the following expression:
where m - the number of elements in the alphabet X(m) messages X(n) , i  1, m .</p>
      <p>Taking into account the fact that at the initial stage the encoded data is represented using the RGB
model, that is, they are elements of an RGB cube, the elements of the encoded data can be represented
as follows:</p>
      <p>xi  xi (xiR , xiG , xiB ) ,
where xiR - the component red of the element xi ; xiG - the component green element xi ; xiB
the component blue of the element xi .</p>
      <p>It is proposed to transform the alphabet of the encoded data in several stages (Fig. 1). At the first
stage, the elements are determined xi messages X(n) , which do not have a significant impact on the
semantic component of the message, that is, psycho-visual redundancy is eliminated. At this stage, the
probability distribution law is determined P(x i ) appearance of elements xi in the message X(n) .</p>
      <p>1. At the next stage, the significance of the elements is determined xi messages X(n)
quantitatively. To this end, the element xi messages X(n) represented as the center of a cube in the
where S(xi ) - the coefficient of significance of the element xi messages X(n) ;
P(x i ) - the probability of the item appearing xi in the message X(n) ;
xi - message element X(n) , which is the center of the generated cube in the RGB color model;
xij - elements of the formed color cube in the RGB model, xij  xij (xijR , xijG , xijB) , j  1,  ,
  3( 1) ;
D(xi , xij ) - distance between element xi (the center of the formed cube) and elements xij the
generated RGB cube.</p>
      <p>Information resource data presented
using the RGB color model</p>
      <p>X(n)  {x1;...; xi; ...; xn}
xi  xi (xiR , xiG , xiB), i  1, n
X(m)  {x1;...; xi;...; xm}, i  1, m</p>
      <p>Transformation of the message
and the alphabet of the encoded</p>
      <p>data
X(n) ftransf  X(n)</p>
      <p>X(n)  {x1;...;xi;...;xn}
xi  ftransf (| Xtransf () |,S(xi)lim)
xi  xi, S(xi)  S(xi)lim;
xij, S(xi)  S(xi)lim, S(xij)  S(xi)lim.</p>
      <p>xi
S(xi )</p>
      <p>Formation of a model for determining significance for message X(n)</p>
      <p>elements xi
Determination of the law of</p>
      <p>probability distribution
elements in the message</p>
      <p>P(xi )</p>
      <p>Defining an RGB cube</p>
      <p>model
VRGB  3</p>
      <p>Determination of
the optimal
exponent</p>
      <p>
S(xi)   P(xi)
 P(xi)
j1 D(xi, xij)</p>
      <p>D(xi , xij )  (xiR  xijR )2  (xiG  xijG )2  (xiB  xijB )2 .</p>
      <p>2. The third stage is the ranking of the data array (coefficients of significance S(xi ) elements xi
messages X(n) ) from maximum to minimum value.</p>
      <p>3. At the fourth stage, the significance threshold is determined S(xi )lim elements xi messages
X(n) (image pixels). This indicator is determined by the power of the alphabet of the reconstructed
message. Thus, taking into account the transformation of the alphabet X(m) initial data using the
proposed approach message X(n) will take the following form:</p>
      <p>X(n) f transf  X(n) , X(n)  {x1; ...;xi ; ...;xn } ,
where f transf (| X transf () |,S(xi )lim ) - function of forming a transformed message taking into
account the threshold value of the significance coefficient S(xi )lim elements and power of the
alphabet of the transformed message;
xi - i - th element transformed message X(n) , i  1, n ;</p>
      <p>X transf () - transformed message alphabet X(n) , which is formed taking into account the
significance indicator;
| X transf () | - the power of the alphabet of the transformed message X(n) .
(6)
(7)
messages X(n) to form a transformed message X(n) . Given this information, based on the function
f transf (| X transf () |,S(xi )lim ) items are ranked xi transformed message X(n) at a given level
power | X transf () | alphabet X transf () transformed message X(n) . This is given by the following
expression:</p>
      <p>xi  f transf (| X transf () |,S(xi )lim ) .</p>
      <p>It should be noted that it is from the power | X transf () | alphabet X transf () transformed
messages X(n) the degree of compression and, accordingly, the degree of distortion of the image
elements depends. Thus, at the final stage, the formation of the alphabet takes place X transf ( )
transformed messages X(n) , the essence of which is to replace the elements xi original message
X(n) for which the significance coefficient S(xi ) matters less than the threshold S(xi )lim , that is:
elements of the alphabet Xtransf (m) for which the following condition is satisfied:</p>
      <p>Thus, the process of forming a transformed message X(n) is given by the following expression
system:</p>
      <p>xi , S(xi )  S(xi )lim ;
xi  </p>
      <p>xij , S(xi )  S(xi )lim , S(xij )  S(xi )lim .</p>
      <p>In turn, the purpose of transforming the alphabet X(m) the encoded data is power reduction
| X(m) | subject to the provision of high quality video images (in terms of using compression
algorithms for coding data), i.e. the following condition must be met:</p>
      <p>| X transf () || X(m) | .
3. Evaluation of the effectiveness of the developed model of transformation
of the alphabet of encoded data from the standpoint of ensuring the
required level of video image quality in aeromonitoring systems
Analysis of transformations of the nature of the probability distribution law for the appearance of
message elements as a result of clustering based on the number of series of units.</p>
      <p>In order to determine the optimal values of quantitative indicators (RGB cube model - length 
sides of a cube, exponent  ), which are used in the developed model of transformation of the alphabet
X(m) coded data, it is proposed to conduct a number of experimental studies. To determine the
effectiveness of the developed model for transforming the encoded data, a number of experiments
were carried out. Highly saturated images were used as initial data; an example of one of them is
shown in Fig. 2. The results of experimental studies to determine the optimal values of quantitative
indicators that are used in the developed model of the transformation of the alphabet X(m) of the
encoded data are shown in Figs. 3 - 4. Analysis of the results of experimental studies to determine the
optimal values of quantitative indicators that are used in the developed model of transformation of the
alphabet X(m) coded, which are presented in Fig. 3-4, indicate that:</p>
      <p>1. The optimal value for the quantitative indicator of the RGB cube model is length  side of the
cube is as follows (Fig. 3):
  9 .</p>
      <p>S(xi )  S(xi )lim ,
S(xi )  S(xi )lim .
(8)
(9)
(10)
(11)</p>
      <p>This is due to the fact that for a given value of the length  side of the cube, the minimum
standard deviation is provided, which has the following value (Fig. 3):</p>
      <p>CKO  CKO min  0,7% .</p>
      <p>It should be noted that this RGB cube model (with   9 ) is selected taking into account the
assessment of the complexity of the algorithmic implementation of the developed model for
transforming the encoded data (Fig. 4).</p>
      <p>2. Analysis of the dependence of the standard deviation on the length  sides of a cube for different
values of the exponent  (Fig. 4) indicates that for the developed model of transformation of the
alphabet of encoded data with the optimal value of the indicator  is the following:</p>
      <p>Taking into account the results of the experimental studies (data from expressions (11) - (12)),
expression (5) takes the following form:</p>
      <p>At   3,5 the standard deviation is provided, which has the following value (Fig. 4):
  3,5 .</p>
      <p>CKO  0,7 % .</p>
      <p>S(xi ) 
.</p>
      <p>| X(m) |
| Xtransf () |
 9,55.</p>
      <p>Further, it is proposed to evaluate the effectiveness of the developed model from the standpoint of
ensuring power reduction | X(m) | alphabet X(m) of the encoded data, provided that the high quality
of video images is ensured, that is, the condition specified by expression (10) is met. So for the tested
image, which was used in the course of experimental studies, the result of applying the developed
model for transforming the alphabet of the encoded data is a decrease in the power of the alphabet by
approximately 10 times (Fig. 5):</p>
      <p>Thus, we can conclude that the proposed model for transforming the alphabet of the encoded data
allows to ensure not only the high quality of reconstructed images, but also to create more favorable
conditions for the further use of lossless compression coding technologies in order to compactly
represent the data of the information resource. Therefore, the goal of further research is to synthesize
the developed model for transforming the alphabet with technologies for compact representation of
(12)
(13)
encoded data without loss to increase the efficiency of delivery of data information resources while
ensuring the required level of quality.</p>
      <p>0
 5
7
3,8</p>
      <p>10
6,6
3,4
6,2
3
15
5,8
2,6
20
5,4
2,2
5
1,8
25
4,6
1,4</p>
      <p>Thus, the developed model makes it possible to ensure a sufficiently high quality of encoded data (
CKO  0,7 % ) by transforming the alphabet of the message. The essence of which is to additionally
eliminate the psycho-visual redundancy of the information resource data by determining the
significance of the elements in the message. The significance of the elements of the message is
understood as taking into account both the law of the probabilistic distribution of elements in the
message and the structural features of the color model to which the initial data are presented. This
makes it possible to reduce the power of the alphabet of the encoded data by almost 10 times, which,
in turn, makes it possible to create more favorable conditions for increasing the efficiency of video
data encoding from the standpoint of ensuring the required level of quality in conditions of limited
bandwidth of the data transmission channel.</p>
      <p>3500|0X(m) |
30000
25000
20000
15000
10000
5000
0
29317</p>
      <p>3070
RGB</p>
      <p>PM</p>
    </sec>
    <sec id="sec-2">
      <title>4. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            , J., Ma,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          (
          <year>2017</year>
          ),
          <article-title>Utility Driven Adaptive Preprocessing for Screen Content Video Compression</article-title>
          .
          <source>IEEE Transactions on Multimedia</source>
          , Vol.
          <volume>19</volume>
          , No.
          <issue>3</issue>
          , pp.
          <fpage>660</fpage>
          -
          <lpage>667</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Gonzales</surname>
            ,
            <given-names>R.C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Woods</surname>
            ,
            <given-names>R.E.</given-names>
          </string-name>
          (
          <year>2002</year>
          ),
          <article-title>Digital image processing</article-title>
          .
          <source>Prentice Inc. Upper Saddle River</source>
          ,
          <volume>779</volume>
          p.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2016</year>
          ),
          <article-title>JPEG Compression Forensics against Resizing</article-title>
          .
          <source>Computer Science</source>
          , pp.
          <fpage>1001</fpage>
          -
          <lpage>1007</lpage>
          . DOI:
          <volume>10</volume>
          .1109/TrustCom.
          <year>2016</year>
          .
          <volume>0168</volume>
          . available at: https://www.semanticscholar.org/paper/JPEG-Compression-
          <article-title>Forensics-against-Resizing-DongWang/620691ba5ac31d7d26f7167390ce86cb83f7a086 (accessed (accessed 05 June 2021</article-title>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Richter</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2017</year>
          ),
          <article-title>Error Bounds for HDR Image Coding with JPEG XT</article-title>
          .
          <source>Data Compression Conference (DCC)</source>
          , pp.
          <fpage>122</fpage>
          -
          <lpage>130</lpage>
          . DOI:
          <volume>10</volume>
          .1109/DCC.
          <year>2017</year>
          .
          <volume>7</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wan</surname>
            ,
            <given-names>N.A.</given-names>
          </string-name>
          , Hong and Chen,
          <string-name>
            <surname>X.</surname>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>A Fast JPEG Image Compression Algorithm Based on DCT</article-title>
          .
          <source>IEEE International Conference on Smart Cloud (SmartCloud)</source>
          , pp.
          <fpage>106</fpage>
          -
          <lpage>110</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ SmartCloud49737.
          <year>2020</year>
          .
          <volume>00028</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Rippel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>Learned Video Compression</article-title>
          . IEEE/CVF International Conference on Computer Vision (ICCV), pp.
          <fpage>3453</fpage>
          -
          <lpage>3462</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ICCV.
          <year>2019</year>
          .
          <volume>00355</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Bienik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uhrina</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuba</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Vaculik</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2016</year>
          ), Performance of H.264, H.
          <volume>265</volume>
          ,
          <article-title>VP8 and VP9 Compression Standards for High Resolutions</article-title>
          .
          <source>19th International Conference on NetworkBased Information Systems (NBiS)</source>
          , pp.
          <fpage>246</fpage>
          -
          <lpage>252</lpage>
          . DOI:
          <volume>10</volume>
          .1109/NBiS.
          <year>2016</year>
          .
          <volume>70</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          (
          <year>2017</year>
          ),
          <article-title>Cruise UAV Video Compression Based on Long-Term Wide-Range Background</article-title>
          .
          <source>Data Compression Conference (DCC)</source>
          , pp.
          <fpage>466</fpage>
          -
          <lpage>467</lpage>
          . DOI:
          <volume>10</volume>
          .1109/DCC.
          <year>2017</year>
          .
          <volume>71</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Minallah</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gul</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Bokhari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2015</year>
          ),
          <article-title>Performance Analysis of H.265/HEVC (HighEfficiency Video Coding) with Reference to Other Codecs</article-title>
          .
          <source>13th International Conference on Frontiers of Information Technology (FIT)</source>
          , pp.
          <fpage>216</fpage>
          -
          <lpage>221</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ FIT.
          <year>2015</year>
          .
          <volume>46</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Djelouah</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Campos</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Schaub-Meyer, S. and
          <string-name>
            <surname>Schroers</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>Neural Inter-Frame Compression for Video Coding</article-title>
          . IEEE/CVF International Conference on Computer Vision (ICCV), pp.
          <fpage>6420</fpage>
          -
          <lpage>6428</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ICCV.
          <year>2019</year>
          .
          <volume>00652</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Narmatha</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manimegalai</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Manimurugan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2017</year>
          ),
          <article-title>A LS-compression scheme for grayscale images using pixel based technique</article-title>
          .
          <source>International Conference on Innovations in Green Energy and Healthcare Technologies (IGEHT)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          , DOI: 10.1109/ IGEHT.
          <year>2017</year>
          .
          <volume>8093980</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Poolakkachalil</surname>
            ,
            <given-names>T.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chandran</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muralidharan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Vijayalakshmi</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          (
          <year>2016</year>
          ),
          <article-title>Comparative analysis of lossless compression techniques in efficient DCT-based image compression system based on Laplacian Transparent Composite Model and An Innovative Lossless Compression Method for Discrete-Color Images</article-title>
          .
          <source>3rd MEC International Conference on Big Data and Smart City (ICBDSC)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          , DOI: 10.1109/ICBDSC.
          <year>2016</year>
          .
          <volume>7460360</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liao</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>Joint Learned and Traditional Video Compression for P Frame</article-title>
          .
          <source>IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)</source>
          , pp.
          <fpage>560</fpage>
          -
          <lpage>564</lpage>
          . DOI:
          <volume>10</volume>
          .1109/CVPRW50498.
          <year>2020</year>
          .
          <volume>00075</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Bui</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hsu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2016</year>
          ),
          <article-title>Comparison of lossless video and image compression codecs for medical computed tomography datasets</article-title>
          .
          <source>IEEE International Conference on Big Data (Big Data)</source>
          , pp.
          <fpage>3960</fpage>
          -
          <lpage>3962</lpage>
          . DOI:
          <volume>10</volume>
          .1109/BigData.
          <year>2016</year>
          .
          <volume>7841075</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Akbari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>J</given-names>
            ., Han, J
          </string-name>
          . and
          <string-name>
            <surname>Tu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>Learned Variable-Rate Image Compression With Residual Divisive Normalization</article-title>
          .
          <source>IEEE International Conference on Multimedia and Expo (ICME)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ICME46284.
          <year>2020</year>
          .
          <volume>9102877</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Shinde</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>Efficient Image Set Compression</article-title>
          .
          <source>IEEE International Conference on Image Processing (ICIP)</source>
          , pp.
          <fpage>3016</fpage>
          -
          <lpage>3017</lpage>
          , DOI: 10.1109/ICIP.
          <year>2019</year>
          .
          <volume>8803230</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <article-title>and</article-title>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>M-LVC: Multiple Frames Prediction for Learned Video Compression</article-title>
          .
          <source>IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          , pp.
          <fpage>3543</fpage>
          -
          <lpage>3551</lpage>
          . DOI:
          <volume>10</volume>
          .1109/CVPR42600.
          <year>2020</year>
          .
          <volume>00360</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Artuğer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Özkaynak</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2018</year>
          ),
          <article-title>Fractal Image Compression Method for Lossy Data Compression</article-title>
          .
          <source>International Conference on Artificial Intelligence and Data Processing (IDAP)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . DOI:
          <volume>10</volume>
          .1109/IDAP.
          <year>2018</year>
          .
          <volume>8620735</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Arnob</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tanvir</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prajoy</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rafi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muktadir</surname>
            <given-names>Rahman</given-names>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          and
          <string-name>
            <given-names>Mamdudul</given-names>
            <surname>Haque</surname>
          </string-name>
          ,
          <string-name>
            <surname>Kh.</surname>
          </string-name>
          (
          <year>2015</year>
          ),
          <article-title>Iris image compression using wavelets transform coding</article-title>
          .
          <source>2nd International Conference on Signal Processing and Integrated Networks (SPIN)</source>
          , pp.
          <fpage>544</fpage>
          -
          <lpage>548</lpage>
          , DOI: 10.1109/SPIN.
          <year>2015</year>
          .
          <volume>7095407</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , Jin and
          <string-name>
            <given-names>Na</given-names>
            <surname>Ai</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          (
          <year>2016</year>
          ),
          <article-title>Morphological component decomposition combined with compressed sensing for image compression</article-title>
          .
          <source>IEEE International Conference on Information and Automation (ICIA)</source>
          ,
          <source>DOI: 10</source>
          .1109/ICInfA.
          <year>2016</year>
          .
          <volume>7832096</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>He</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2017</year>
          ),
          <article-title>Encode when necessary: Correlated network coding under unreliable wireless links</article-title>
          .
          <source>ACM Transactions on Sensor Networks</source>
          , Vol.
          <volume>13</volume>
          (
          <issue>1</issue>
          ). DOI:
          <volume>10</volume>
          .1145/ 3023953.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Phatak</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2016</year>
          ),
          <article-title>A Non-format Compliant Scalable RSA-based JPEG Encryption Algorithm</article-title>
          .
          <source>International Journal of Image. Graphics and Signal Processing</source>
          , Vol.
          <volume>8</volume>
          , No.
          <issue>6</issue>
          , pp.
          <fpage>64</fpage>
          -
          <lpage>71</lpage>
          . DOI:
          <volume>10</volume>
          .5815/ijigsp.
          <year>2016</year>
          .
          <volume>06</volume>
          .08.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tupytsya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parkhomenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Azatov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pershin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurzhii</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shaikhanova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Karpiinski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>The concept of a quantitative sign formation for the internal restructuring of information resource data</article-title>
          .
          <source>Przetwarzanie, transmisja i bezpieczeństwo informacji'</source>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>52</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeng</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2016</year>
          ),
          <article-title>Lossless Compression of JPEG Coded Photo Collections</article-title>
          .
          <source>IEEE Transactions on Image Processing</source>
          , Vol.
          <volume>25</volume>
          , No.
          <issue>6</issue>
          , pp.
          <fpage>2684</fpage>
          -
          <lpage>2696</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ TIP.
          <year>2016</year>
          .
          <volume>2551366</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Zhuo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2017</year>
          ),
          <article-title>A research on anti-jamming method based on compressive sensing for OFDM analogous system</article-title>
          .
          <source>IEEE 17th International Conference on Communication Technology (ICCT)</source>
          , pp.
          <fpage>655</fpage>
          -
          <lpage>659</lpage>
          , DOI: 10.1109/ICCT.
          <year>2017</year>
          .
          <volume>8359718</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          and
          <string-name>
            <surname>He</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2015</year>
          ),
          <article-title>Encode when necessary: Correlated network coding under unreliable wireless links</article-title>
          .
          <source>ACM Transactions on Sensor Networks</source>
          , Vol.
          <volume>13</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>29</lpage>
          , DOI: 10.1145/ 3023953.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <article-title>and</article-title>
          <string-name>
            <surname>Dally</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          (
          <year>2015</year>
          ),
          <article-title>Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding</article-title>
          , available at: https://webcache.googleusercontent.com/search?q=cache:DSoAo2aheUoJ:https://arxiv.org/pdf/1 510.00149+
          <article-title>&amp;cd=2&amp;hl=uk&amp;ct=clnk&amp;gl=ua (accessed 05 June 2021</article-title>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Zhurakovskyi</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boiko</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Druzhynin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeniv</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Eromenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>Increasing the efficiency of information transmission in communication channels</article-title>
          .
          <source>Indonesian Journal of Electrical Engineering and Computer Science</source>
          , Vol.
          <volume>19</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>1306</fpage>
          -
          <lpage>1315</lpage>
          . DOI:
          <volume>10</volume>
          .11591/ijeecs.v19.
          <year>i3</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tupitsya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dodukh</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Parkhomenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>The Method of Clustering Information Resource Data on the Sign of the Number of Series of Units as a Tool to improve the Statistical Coding Efficiency</article-title>
          .
          <source>IEEE 15th International Conference on the Experience of Designing and Application of CAD Systems (CADSM)</source>
          , pp.
          <fpage>32</fpage>
          -
          <lpage>35</lpage>
          . DOI:
          <volume>10</volume>
          .1109/CADSM.
          <year>2019</year>
          .
          <volume>8779243</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tupitsya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurzhii</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sidchenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kulitsa</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>TwoHierarchical Scheme of Statistical Coding of Information Resource Data with Quantitative Clustering</article-title>
          .
          <source>IEEE International Conference on Advanced Trends in Information Theory (ATIT)</source>
          , pp.
          <fpage>89</fpage>
          -
          <lpage>92</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ATIT49449.
          <year>2019</year>
          .
          <volume>9030451</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tupitsya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shulgin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Musienko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kochan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Veselska</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>The Application of the Internal Restructuring Method of the Information Resource Data According to the Sign of the Number of Series of Units to Improve the Statistical Coding Efficiency</article-title>
          .
          <source>10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)</source>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>69</lpage>
          . DOI:
          <volume>10</volume>
          .1109/IDAACS.
          <year>2019</year>
          .
          <volume>8924460</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tupitsya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kovalenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sidchenko</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yroshenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Stepanko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>The analysis of the internal restructuring method efficiency used for a more compact representation of the encoded data</article-title>
          .
          <source>Advanced Trends in Information Theory (ATIT</source>
          '
          <year>2020</year>
          )
          <article-title>: proceedings of the Intern</article-title>
          . Conf., pp.
          <fpage>48</fpage>
          -
          <lpage>51</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ATIT50783.
          <year>2020</year>
          .
          <volume>9349307</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Yudin</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Artemov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krasnorutsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barannik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Tupitsya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pris</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          (
          <year>2021</year>
          ),
          <article-title>Creating a mathematical model for estimating the impact of errors in the process of reconstruction of non-uniform code structures on the quality of recoverable video images</article-title>
          .
          <source>Advanced Trends in Information Theory (ATIT</source>
          '
          <year>2021</year>
          )
          <article-title>: proceedings of the Intern</article-title>
          . Conf., pp.
          <fpage>38</fpage>
          -
          <lpage>41</lpage>
          . DOI:
          <volume>10</volume>
          .1109/ATIT54053.
          <year>2021</year>
          .
          <volume>9678887</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Khmelevskiy</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tupitsya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mahdi</surname>
            ,
            <given-names>Q. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Musienko</surname>
            <given-names>О.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parkhomenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Borovensky</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Development of the external restructuring method to increase the efficiency of information resource data encoding</article-title>
          .
          <source>Information Processing Systems</source>
          ,
          <volume>3</volume>
          (
          <issue>166</issue>
          ), pp.
          <fpage>52</fpage>
          -
          <lpage>61</lpage>
          . DOI:
          <volume>10</volume>
          .30748/soi.
          <year>2021</year>
          .
          <volume>166</volume>
          .06.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>