<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>DPCM with an adaptive extrapolator for image compression</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>M.V. Gashnikov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Samara National Research University</institution>
          ,
          <addr-line>34 Moskovskoe Shosse, 443086, Samara</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>72</fpage>
      <lpage>77</lpage>
      <abstract>
        <p>The method of image compression based on differential pulse-code modulation (DPCM) with an adaptive extrapolator is investigated. This extrapolator automatically adapts to local features of contours (boundaries) in the image. The issue of the negative effect of quantization on the result of optimizing the adaptive extrapolator is investigated. It is experimentally proved that, despite this effect, the adaptive extrapolator has the advantage over prototypes. Also, an experimental research of the considered method is carried out as a whole; a comparison is made with the JPEG method with respect to the maximum error in a half-tone Waterloo set of natural images.</p>
      </abstract>
      <kwd-group>
        <kwd>image compression</kwd>
        <kwd>DPCM</kwd>
        <kwd>extrapolation</kwd>
        <kwd>quantization</kwd>
        <kwd>entropy coding</kwd>
        <kwd>compression ratio</kwd>
        <kwd>maximum error</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Then, an extrapolated value xˆ m, n is subtracted from the original pixel value x m, n  to calculate the difference signal
f m, n . Then, the difference signal f m, n is quantized Q  f  , the result of this quantization is a quantized difference
signal f m, n . This signal is encoded and transmitted through a communication channel or sent to an archive file. The
quantized signal f m, n is immediately used to calculate the corresponding recovered pixel value x m, n  :
f m, n  x m, n  xˆ m, n ,</p>
      <p>f m, n   Q  f m, n  , x m, n   f m, n   xˆ m, n .</p>
      <p>
        The restored pixel value x m, n  is used to extrapolate (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) the next pixel.
      </p>
    </sec>
    <sec id="sec-2">
      <title>3. Extrapolation for image compression based on DPCM</title>
      <p>
        The requirement of low computational complexity makes it necessary to apply in DIKM only the simplest [16] extrapolators
of the form:
xˆ(0) m, n  x m 1, n  ,
xˆ(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) m, n  1  x m  1, n  x m, n  1
2
      </p>
      <p>
        ,
xˆ(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) m, n  x m, n  1.
где
      </p>
      <p> xˆ(0) m, n  , if m (m, n)  n (m, n);
xˆG m, n   </p>
      <p>
         xˆ(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) m, n  , if m (m, n)  n (m, n),
      </p>
      <p>
        These linear extrapolators work worst on contours (object boundaries). As an answer to this problem, extrapolators that are
