<!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>Applications of Dempster-Shafer evidence theory to data processing in remote sensing</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Igor Prokopenko</string-name>
          <email>igorprok48@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sofiia Alpert</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuliia Petrova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ADP 24: International Workshop on Algorithms of Data Processing</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Aviation University</institution>
          ,
          <addr-line>Liubomyra Huzara Ave., 1, Kyiv, 03058</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Scientific Centre for Aerospace Research of the Earth of the Institute of Geological Science of the National Academy of Sciences of Ukraine</institution>
          ,
          <addr-line>Olesia Honchara Str., 55-b, Kyiv, 01054</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Nowadays various modern techniques and methods of remote sensing allow to identify, distinguish and investigate various objects, their main properties and connections. Remote-sensing techniques always require data processing. One of the most essential data processing procedures is the hyperspectral satellite image classification. It was noted that large volume of information causes a problem with the image classification procedure. Various spectral bands can give different probabilities of the same object belonging to a certain class. A lot number of spectral bands generates a multi-alternative classification problem. This problem demands a multi-alternative solution. Dempster-Shafer evidence theory can be used for solution of this multi-alternative classification problem. This theory can deal with ambiguous, partial, vague and controversial data. It was emphasized, that Dempster-Shafer evidence theory can be applied for image classification. It was considered an example of image classification applying Dempster-Shafer theory in this work. It also was analyzed two examples of applying the Dempster-Shafer evidence theory and Dempster combination rule to an object coordinate determination. Each sensor (radar) gives one coordinate of an object. The value of this coordinate lies within a confidence interval. Then all basic masses, belief functions, plausibility functions for all given intervals and all possible intersections of these intervals and belief intervals were calculated, applied main concepts of Dempster-Shafer evidence theory, accuracy and probability of failure-free operation of sensors. Then it was determined most likely coordinate of an object and its most probable confidence interval or intersection of these confidence intervals. Analyzing these two examples, we considered the relationship between reliability and basic mass.</p>
      </abstract>
      <kwd-group>
        <kwd>remote sensing</kwd>
        <kwd>evidence theory</kwd>
        <kwd>Dempster combination rule</kwd>
        <kwd>data processing 1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Recently, with the rapid development of science and technology, many new remote sensing methods,
technologies and materials have appeared. These new remote sensing techniques and approaches
are applied for environmental monitoring, agriculture problems, biological and geological tasks,
land-cover classification and various ecological problems.</p>
      <p>Nowadays a lot of remote sensing satellite image processing methods and techniques are known
[1 3].</p>
      <p>It should be noted that hyperspectral satellite images are most informative. They contain a large
amount of information about the objects, which allows detecting, analyzing and classifying objects,
recording changes and providing forecast estimates. This technique can be applied for the
identification of objects by analyzing their unique spectral signatures.</p>
      <p>It collects and processes information across the electromagnetic spectrum to obtain the spectrum
for each pixel in a hyperspectral satellite image.</p>
      <p>Hyperspectral satellite images provide unique additional information about the characteristics
and properties of researched objects. It was emphasized, that hyperspectral images provide important
and unique information about the all characteristics of researched objects [4, 5, 6].</p>
      <p>The total number of spectral bands in hyperspectral sensors is up to several hundred.</p>
      <p>Various remote sensing objects have different emissivity characteristics. In different spectral
different objects have various spectral characteristics.</p>
      <p>It should be noted that hyperspectral satellite images have some disadvantages.</p>
      <p>A large data volume causes a problem with the classification procedure. Different spectral bands
can give different estimates (probabilities) of the same object belonging to a certain class. In other
words, a large number of spectral bands pose a multi-alternative classification problem, which, in
turn, provides a multi-alternative solution to the problem in the form of a certain set of hypotheses.</p>
      <p>It should be noted, that Dempster-Shafer evidence theory can be applied for solution of this
multialternative classification problem.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Main concepts of Dempster-Shafer evidence theory</title>
      <p>Dempster-Shafer evidence theory is a generalization of traditional probability theory. But unlike
probability theory, Dempster-Shafer theory can process incomplete, imprecise and conflicting
information. It can process ignorance and missing information.</p>
      <p>This theory deal with probabilities of a collection of hypotheses, whereas a classic probability
