<!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>Adaptive interpolation of multidimensional signals for compression on board an aircraft</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>N I Glumov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>M V Gashnikov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Image Processing Systems Institute of RAS - Branch of the FSRC "Crystallography and Photonics" RAS</institution>
          ,
          <addr-line>Molodogvardejskaya street 151, Samara, Russia, 443001</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Samara National Research University</institution>
          ,
          <addr-line>Moskovskoe Shosse 34А, Samara, Russia, 443086</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <fpage>97</fpage>
      <lpage>102</lpage>
      <abstract>
        <p>We consider the compression of multidimensional signals on the aircraft board. We describe the data of such signals as a hypercube, which is "rotated" in a special way. To compress this hypercube, we use a hierarchical compression method. As one of the stages of this method, we use an adaptive interpolation algorithm. The adaptive algorithm automatically switches between different interpolating functions at each signal point. We perform computational experiments in real-world multidimensional signals. Computational experiments confirm that the use of proposed adaptive interpolator allows increasing (up to 31%) the compression ratio of the “rotated” hypercube corresponding to multidimensional hyperspectral signals.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The growing interest in applied problems in the field of processing multidimensional signals [1-4]
determines the relevance of research in this area. One of the main issues is the data size corresponding
to the multi-dimensional signals. For example, data of hyperspectral remote sensing [1, 3], as one of
the types of multidimensional signal, contain up to several hundred large-sized components of high bit
depth. With airborne compression, this information needs to be transmitted through a limited
communication channel. In this situation, the use of compression [5-8] is the only possible solution.
Currently, there are many methods of compression: wavelet [9], spectral [10], fractal [11], etc.
However, all of them are very limited in airborne compression due to the high computational
complexity and complexity of error control in the spatial domain. Besides, when a hyper-spectral data
is received, a hypercube of a multidimensional signal is often “rotated” (see Figure 1-2) in a specific
way: the first component (band) contains the first lines of the source bands; the second band includes
the second lines, etc. We can see that this leads to the appearance of anisotropic correlation
peculiarities in the signal cross-sections.</p>
      <p>In the described conditions, the method of multidimensional signal compression based on
hierarchical grid interpolation [12–13] has proven itself well. The most difficult stage of this
compression method, which largely determines the efficiency of the method as a whole, is an
interpolator of a multidimensional signal. In this paper, an adaptive interpolator based on hybrid
technology is proposed for interpolation of specifically “rotated” multidimensional signals
corresponding to hyperspectral remote sensing data. This technology combines the autoregressive
prediction of the signal cross-sections and adaptive parameterized interpolation within the
crosssections, which makes it possible to use the above-described correlation anisotropy of the
multidimensional signal effectively.</p>
      <p>To study the proposed multidimensional interpolator, computational experiments are performed on
natural multidimensional signals.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Autoregressive prediction of cross-sections of multidimensional signal</title>
      <p>Consider a multidimensional (D-dimensional) signal</p>
      <p>X = {x (d0 , d1,.., dD−1 )} .</p>
      <p>This signal can also be considered as a set of (D–1) dimensional cross-sections:</p>
      <p>X t =(d1,.., {xt dD−1 )} =(t,d1,.., {x dD−1 )}, 0 ≤ t &lt; T .</p>
      <p>Often these cross-sections are highly correlated (see Figures 1-2), for example, when processing