invariant to contours are considered, for example Greham's extrapolator [3], which is invariant to vertical and horizontal
contours:
xˆ m, n  P x i, j  : i  m or i  m and j  n  .
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
(
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
m m, n  x m, n 1  x m 1, n 1 ,
      </p>
      <p>n m, n   x m  1, n  x m  1, n  1 .</p>
      <p>
        The smaller difference from the differences (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) gives the direction of the contour in a small neighborhood of the current
image pixel. The relation (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) provides extrapolation "along" this direction. Such an extrapolator is more accurate on the
contours, but on flat sections it loses to the extrapolator (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ), which is more stable to noise due to averaging.
      </p>
      <p>
        The advantages of the "contour" extrapolator (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) and the "averaging" extrapolator (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) are combined by an adaptive
extrapolator:
 xˆ(0) m, n  , if (m, n)  () ;


xˆ A m, n    xˆ(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) m, n , if ()  (m, n)  () ;

 xˆ(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) m, n  , if ()  (m, n),
where  m, n is a «contour direction feature»:
 m, n  m m, n  n m, n ,
 xmax  ()  0  ()  xmax ,
() , () are parameters of the adaptive extrapolator, which are selected in the ranges:
where xmax is the maximum brightness in the image. If the feature (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) is close to zero (the current pixel is in a flat image
area), then the averaging extrapolator (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) is used, but if the feature (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) has a large value (positive or negative), then
      </p>
      <p>
        Image Processing, Geoinformation Technology and Information Security / M.V. Gashnikov
extrapolation (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) "along the contour" occurs. The extrapolator (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) adapts to each particular image: if the contours in the image
are small, then the parameters () , () are set far from zero, but if there are many vertical and/or horizontal contours, the
corresponding parameter must have a large absolute value.
      </p>
      <p>The parameters () , () are automatically calculated before the actual DPCM processing for each particular image.
A special optimization procedure for the adaptive extrapolator is used for this (see below). Then the parameters () , () are
placed in the archive, because they are also necessary for decompression.</p>
    </sec>
    <sec id="sec-3">
      <title>4. Optimization of the adaptive extrapolator for image compression based on DPCM</title>
      <p>Optimization of the adaptive extrapolator (search of parameters () , () ) is based on minimizing the sum of the absolute
values of extrapolation errors over the set   {m, n } of coordinates of all image pixels:</p>
      <p>
        The error (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ) can be divided into three component parts corresponding to different ranges of the "contour direction
feature" (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ):
 () , ()  
      </p>
      <p> x  m, n   xˆ m, n  
m,n
min .</p>
      <p>() ,()
 () , ()   () ()   (0)  () () </p>
      <p>.
2rel 
2
Dx

1 2</p>
      <p>  x m, n   x m, n  ,</p>
      <p>MNDx m,n
where
() ()  </p>
      <p>
m,n()
x m, n   xˆ m, n  , (0) </p>
      <p>
m,n(0)
x m, n   xˆ m, n  , () ()  </p>
      <p>
m,n()
x m, n   xˆ  m, n  ,
  ( )
(0)</p>
      <p>( ) , ()  m, n  :  m, n   0, (0)  m, n  :  m, n   0, ()  m, n  :   m, n   0.</p>
      <p>
        As a result, the two-parameter optimization problem (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ) is decomposed into two one-parameter problems that are solved
independently of each other:
()  arg min ()   ,

()  arg min ()  .
      </p>
      <p>
To solve these problems, a special matrix is filled in the preliminary pass through the image
i, </p>
      <p>
m,n</p>
      <p>x  m, n   xˆ i  m, n  , 0  i  2 ,  xmax    xmax .</p>
      <p>
        Each element i,  of this matrix contains the sum of extrapolation errors of extrapolator number i (
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3-5</xref>
        ) for all pixels for
which the value of feature (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) is equal  . For the filled matrix (
        <xref ref-type="bibr" rid="ref14">14</xref>
        ), a one-dimensional array of extrapolation error values ()
is filled using a recurrence procedure:
      </p>
      <p>xmax
()  xmax    1,xmax , ()   ()   1  2,  1, , 0    xmax .</p>
      <p>0</p>
      <p>The computational complexity of this procedure does not depend on the image size. Optimal value ( ) can be found in this
array ( ) (( ) ) by an exhaustive search (the length of this array is only xmax+1). Analogously () is calculated.</p>
    </sec>
    <sec id="sec-4">
      <title>5. Quantization for image compression based on DPCM</title>
      <p>
        For quantization in DPCM, the Max scale [5-6] is usually used, which provides the minimum relative root-mean-square error
where x m, n  is the original image, x  m, n  is the restored (decompressed) image, Dx is the image variance, MхN are
image sizes.
(
        <xref ref-type="bibr" rid="ref11">11</xref>
        )
(
        <xref ref-type="bibr" rid="ref12">12</xref>
        )
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
(
        <xref ref-type="bibr" rid="ref14">14</xref>
        )
(
        <xref ref-type="bibr" rid="ref15">15</xref>
        )
(
        <xref ref-type="bibr" rid="ref16">16</xref>
        )
      </p>
      <p>Image Processing, Geoinformation Technology and Information Security / M.V. Gashnikov</p>
      <p>For unique data, more strong error control [17] is necessary. For example, it is necessary for compression of hyperspectral
images [18-20]. In this case, a quantizer with a uniform scale [3] can be used for DPCM. This quantizer provides maximum
error control:</p>
    </sec>
    <sec id="sec-5">
      <title>6. The effect of quantization on the adaptive extrapolator optimization</title>
      <p>It should be noted an important nuance that occurs when optimizing an adaptive extrapolator. The optimization procedure
described above for the adaptive extrapolator can be performed only in the absence of quantization (when the quantizer is
"switched off"). In this case, the original x m, n  and recovered x  m, n  values of the image pixels are equal, the difference
f m, n and quantized difference f m, n  signals are also equal. The "activation" of the quantizer at the stage of extrapolator
optimization would lead to the impossibility of calculating the restored values of the pixels, since they, through the chain of
transformations, depend on the parameters () , () of the extrapolator, which at this stage are still unknown.</p>
      <p>Thus, the general scheme of DPCM compression with an adaptive extrapolator is as follows. First, to optimize the
extrapolator, a preliminary pass through the image with the "switched off" quantizer (i.e., zero-error) is performed. In this case,
the extrapolator parameters () , () are calculated. After that, the DPCM-compression itself is made, in which the quantizer is
"switched on" again, and the parameters () , () found on the preliminary pass are used for extrapolation.</p>
      <p>
        As a result, the parameters of the extrapolator, optimal by criterion (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ) with zero error, are used in compression with
nonzero error. In this situation, these parameters are no longer optimal, and the question of how far from the optimum they are,
requires additional research, which can only be experimental. Computational experiments were carried out on the so-called set
of halftone images "Waterloo" [21], which is traditionally used for the research of compression methods. Typical results are
shown in Fig. 1-2.
      </p>
      <p>
        The investigation was carried out for one-parameter problems (
        <xref ref-type="bibr" rid="ref13">13</xref>
        ). The quantities () , () , introduced by the relation (
        <xref ref-type="bibr" rid="ref12">12</xref>
        ),
which are calculated with zero quantization error, will be referred to below as the "estimative total error". The quantities () ,
() , calculated with a non-zero quantization error, will be referred to below as the "true total error". Thus, it is necessary to
answer the question of how closely the minimum of the true total error and the minimum of the estimative total error are located.
      </p>
      <p>The dependence of the total error () on the extrapolator parameter ( ) is shown in Fig. 1. The value of the second
parameter () was fixed (it was chosen in the optimal way). Then the same research was performed for total error () . The
dependence of the total error () on the extrapolator parameter () is shown in Fig. 2. Thus, accordingly, the value of the
parameter ( ) was fixed.</p>
      <p>(+)
3.5
2.5
1.5
(-)
3.5
2.5
( ) for a fixed ()  19 (the vertical line shows the position of the minimum of the estimative total error).
parameter () for a fixed ( )  7 (the vertical line shows the position of the minimum of the estimative total error).</p>
      <p>These researches allow drawing the following conclusions:
Estimative total error
Total extrapolation error
for uniform quantizer
Total extrapolation error
for Max’s quantizer
0
32
64
96</p>
      <p>Image Processing, Geoinformation Technology and Information Security / M.V. Gashnikov
Quantization affects the results of optimization of the adaptive extrapolator, since the minimum of the true total error
and the minimum of the estimative total error may not be equal
When using the Max quantizer, the values found for the parameters of the adaptive extrapolator are closer to the
optimum.</p>
      <p>It is necessary to carry out a research of the extrapolator's efficiency for estimating the effect of a mismatch between the
optimums of the true total error and estimative total error.
7.</p>
    </sec>
    <sec id="sec-6">
      <title>Research of the effectiveness of the adaptive extrapolation algorithm</title>
      <p>To evaluate the effectiveness of the adaptive extrapolator for compression, this extrapolator was compared with other
extrapolators. The comparison was produced by the entropy Hq of the quantized difference signal. This entropy is a good
estimate of compressed data size. The results are shown in Fig. 3-4.
Conclusions:
1. The adaptive extrapolator has the advantage over prototypes over the entropy of the quantized signal.
2. Consequently, the negative influence of the quantizer described in the previous section does not have a determining
value (at least for small extrapolation errors).
3. With increasing maximum error, the negative influence of the quantizer on the efficiency of the adaptive extrapolator
increases. With a maximum error of more than six, adaptive extrapolator loses the advantage.</p>
    </sec>
    <sec id="sec-7">
      <title>Experimental research of DPCM with an adaptive extrapolator for image compression</title>
      <p>To evaluate the efficiency of the image compression method based on DPCM with the adaptive extrapolator, it was compared
with method JPEG in the coordinates "error-compression ratio" on the set of images "Waterloo" [21], which is traditionally used
for comparison of compression methods. The results obtained, averaged over all images of the set, are shown in Fig. 5. The
results of the experiments demonstrate a significant gain (up to two times) of DPCM with an adaptive extrapolator for the JPEG
method with respect to the maximum error.</p>
      <p>JPEG
DPCM with
uniform
quantizer
DPCM with
Max’s
quantizer
2.1
2.9
3.7
4.5</p>
      <p>Kc</p>
    </sec>
    <sec id="sec-8">
      <title>9. Conclusion</title>
      <p>The significant influence of quantization on the optimization of the parameters of the adaptive extrapolator is described and
experimentally confirmed. It has been shown experimentally that, despite this negative effect of quantization, the adaptive
extrapolator within the DPCM compression method still has an advantage over prototypes with a small error. Also,
computational experiments were carried out to research the efficiency of the DPCM compression method with an adaptive
extrapolator and showed its advantage over the JPEG compression method with respect to the maximum error. Based on the
obtained results, it can be concluded that the considered method is promising for image compression systems and image
transmission systems.</p>
      <p>Further research will be aimed at eliminating the need for a preliminary pass through the image when optimizing the adaptive
extrapolator, which is necessary to simplify the use of the method of image compression for real-time systems, including
onboard systems. The possibility of such an improvement is based on the admissibility of estimating the distribution of
extrapolation errors during the actual DPCM processing. The question of the quality of such a "consistently refined" assessment
requires additional investigation.</p>
    </sec>
    <sec id="sec-9">
      <title>Acknowledgements References</title>
      <p>The work was funded by the Russian Science Foundation, grant No. 14-31-00014.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Chang</surname>
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Hyperspectral Data</surname>
          </string-name>
          <article-title>Processing: Algorithm Design and Analysis</article-title>
          . Wiley Press,
          <year>2013</year>
          ; 1164 p.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Sayood</surname>
            <given-names>K.</given-names>
          </string-name>
          <article-title>Introduction to Data Compression</article-title>
          . The Morgan Kaufmann Series in
          <source>Multimedia Information and Systems</source>
          , 4ed.,
          <year>2012</year>
          ; 743 p.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Salomon</surname>
            <given-names>D. Data</given-names>
          </string-name>
          <string-name>
            <surname>Compression</surname>
          </string-name>
          .
          <source>The Complete Reference</source>
          . Springer-Verlag,
          <year>4ed</year>
          ,
          <year>2007</year>
          ; 1118 p.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Vatolin</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smirnov</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yukin</surname>
            <given-names>V</given-names>
          </string-name>
          .
          <article-title>Data compression methods. Archive program architecture, image and video compression</article-title>
          .
          <source>Moscow: "Dialog-MIFI" Publisher</source>
          <year>2002</year>
          ;
          <volume>384</volume>
          p.
          <article-title>(in Russian)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Woods</surname>
            <given-names>E</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzalez</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Digital</surname>
          </string-name>
          <article-title>Image Processing</article-title>
          . Prentice Hall,
          <year>3ed</year>
          ,
          <year>2007</year>
          ; 976 p.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Pratt</surname>
            <given-names>W.</given-names>
          </string-name>
          <article-title>Digital image processing</article-title>
          . Wiley,
          <year>4ed</year>
          ,
          <year>2007</year>
          ; 807 p.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Woon</surname>
            <given-names>WM</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ho</surname>
            <given-names>ATS</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Tam</surname>
            <given-names>SC</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tan</surname>
            <given-names>SC</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yap</surname>
            <given-names>LT</given-names>
          </string-name>
          .
          <article-title>Achieving high data compression of self-similar satellite images using fractal</article-title>
          .
          <source>Proceedings of IEEE International Geoscience and Remote Sensing Symposium (IGARSS)</source>
          <year>2000</year>
          :
          <fpage>609</fpage>
          -
          <lpage>611</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Gupta</surname>
            <given-names>V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharma</surname>
            <given-names>V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <article-title>Enhanced Image Compression Using Wavelets</article-title>
          .
          <source>International Journal of Research in Engineering and Science (IJRES)</source>
          <year>2014</year>
          ;
          <volume>2</volume>
          (
          <issue>5</issue>
          ):
          <fpage>55</fpage>
          -
          <lpage>62</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Li</surname>
            <given-names>J. Image Compression</given-names>
          </string-name>
          :
          <source>The Mathematics of JPEG-2000. Modern Signal Processing. MSRI Publications</source>
          <year>2003</year>
          ;
          <volume>46</volume>
          :
          <fpage>185</fpage>
          -
          <lpage>221</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Plonka</surname>
            <given-names>G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tasche</surname>
            <given-names>M. Fast</given-names>
          </string-name>
          <article-title>and numerically stable algorithms for discrete cosine transforms</article-title>
          .
          <source>Linear Algebra and its Applications</source>
          <year>2005</year>
          ;
          <volume>394</volume>
          (
          <issue>1</issue>
          ):
          <fpage>309</fpage>
          -
          <lpage>345</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Wallace</surname>
            <given-names>G.</given-names>
          </string-name>
          <article-title>The JPEG Still Picture Compression Standard</article-title>
          .
          <source>Communications of the ACM</source>
          <year>1991</year>
          ;
          <volume>34</volume>
          (
          <issue>4</issue>
          ):
          <fpage>30</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Ebrahimi</surname>
            <given-names>F</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chamik</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Winkler</surname>
            <given-names>S.</given-names>
          </string-name>
          <article-title>JPEG vs. JPEG2000: An Objective Comparison of Image Encoding Quality</article-title>
          .
          <source>Proceedings of SPIE Applications of Digital Image Processing XXVII</source>
          <year>2004</year>
          ;
          <volume>5558</volume>
          :
          <fpage>300</fpage>
          -
          <lpage>308</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>M.</given-names>
          </string-name>
          <article-title>Interpolation for hyperspectral images compression</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          <year>2016</year>
          ;
          <volume>1638</volume>
          :
          <fpage>327</fpage>
          -
          <lpage>333</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glumov</surname>
            <given-names>NI</given-names>
          </string-name>
          .
          <article-title>Development and Investigation of a Hierarchical Compression Algorithm for Storing Hyperspectral Images</article-title>
          .
          <source>Optical Memory and Neural Networks. Allerton Press</source>
          <year>2016</year>
          ;
          <volume>25</volume>
          (
          <issue>3</issue>
          ):
          <fpage>168</fpage>
          -
          <lpage>179</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mullina</surname>
            <given-names>SS</given-names>
          </string-name>
          .
          <article-title>Adaptive parameterized predictor for differential image compression</article-title>
          .
          <source>Proceedings of the International Conference "Information Technologies and Nanotechnologies"</source>
          .
          <source>Samara</source>
          <year>2015</year>
          :
          <fpage>64</fpage>
          -
          <lpage>67</lpage>
          . (in Russian)
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Efimov</surname>
            <given-names>V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kolesnikov</surname>
            <given-names>AN</given-names>
          </string-name>
          .
          <article-title>Effectiveness estimation of the hierarchical and line-by-line lossless compression algorithms</article-title>
          .
          <source>Proceedings of the III conference "Pattern recognition and image analisys"</source>
          .
          <source>Nijni Novgorod</source>
          <year>1997</year>
          ;
          <volume>1</volume>
          :
          <fpage>157</fpage>
          -
          <lpage>161</lpage>
          . (in Russian)
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Lin</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Costello D. Error Control</surname>
          </string-name>
          <article-title>Coding: Fundamentals and Applications, second edition</article-title>
          . New Jersey:
          <article-title>Prentice-Hall, inc</article-title>
          .
          <source>Englewood Cliffs</source>
          ,
          <year>2004</year>
          ; 1260 p.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Chang</surname>
            <given-names>C.</given-names>
          </string-name>
          <article-title>Hyperspectral data exploitation: theory and applications</article-title>
          . Wiley-Interscience,
          <year>2007</year>
          ; 440 p.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>MV</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glumov</surname>
            <given-names>NI</given-names>
          </string-name>
          .
          <article-title>Hierarchical GRID Interpolation under Hyperspectral Images Compression</article-title>
          .
          <article-title>Optical Memory and Neural Networks (Information Optics)</article-title>
          .
          <source>Allerton Press</source>
          <year>2014</year>
          ;
          <volume>23</volume>
          (
          <issue>4</issue>
          ):
          <fpage>246</fpage>
          -
          <lpage>253</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Borengasser</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hungate</surname>
            <given-names>W</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Watkins</surname>
            <given-names>R</given-names>
          </string-name>
          .
          <article-title>Hyperspectral Remote Sensing - Principles and Applications</article-title>
          . CRC Press,
          <year>2004</year>
          ; 128 p.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Waterloo</surname>
            <given-names>Grey</given-names>
          </string-name>
          <string-name>
            <surname>Set</surname>
          </string-name>
          .
          <article-title>University of Waterloo Fractal coding and analysis group: Mayer Gregory Image Repository</article-title>
          . URL: http://links.uwaterloo.ca/ Repository.htm (
          <volume>19</volume>
          .
          <fpage>12</fpage>
          .
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>MV</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glumov</surname>
            <given-names>NI</given-names>
          </string-name>
          .
          <article-title>Onboard processing of hyperspectral data in the remote sensing systems based on hierarchical compression</article-title>
          .
          <source>Computer Optics</source>
          <year>2016</year>
          ;
          <volume>40</volume>
          (
          <issue>4</issue>
          ):
          <fpage>543</fpage>
          -
          <lpage>551</lpage>
          . (in Russian)
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>