theory deals with only one single hypothesis.</p>
      <p>That s why Dempster-Shafer evidence theory is more flexible approach than the probability
theory.</p>
      <p>Dempster-Shafer evidence theory allows to combine data obtained from different sources
(experts) and provides a multi-alternative solution of the problem (in the form of a set of hypotheses)
in the presence of inaccurate and contradictory input data.</p>
      <p>In other words, using the Dempster combination rule, it is possible to process all expert opinions
and obtain an integral (generalized) assessment.</p>
      <p>Dempster-Shafer evidence theory or the theory of belief functions, originated as a mathematical
approach for modeling uncertainty. This theory was developed in two stages by A. P. Dempster and
G. Shafer.</p>
      <p>The foundation of evidence theory is Dempster. He dealt with multivalued mappings and
statistical inference. Dempster introduced a method for combining evidence from different experts
(sources of information) to derive probabilistic conclusions. Then this method was formalized into
Dempster s combination rule.</p>
      <p>This rule allowed to combine independent sources of data. Unlike traditional probability theory,
it can combine conflicting or incomplete evidence from different sources and calculate degrees of
belief.</p>
      <p>Dempster-Shafer evidence theory does not require the strict assumptions of classic probability
theory, particularly when there is insufficient information to assign precise probabilities. G. Shafer
is a famous scientist in the fields of probability theory and statistics. He is known for his work on
the theory of belief functions and the Dempster-Shafer evidence theory, which is a mathematical
background for modeling incompleteness and uncertainty.</p>
      <p>Shafer expanded Dempster s work in the scientific work A Mathematical Theory of Evidence ,
which provided a more detail analysis of this theory. Shafer reinterpreted Dempster's work in terms
of belief functions and introduced the concept of belief and plausibility measures.</p>
      <p>Since Shafer s formalization, the Dempster-Shafer theory has gained attention in fields such as
artificial intelligence, data fusion, decision-making and expert systems, because this theory can
process uncertain data.</p>
      <p>This theory can be applied as an alternative to traditional probabilistic models, especially in cases
where data are incomplete or imprecise. It also can model imprecision [7, 8, 9].</p>
      <p>Shafer s contributions have been influenced expanding the traditional scope of known traditional
probability theory. He generalized Bayesian probability by degrees of belief. His work challenges the
assumption that uncertainty must always be represented by probabilities and has led to new
approaches in fields like expert systems, machine learning and pattern recognition.</p>
      <p>Shafer also made important contributions to the decision theory, philosophy of statistics and the
foundations of probability. His work intersects with the ideas of game theory and imprecise
probability, offering alternative views on how to process uncertain and incomplete information.</p>
      <p>Dempster-Shafer theory can process incomplete, uncertain and ambiguous information. Ω is a
frame of discernment, so Ω is a set of hypotheses about membership of certain pixel; 2Ω −number of
all subsets of Ω Ω and ∅ are included in this number too.  ( ) is the basic mass
(basic probability) that represents the degree of belief allocated to the certain hypothesis  .</p>
      <p>Basic mass satisfies the two conditions:
∑</p>
      <p>( ) = 1;  (∅) = 0.</p>
      <p>⊆2Ω
Let s note, that basic mass also satisfies such condition:</p>
      <p>0 ≤  ( ) ≤ 1.</p>
      <p>Subset  is called the focal subset, if basic mass  ( ) &gt; 0.</p>
      <p>
        Let s consider main differences between Dempster-Shafer evidence theory and probability theory.
The three conditions are met for the probability theory:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
1.  (Ω) = 1.
2. If  ⊂  , then the condition is necessarily satisfied:
      </p>
      <p>( ) ≤  ( ).
3.  ( ) +  ( ̅) = 1.</p>
      <sec id="sec-2-1">
        <title>4.  ̅ is the complement of the set  , so</title>
        <p>The three conditions are met for the Dempster-Shafer evidence theory:
1.  (Ω) ≠ 1.
2. If  ⊂  , then the condition is not necessarily satisfied:
 ( ) ≤  ( ).</p>
      </sec>
      <sec id="sec-2-2">
        <title>3. No relationship is demanded between  ( ) and  ( ̅).</title>
      </sec>
      <sec id="sec-2-3">
        <title>4.  ̅ − the complement of the set  , so</title>
        <p>∩  ̅ = ∅,
 ∪  ̅ = Ω.
 ∩  ̅ = ∅,
 ∪  ̅ = Ω.</p>
        <p>The probability theory requires complete knowledge of combined probabilities and the priory
knowledge of probability distribution. The main limitation of probability theory cannot model
imprecision and measure a body of evidence.</p>
        <p>Dempster-Shafer evidence theory is more flexible approach than the probability theory. It is
generalization of classical probability theory. It can process incomplete and vague information.
Dempster-Shafer theory can deal with probabilities of a collection of hypotheses, whereas a
traditional probability theory deals with only one single hypothesis. Dempster-Shafer evidence
theory can deal with missing and ignorance data.</p>
        <p>If we consider main differences between Dempster-Shafer evidence theory and probability theory,
we can conclude, that Dempster-Shafer evidence theory has advantages over probability theory.</p>
        <p>Let s note, that belief function  ( ) and plausibility function  ( ) shows the level of
hypothesis support.</p>
        <p>Belief function  ( ) measures the minimum or necessary support for the hypothesis. It is