hyperspectral data of remote sensing (for a hyperspectral signal of this type D = 3, and T coincides
with the number of spectral bands). To account for the interdependency of the components, we use the
linear autoregressive model:</p>
      <p>
        Pt =k1X t −1 + k2 X t −2 + ... + kN X t − N , (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
where P is the predicted cross-section of the multidimensional signal X, ki are regression coefficients,
N is the number of reference cross-sections used for the prediction. These coefficients are found from
the condition of minimizing the quadratic error between the original and predicted components:
εt2 =E  X t − ∑iN=1 ki X t −i 2  → m{kiin} . (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
Consider also the differential cross-section of the signal
      </p>
      <p>
        Rt (d1,.., dD−1 ) =(d1,.., X t dD−1 ) − Pt (d1,.., dD−1 ) , 1 ≤ t &lt; T . (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <p>
        The variance of differential cross-section Rt is usually much smaller than the variance of the
original cross-section Xt, and the probability distribution is much less uniform. Therefore, the
differential cross-sections (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) are much more preferable for some types of processing, for example for
compression.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Hierarchical compression of multidimensional signals</title>
      <p>
        The difference cross-sections (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) are decorrelated, so that they can be processed independently. In this
paper, these difference components are compressed using a hierarchical compression method [12–13],

which uses a non-redundant hierarchical representation of a multidimensional signal X = {x (d )} as a
set of L scale levels Xl :
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
      </p>
      <p>L−1
X =  Xl , Xl</p>
      <p>l=0
where Il is the set of sample indices for scale level Xl :
 
={x(d ) : d ∈ Il } ,
I L−1 = { 2L−1d} , Il
=}\ { 2l d { 2l +1d}, 0 ≤ l &lt; L .</p>
      <p></p>
      <p>The scale level number (L – 1) is the resampled “grid” of signal samples with the step of 2(L – 1)
along each of the coordinates, and any other level (number l) is the grid of samples with the step of 2l,
from which all samples with doubled step are excluded.</p>
      <p>
        During compression, the scale levels are compressed sequentially in order of decreasing their
numbers. At the same time, more resampled levels are interpolated based on samples of less resampled
levels. Since peculiarities of post-interpolation residues are similar to peculiarities of differences (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ),
their coding is much more efficient than coding sources samples.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Adaptive interpolation of multidimensional signals during compression</title>
      <p>
        The most critical step of hierarchical compression is the interpolator. In this work, differential
crosssections (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) are compressed. The dimension of these differential cross-sections is one less than the
dimension of the original signal. Thus, for three-dimensional remote sensing, the interpolator will
work with two-dimensional data. Therefore, further, to simplify the presentation, we describe a
twodimensional version of the adaptive interpolator.
      </p>
      <p>To ensure low computational complexity of hierarchical compression, we often use trivial
interpolation procedures, based on averaging over the nearest samples of more resampled scale levels.
Here is an example of an interpolation procedure:</p>
      <p>
        1
xl(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) (2m + 1, 2n + 1) =4 ( xl+1 (m, n ) + xl+1 (m + 1, n ) + xl+1 (m, n + 1) + xl+1 (m + 1, n + 1)) , (
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
where xl+1 (m, n ) are samples of a more resampled scale level, which have already passed
compression and decompression.
      </p>
      <p>
        This scheme is straightforward, but does not take into account local signal characteristics, for
example, the oblong structures of onboard remote sensing data [14-16] (see Figure 2). Therefore, in
this work, an adaptive interpolator is used to compress such remote sensing data. Besides function (
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
this adaptive interpolator, uses two more interpolating functions that increase interpolation accuracy of
oblong structures by averaging “along” them
xl(0) (2m + 1, 2n + 1) =(xl+1 12 (m, n ) + xl+1 (m + 1, n + 1) ) (
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
xl(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) (2m + 1, 2n + 1) =12( xl+1 (m + 1, n ) + xl+1 (m, n + 1) ) (
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
The choice of the interpolating function for each signal sample is carried out by the parameterized
decision rule:
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
0, µl (m, n ) &lt; α;
 
xl (m, n ) =x( j) (m, n ) , j =1,
l
      </p>
      <p>
        α ≤ µl (m, n ) ≤ β;
2, µl (m, n ) &gt; β;
where α, β are parameters of the decision rule (thresholds for switching between interpolating
functions). These parameters are calculated automatically based on minimization of interpolation error
or entropy of quantized post-interpolation residues; µl (m, n ) is a feature describing the magnitude and
direction of the elongated structure in the local neighborhood of the current signal sample:
µl (2m + 1, 2n + 1) = xl+1 (m, n ) − xl+1 (m + 1, n + 1) − xl+1 (m, n + 1) − xl+1 (m + 1, n ) .
(
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
The large absolute values
µl (2m + 1, 2n + 1)
of the feature (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) describe to the samples
corresponding the stable oblong structures. In these situations, interpolation (
        <xref ref-type="bibr" rid="ref8 ref9">8-9</xref>
        ) “along” these
structures is preferred. Small values of the attribute (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) correspond to the signal samples located in
relatively uniform signal areas. In these areas, the “averaging” interpolation (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) works more precisely
by averaging a noise.
      </p>
      <p>The optimization of the adaptive interpolator according to the parameters α, β is performed
separately [17] for each signal realization (more precisely, separately for each hierarchical signal
level).</p>
    </sec>
    <sec id="sec-5">
      <title>5. Experimental study of the adaptive interpolator</title>
      <p>The proposed hybrid interpolator, including an intercomponent approximator and an intracomponent
adaptive interpolator, was implemented by software and built into the hierarchical compression
method. Based on this software, we performed an experimental study of the proposed interpolator
effectiveness in nature multidimensional signal sets, “rotated” in a specific way to airborne
compression (see the example in Figure 2). We used the following signal sets:
• signals [14] of hyper-spectrometer AVIRIS (224 bands);
• signals [15] of «TokyoTech» hyperspectral dataset (31 bands);
• signals [16] of hyper-spectrometer SpecTIR (360 bands, see Figure 1).</p>
      <p>
        As a measure of the proposed interpolator efficiency, we used the gain G in the archive size (in %),
which was provided by replacing the averaging interpolator (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) with the proposed hybrid interpolator
in the frame of hierarchical compression method:
      </p>
      <p>
        G = 100% ⋅ ( Snew − Sbase ) Sbase ,
(
        <xref ref-type="bibr" rid="ref11">11</xref>
        )
where Sbase , Snew are the archive sizes when using averaging and proposed interpolators, respectively.
We estimated the dependence of gain (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ) on the quadratic error ε2 introduced during compression.
Typical results are shown in Tables 1-9. We can see that the proposed hybrid interpolator provides
a noticeable gain (up to 31%) for the averaging interpolator.
      </p>
      <p>ε2
G,%</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>We considered the compression of multidimensional signals, which are described by the hypercube,
«rotated» in a manner specific for onboard processing. To compress this hypercube, we used the
hierarchical compression method. As one of the stages of this method, we used the adaptive
interpolation algorithm based on automatic switching between different interpolating functions at each
point of the signal. We confirmed computational experiments in natural multidimensional signals,
which confirmed that the use of proposed adaptive interpolator allows increasing (up to 31%)
the compression ratio of the «rotated» hypercube corresponding to multidimensional hyperspectral
signals.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The reported study was funded by: RFBR according to the research projects 18-01-00667,
18-0701312; the RF Ministry of Science and Higher Education within the state project of FSRC
“Crystallography and Photonics” RAS under agreement 007-GZ/Ch3363/26.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Chang</surname>
            <given-names>C 2013</given-names>
          </string-name>
          <article-title>Hyperspectral data processing: Algorithm design and analysis</article-title>
          (Wiley &amp; Sons)
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Dajion</surname>
            <given-names>D</given-names>
          </string-name>
          and
          <string-name>
            <surname>Mercero</surname>
            <given-names>R 1988</given-names>
          </string-name>
          <article-title>Digital processing of multidimensional signals (M: Mir)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Schowengerdt</surname>
            <given-names>R 2007</given-names>
          </string-name>
          <article-title>Remote sensing: models and methods for image processing</article-title>
          (Academic Press)
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Woods</surname>
            <given-names>J 2011</given-names>
          </string-name>
          <string-name>
            <surname>Multidimensional Signal</surname>
            , Image, and
            <given-names>Video</given-names>
          </string-name>
          <string-name>
            <surname>Processing</surname>
          </string-name>
          and Coding (Academic Press)
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Rehman</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharif</surname>
            <given-names>M</given-names>
          </string-name>
          and
          <string-name>
            <surname>Raza M 2014</surname>
          </string-name>
          <article-title>Image compression:</article-title>
          <source>A survey Research Journal of Applied Sciences, Engineering and Technology</source>
          <volume>7</volume>
          <fpage>656</fpage>
          -
          <lpage>672</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Bookstein</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Klein S</surname>
          </string-name>
          <article-title>1990 Compression, information theory and grammars: a unified approach ACM Trans</article-title>
          .
          <source>Inf. Systems</source>
          <volume>8</volume>
          <fpage>27</fpage>
          -
          <lpage>49</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Soifer</surname>
            <given-names>V 2009</given-names>
          </string-name>
          <string-name>
            <surname>Computer Image</surname>
            <given-names>Processing</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          :
          <article-title>Methods and algorithms</article-title>
          (VDM Verlag)
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Woods</surname>
            <given-names>E</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gonzalez R 2007 Digital Image Processing (Prentice Hall)</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Fouad M 2015 A Lossless</surname>
          </string-name>
          <article-title>Image Compression Using Integer Wavelet Transform with a Simplified Median-edge</article-title>
          <source>Detector Algorithm International Journal of Engineering &amp; Technology</source>
          <volume>15</volume>
          <fpage>68</fpage>
          -
          <lpage>73</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Plonka</surname>
            <given-names>G</given-names>
          </string-name>
          and
          <string-name>
            <surname>Tasche M 2005</surname>
          </string-name>
          <article-title>Fast and numerically stable algorithms for discrete cosine transforms</article-title>
          <source>Linear Algebra and its Applications</source>
          <volume>394</volume>
          <fpage>309</fpage>
          -
          <lpage>345</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Muruganandham</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Banu</surname>
            <given-names>R 2010</given-names>
          </string-name>
          <article-title>Adaptive fractal image compression using PSO</article-title>
          <source>Procedia Computer Science</source>
          <volume>2</volume>
          <fpage>338</fpage>
          -
          <lpage>344</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Sergeev</surname>
            <given-names>V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>M</given-names>
          </string-name>
          and
          <string-name>
            <surname>Glumov N 1999 The Informational</surname>
          </string-name>
          <article-title>Technique of Image Compression in</article-title>
          <source>Operative Remote Sensing Systems RAS Samara Research Center Bulletin</source>
          <volume>1</volume>
          <fpage>99</fpage>
          -
          <lpage>107</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Maksimov</surname>
            <given-names>A I</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gashnikov M V 2018</surname>
          </string-name>
          <article-title>Adaptive interpolation of multidimensional signals for differential compression</article-title>
          <source>Computer Optics</source>
          <volume>42</volume>
          (
          <issue>4</issue>
          )
          <fpage>679</fpage>
          -
          <lpage>687</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2018-42-4-
          <fpage>679</fpage>
          -687
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>[14] URL: http://aviris.jpl.nasa.gov/data/free_data.html</mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>[15] URL: http://www.ok.sc.e.titech.ac.jp/res/MSI/ MSIdata31.html</mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>[16] URL: http://www.spectir.com/free-data-samples</mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>M V</given-names>
          </string-name>
          <year>2017</year>
          <article-title>Minimizing the entropy of post-interpolation residuals for image compression based on hierarchical grid interpolation</article-title>
          <source>Computer Optics</source>
          <volume>41</volume>
          (
          <issue>2</issue>
          )
          <fpage>266</fpage>
          -
          <lpage>275</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2017-41-2-
          <fpage>266</fpage>
          -275
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>