calculated by summing the basic probabilities over all nonempty subsets  ≤  .</p>
        <p>
          The Belief function is defined as follows:
 ( ) = ∑  ( ). (
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
        </p>
        <p>⊆</p>
        <p>
          Plausibility function  ( ) reflects the maximum or potential support for that hypothesis. The
values of the plausibility function are a set of basic probabilities of all nonempty subsets
 intersecting with the considered subset 
 ( ) = ∑  ( ). (
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
        </p>
        <p>∩ ≠∅
The plausibility function  ( ) and belief function  ( ) are interconnected:</p>
        <p>
          ( ) = 1 −  ( ̅), (
          <xref ref-type="bibr" rid="ref4">4</xref>
          )
where  ̅− the complement of the set  , so
        </p>
        <p>∩  ̅= ∅,  ∪  ̅= Ω.</p>
        <p>Belief function defines the lower boundary of the interval containing the exact value of the
probability of the considered subset  . Plausibility function defines the upper boundary of the
interval containing the exact value of the probability of the considered subset  :
 ( ) ≤  ( ) ≤  ( ).</p>
        <p>Let s note, that [ ( ),  ( )] is called the belief interval. The length of this belief interval
shows the imprecision about the uncertainty value of  .</p>
        <p>
          Main properties of plausibility function  ( ) and belief function  ( ):
 (Ω) = 1; (
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
 (Ω) = 1; (
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
 ( ) ≤  ( ), ∀ ⊆ Ω; (
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
 ( ̅) = 1 −  ( ), ∀ ⊆ Ω; (
          <xref ref-type="bibr" rid="ref8">8</xref>
          )
        </p>
        <p>
          ( ) +  ( ̅) ≤ 1, ∀ ⊆ Ω. (
          <xref ref-type="bibr" rid="ref9">9</xref>
          )
        </p>
        <p>The main advantage of the Dempster-Shafer evidence theory is the presence of a simple rule for
combining data from different experts [8, 9]. This Dempster s combination rule is applied for
combining data from different experts or other sources.</p>
      </sec>
      <sec id="sec-2-4">
        <title>Suppose that one expert assigned mass  1 to the class  and another expert independently assigned mass  2 to the same class.</title>
        <p>Then, the combined assessment of the mass of the class  is defined as follows:</p>
        <p>1
 ( ) = 1 −  ∑  1( 1) ∙  2( 2),</p>
        <p>
          1∩ 2=
 =
∑
 1( 1) ∙  2( 2),
(
          <xref ref-type="bibr" rid="ref10">10</xref>
          )
(
          <xref ref-type="bibr" rid="ref11">11</xref>
          )
 1∩ 2=∅
where  is called conflict coefficient. The value of  reflects the degree of conflict among the sources
or experts.
        </p>
        <p>Conflict coefficient also satisfies next condition:</p>
        <p>0 ≤  ≤ 1.</p>
        <p>The less contradictions we have, the closer is the  value to 0.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Example of application of Dempster-Shafer evidence theory to image classification</title>
      <p>The process of solution of actual scientific and practical problems, using hyperspectral satellite
images as a rule includes a procedure of its classification.</p>
      <p>The most accurate results are provided by supervised classification method, which uses a priori
information about the characteristics of the classes. This information is extracted from the training
sample.
the pixel   .</p>
      <p>The hyperspectral image consists of a set of spectral images:
  = {  ,</p>
      <p>} =1;  = 1,2, … ,  .
where   is the  -spectral image;  is the total number of spectral images;   is the  -th pixel;  
is the total number of pixels in the hyperspectral image;  
is the  -component of full signal   of</p>
      <sec id="sec-3-1">
        <title>Full signal of a pixel is considered as a vector with components   in the spectral space:</title>
        <p>= { 

} =1.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Each   pixel of the hyperspectral image displays an object of some class and the aim of pixel</title>
        <p>wise classification, using the Dempster-Shafer evidence theory is to determine the class of the pixel
object   as accurately as possible, based on the analysis of the   signal.</p>
        <p>Dempster-Shafer evidence theory can be applied for image classification. The pixels of satellite
image are classified independently.</p>
        <p>Let s consider an example of hyperspectral satellite image classification applying
DempsterShafer evidence theory and Dempster s combination rule. The set of pixel signals of training sample
represents each class by a set of intervals in the spectral space. Each of the axes of this spectral space
is divided into intervals according to the number  of the classes. Each of these intervals gets a mark
of corresponding class.</p>
        <p>
          The position of the interval is set by the average values of the signals of pixels of certain class in
the certain spectral band. For example,  ̅ , and  ̅ , +1 are average values of the signals of pixels of
 -class and  + 1-class respectively for  -spectral band (see Figure 1).
(
          <xref ref-type="bibr" rid="ref12">12</xref>
          )
(13)
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>The point   , +1 divides s-class and  + 1-class.</title>
        <p>The position of point   , +1, intervals   and   −1 are defined from the next proportion:
 
  +1
=</p>
        <p>,
  , +1
are variances (standard deviations) of the signals of pixels of  -class and
where   , ,   , +1
 + 1-class.</p>
        <p>Then we should conduct a focalization procedure. Focalization is the procedure of obtaining the
list of focal pixel subsets, whose signals are located in this interval and the calculation procedure of
the basic probabilities for them.</p>
        <p>Supposing, that interval with certain class mark contains not only the signals of the pixels of the
same class, but the signals of the pixels of other classes as well. That s why, forming focal subsets
we consider a number of hypotheses about the class membership of the pixels. Each focal subset is
assigned a basic probability.</p>
        <p>One focal subset is formed from a single hypothesis that the pixel whose signal is located within
the interval, belongs to the same class as the interval. Each of the other focal subsets includes two
hypotheses. One hypothesis states that the class membership of the pixel corresponds to a given
interval, and another hypothesis states that pixel does not correspond to a given interval. If pixel
does not correspond to a given interval, it belongs to another specific class. Other intervals can be
formed for each of the classes represented in the hyperspectral satellite image in the same way.</p>
        <p>Suppose, the signals of the</p>
        <p>pixels are located in the spectral interval of the  1 −class.</p>
        <p>Then expert assesses the class membership of pixels:</p>
      </sec>
      <sec id="sec-3-4">
        <title>1.  1 pixels are assigned to the  1 − class.</title>
      </sec>
      <sec id="sec-3-5">
        <title>2.  2 pixels are assigned to the  2 − class.</title>
      </sec>
      <sec id="sec-3-6">
        <title>3.  3 pixels are assigned to the  3 − class.</title>
        <p>The list of focal subsets for the spectral interval includes such subsets:</p>
        <p>{ 1};
{ 1,  2};
{ 1,  3}.</p>
        <p>Then basic massed for these focal subsets are defined as follows:
1.  ({ 1}) =
2.  ({ 1,  2}) =
3.  ({ 1,  3}) =
 1.

 2.
 3.


Let s note, that</p>
        <p>=  1 +  2 +  3.
whole.</p>
        <p>Each pixel of hyperspectral satellite image displays an object of some class. Main purpose of
classification procedure is to determine the class of the pixel s object, based on the analysis of the
pixel signal.</p>
        <p>Let s note, that pixels of satellite image are analyzed and classified independently. Therefore, it
should consider the classification procedure for only one arbitrary pixel.</p>
        <p>The classification procedure involves such steps:</p>
        <p>The known signal   = {</p>
      </sec>
      <sec id="sec-3-7">
        <title>Analyzing components</title>
        <p>which corresponding components are located.</p>
        <p>} =1 of the pixel   is retrieved.</p>
        <p>of the vector signal   we should form spectral intervals within
3. Focal subsets and their basic masses for each of the spectral intervals are composed.</p>
        <p>The calculation of the combined basic masses for the focal subsets was conducted, applying
Dempster s combination rule.</p>
        <p>The calculated values of combined basic masses for all focal subsets are ranked. Then the
most likely class membership for the pixel is defined, applying the criterion of maximum
basic probability.</p>
        <p>This classification procedure can be applied sequentially to each pixel of the hyperspectral
satellite image and in the end of this procedure we get the classified hyperspectral satellite image in</p>
        <p>The results of classification of the hyperspectral image EO1H1810252013112110KF of the Kyiv
region in April 2013, obtained by the EO-1 satellite system (see Figure 2, a) by the Dempster-Shafer
method are shown in Figure 2, b [9, 4].</p>
        <p>The six classes of objects were identified: 1</p>
        <p>deciduous forest, 2 orchards, 3 uncultivated land,
cereal fields, 6</p>
        <p>vegetable fields.
a)
b)</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Examples of applying the Dempster-Shafer evidence theory to an object coordinate determination</title>
      <sec id="sec-4-1">
        <title>4.1. First example</title>
        <p>Let s consider an example of applying the Dempster s combination rule to determine the coordinates
of an object (target). Most likely coordinate of an object locates in the interval or intersection of
intervals with maximum value of basic mass, belief function and plausibility [10, 11, 12].</p>
        <p>Suppose we have 3 sensors (radars):
1. Sensor 1 with confidence interval  .
2. Sensor 2 with confidence interval  .
3. Sensor 3 with confidence interval  .</p>
        <p>In this case, the basic mass, confidence interval, accuracy of each sensor (radar) and reliability are
determined by the passport data. Each radar gives one coordinate of an object. The value of this
coordinate locates within a confidence interval (see Figure 3).</p>
        <p>Let s note, that different sensors have different accuracy, basic masses, confidence intervals and
reliability. We find the most likely confidence interval where the object's coordinate locates, taking
into account the accuracy and reliability of the sensors. Reliability is the probability of failure-free
operation. Accuracy of the sensor is determined by the length of the confidence interval. It should
be noted that the smaller the confidence interval in which the object coordinate value is located, the
higher the value of the basic mass and accuracy of this sensor.</p>
        <p>Initial conditions of the problem are as follows:</p>
        <p>
          I sensor: confidence interval  ≡ (
          <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
          );  1 = 0.5 − probability of failure-free operation;
II sensor: confidence interval  ≡ (1.5, 4);  2 = 1 − probability of failure-free operation;
III sensor: confidence interval  ≡ (
          <xref ref-type="bibr" rid="ref1 ref7">1, 7</xref>
          );  3 = 0.6 − probability of failure-free operation.
 1({ }) = | 1| = 01.5
 2({ }) = |  2| = 21.5
 3({ }) = | 3| = 06.6
Then values of the basic masses are normalized:
= 0.5;
        </p>
        <p>Belief functions for intervals  ,  ,  are defined as follows:
 ({ }) =  1 ({ }) = 0.5;
 ({ }) =  2 ({ }) = 0.4;
 ({ }) =  3 ({ }) = 0.1.</p>
        <p>Plausibility functions for intervals A, B, C are defined as follows:
 ({ }) =  1 ({ }) +  3 ({ }) = 0.5 + 0.1 = 0.6;
 ({ }) =  2 ({ }) +  3 ({ }) = 0.4 + 0.1 = 0.5;</p>
        <p>({ }) =  3 ({ }) = 0.1.</p>
        <p>Basic mass for intersection  ∩  is defined as follows:</p>
        <p>12({ ∩  }) =  1 ({ }) ∙  2 ({ }) = 0.5 ∙ 0.4 = 0.2.</p>
        <p>In this case conflict coefficient  = 0, because all intersections of sets are not empty. Basic
mass for intersection  ∩  ∩  is defined as follows:</p>
        <p>123({ ∩  ∩ С}) =  12({ ∩  }) ∙  3 ({ }) = 0.2 ∙ 0.1 = 0.02.</p>
        <p>In this case conflict coefficient  ̃ = 0 too, because all intersections of sets are not empty.
Belief functions and plausibility functions for intersection  ∩  ∩  are defined as follows:
 ({ ∩  ∩ С}) =  123({ ∩  ∩ С}) = 0.02;
 ({ ∩  ∩ С}) =  1 ({ }) +  2 ({ }) +  3 ({ }) = 0.5 + 0.4 + 0.1 = 1.</p>
        <p>Basic mass for intersection  ∩  is defined as follows:</p>
        <p>({ ∩  }) =  1 ({ }) = 0.5.</p>
        <p>Belief functions and plausibility functions for intersection  ∩  are defined as follows:
 ({ ∩  }) =  ({ }) =  1 ({ }) = 0.5;
 ({ ∩  }) =  ({ }) =  1 ({ }) +  3 ({ }) = 0.5 + 0.1 = 0.6.</p>
        <p>Basic mass for intersection  ∩  is defined as follows:</p>
        <p>({ ∩  }) =  2 ({ }) = 0.4.</p>
        <p>Belief functions and plausibility functions for intersection  ∩  are defined as follows:
 ({ ∩  }) =  ({ }) =  2 ({ }) = 0.4;
 ({ ∩  }) =  ({ }) =  2 ({ }) +  3 ({ }) = 0.4 + 0.1 = 0.5.</p>
        <p>Belief intervals for intervals A, B, C and all possible intersections of these intervals are defined
as follows:
Belief interval for A: [ ({ }),  ({ })] ≡ [0.5; 0.6];
Belief interval for B: [ ({ }),  ({ })] ≡ [0.4; 0.5];
Belief interval for C: [ ({ }),  ({ })] ≡ [0.1; 0.1] ≡ {0,1};
Belief interval for  ∩  ∩ С: [ ({ ∩  ∩ С}),  ({ ∩  ∩ С})] ≡ [0.02; 1];  ({ ∩
 ∩ С}) = 0.02.</p>
        <p>Belief interval for  ∩ С: [ ({ ∩ С}),  ({ ∩ С})] ≡ [0.5; 0.6];  ({ ∩ С}) = 0.5.</p>
        <p>Belief interval for  ∩ С: [ ({ ∩ С}),  ({ ∩ С})] ≡ [0.4; 0.5];  ({ ∩ С}) = 0.4.</p>
        <p>So, interval  and intersection  ∩  are assigned maximum values of basic masses (basic
probabilities), belief functions and plausibility functions.</p>
        <p>Then we can make a conclusion, most likely coordinate of an object lies within a intersection of
confidence intervals  and  :  ∩  .</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Second example</title>
        <p>Let s consider another example of applying the Dempster s combination rule to determine the
coordinates of an object (target).</p>
        <p>Initial confidence intervals  ,  ,  will be same as initial confidence intervals in I example (see
Figure 3).</p>
        <p>But reliabilities (probabilities of failure-free operations) of these 3 sensors will be another.</p>
        <p>
          I sensor: confidence interval  ≡ (
          <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
          );  1 = 0.2 − probability of failure-free operation.
II sensor: confidence interval  ≡ (1.5, 4);  2 = 1 − probability of failure-free operation.
        </p>
        <p>
          III sensor: confidence interval  ≡ (
          <xref ref-type="bibr" rid="ref1 ref7">1, 7</xref>
          );  3 = 0.6 − probability of failure-free operation.
        </p>
        <p>So, interval  and intersection  ∩  are assigned maximum values of basic masses (basic
probabilities), belief functions and plausibility functions. Then we can make a conclusion, most
likely coordinate of an object locates within the intersection of confidence intervals  and  :  ∩  ,
because initial value of reliability (probability of failure-free operation) of II sensor is maximum
( 2 = 1), and initial values of reliability (probability of failure-free operation) of I and III sensor are
smaller ( 1 = 0.2;  3 = 0.6 ).</p>
        <p>Analyzing these two examples, we can consider the relationship between probability of
failurefree operation and basic mass. The higher the initial value of probability of failure-free operation,
the higher the value of basic mass of the sensor and it s belief interval.</p>
        <p>It was noted, that determination of confidence interval or intersection of confidence intervals
with maximum value of basic mass depends on sensor specifications.</p>
        <p>Changes in sensor specifications affect the choice of confidence interval with maximum value of
basic mass and coordinate determination of an object (target).</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>Nowadays Remote sensing is one of the most popular techniques of obtaining information about the
properties of objects by data collected from sensors or unmanned aerial vehicles (UAV). Different
techniques of remote sensing can distinguish various objects, study these objects and make
predictive estimations. Remote sensing provides data about objects based on analysis of
electromagnetic radiation emitted or reflected from these researched objects. Remote sensing is used
in various fields. It is applied for ecology, hydrology, geology, geophysics, geography, agriculture,
oceanography. Modern remote-sensing techniques involves data processing. It was noted, that one
of the most important data processing procedures is the image classification. The process of solution
of various remote sensing tasks, using hyperspectral satellite images includes a classification
procedure. Each pixel of the hyperspectral image displays an object of some class and the aim of
pixel-wise classification is to determine the class of this pixel object.</p>
      <p>It was emphasized, that hyperspectral images provide important and unique information about
the all characteristics of researched objects. But it was noted, that large data volume causes a problem
with the classification procedure. Different spectral bands can give different assessments or
probabilities of the same object belonging to a certain class, because a lot of spectral bands poses a
multi-alternative classification problem, which provides a multi-alternative solution to the problem.</p>
      <p>It should be noted, that Dempster-Shafer evidence theory can be applied for solution of this
multialternative classification problem.</p>
      <p>It was considered and analyzed main concepts of Dempster-Shafer evidence theory. It is
generalization of classical probability theory and it can overcome some limitations of known
probability theory.</p>
      <p>This theory can process conflicting, incomplete and ambiguous information. It was proposed to
apply the Dempster s combination rule for classification of vague and contradictory data from
different experts. Dempster-Shafer theory can deal with missing information, ignorance data and
probabilities of a collection of hypotheses.</p>
      <p>It was noted, that Dempster-Shafer evidence theory can be applied for image classification.</p>
      <p>It was considered an example of hyperspectral satellite image classification applying
DempsterShafer evidence theory and Dempster s combination rule. It was considered results of classification
of the hyperspectral image in this work.</p>
      <p>It also was considered two examples of applying the Dempster-Shafer evidence theory to an
object coordinate determination, applying data for 3 sensors (radars). Each radar gives one
coordinate of an object. The value of this coordinate locates within a confidence interval. It was
noted, that various sensors (radars) have different confidence intervals, accuracy and reliability
(probability of failure-free operation).</p>
      <p>Then all basic masses, belief functions, plausibility functions for intervals A, B, C, all possible
intersections of these intervals and belief intervals were calculated, applying main concepts of
Dempster-Shafer theory, basic masses, accuracy and probability of failure-free operation of sensors.
Then it was determined most likely coordinate of an object and its most probable confidence interval
or intersection of these confidence intervals.</p>
      <p>Analyzing these two considered examples, we can show the relationship between reliability
(probability of failure-free operation) and basic mass. The higher the initial value of reliability
(probability of failure-free operation), the higher the value of basic mass of the sensor and it s belief
interval.</p>
      <p>It was noted, that determination of confidence interval or intersection of confidence intervals
with maximum value of basic mass depends on sensor specifications.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <article-title>Evaluating the reliability coefficient of sensor based on the training data within the framework of evidence theory</article-title>
          ,
          <source>IEEE Access 6</source>
          (
          <year>2018</year>
          )
          <fpage>30592</fpage>
          30601. doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2018</year>
          .
          <volume>2816915</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <article-title>Evidence conflict measure based on OWA operator in open world</article-title>
          ,
          <source>PLoS ONE 12</source>
          (
          <year>2017</year>
          ). doi:
          <volume>10</volume>
          .1371/journal.pone.
          <volume>0177828</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <article-title>A new correlation coefficient based on generalized information quality</article-title>
          ,
          <source>Open Access Journal</source>
          <volume>7</volume>
          (
          <year>2019</year>
          )
          <fpage>175411</fpage>
          175419. doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2019</year>
          .
          <volume>2957796</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. O.</given-names>
            <surname>Popov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. M.</given-names>
            <surname>Podorvan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. I.</given-names>
            <surname>Alpert</surname>
          </string-name>
          ,
          <article-title>A method for hyperspectral satellite image classification using Dempster s combination rule</article-title>
          ,
          <source>Space science and technology 1</source>
          (
          <year>2015</year>
          ) 25
          <fpage>37</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Wintle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Fraser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Wills</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Nicholson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Fidler</surname>
          </string-name>
          ,
          <article-title>Verbal probabilities: Very likely to be somewhat more confusing than numbers</article-title>
          ,
          <source>PLoS ONE 14</source>
          (
          <year>2019</year>
          ). doi:
          <volume>10</volume>
          .1371/journal.pone.
          <volume>0213522</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Alpert</surname>
          </string-name>
          ,
          <article-title>The new approach to applying the Dezert-Smarandache theory in land-cover classification in UAV-based remote sensing</article-title>
          ,
          <source>Management of Development of Complex Systems</source>
          <volume>49</volume>
          (
          <year>2022</year>
          )
          <fpage>33</fpage>
          39. doi:
          <volume>10</volume>
          .32347/
          <fpage>2412</fpage>
          -
          <lpage>9933</lpage>
          .
          <year>2022</year>
          .
          <volume>49</volume>
          .
          <fpage>33</fpage>
          -
          <lpage>39</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Qian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Yang</surname>
          </string-name>
          , W. Han,
          <article-title>Research on the fusion of dependent evidence based on rank correlation coefficient</article-title>
          ,
          <source>Sensors</source>
          <volume>17</volume>
          (
          <year>2017</year>
          )
          <article-title>2362</article-title>
          . doi:
          <volume>10</volume>
          .3390/s17102362.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mahadevan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <article-title>On consideration of dependence and reliability of evidence in Dempster Shafer theory</article-title>
          ,
          <source>Journal of Information and Computational Science</source>
          <volume>11</volume>
          (
          <year>2014</year>
          ) 4901
          <fpage>4910</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Popov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Alpert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Podorvan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Topolnytskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mieshkov</surname>
          </string-name>
          ,
          <article-title>Method of hyperspectral satellite image classification under contaminated training samples based on Dempster-Shafer s paradigm</article-title>
          ,
          <source>Central European Researchers Journal</source>
          <volume>1</volume>
          (
          <year>2015</year>
          ) 86
          <fpage>97</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <article-title>Comparison of classification algorithms and training sample sizes in urban land classification with Landsat thematic mapper imagery</article-title>
          ,
          <source>Remote Sensing</source>
          <volume>6</volume>
          (
          <year>2014</year>
          ) 964
          <fpage>983</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Persello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bruzzone</surname>
          </string-name>
          ,
          <article-title>Active and semisupervised learning for the classification of remote sensing images</article-title>
          ,
          <source>IEEE Transactions on Geoscience and Remote Sensing</source>
          <volume>52</volume>
          (
          <year>2014</year>
          ) 6937
          <fpage>6956</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Guan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Conflict evidence measurement based on the weighted separate union kernel correlation coefficient</article-title>
          ,
          <source>Open Access Journal</source>
          <volume>6</volume>
          (
          <year>2018</year>
          )
          <fpage>30458</fpage>
          30472. doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2018</year>
          .
          <volume>2844201</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>