<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>and Archana Shenoy B. Hierarchical clustering
algorithm for land cover mapping using satellite images. IEEE Journal of Selected Topics in Applied
Earth Observations and Remote Sensing</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1109/JSTARS.2012.2187432</article-id>
      <title-group>
        <article-title>Active Learning with SVM for Land Cover Classification - What Can Go Wrong?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>S. Wuttke</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>W. Middelmann</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>U. Stilla</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Fraunhofer IOSB</institution>
          ,
          <addr-line>Gutleuthausstr. 1, 76275 Ettlingen</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Technische Universitaet Muenchen</institution>
          ,
          <addr-line>Arcisstr. 21, 80333 Muenchen</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2012</year>
      </pub-date>
      <volume>2014</volume>
      <issue>283921</issue>
      <fpage>762</fpage>
      <lpage>768</lpage>
      <abstract>
        <p>Training machine learning algorithms for land cover classification is labour intensive. Applying active learning strategies tries to alleviate this, but can lead to unexpected results. We demonstrate what can go wrong when uncertainty sampling with an SVM is applied to real world remote sensing data. Possible causes and solutions are suggested.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>• Apply an SVM with uncertainty sampling and query by committee on five real world datasets
• Present the results and discuss possible causes for the underperforming of active learning
• Suggest future actions to alleviate the observed problems
2</p>
    </sec>
    <sec id="sec-2">
      <title>Method</title>
      <p>2.1</p>
      <sec id="sec-2-1">
        <title>Pre-Processing</title>
        <p>The presented method is deliberately kept simple to reduce possible error sources. The results are still expected
to demonstrate the advantages of active learning compared to passive learning.</p>
        <p>For noise reduction and lowering the amount of data to be processed, segmentation is applied. Here we use the
Multi-Resolution-Segmentation algorithm of the eCognition Software [Tri14] with its default parameters. All
pixels of a segment are then combined to an average value, which is the new feature. The reasoning behind this
is the smoothness assumption [Sch12]. This assumption states that, because of increasing sensor resolution, the
probability that two neighbouring pixels belong to the same class, increases. As a result each training sample
represents the average spectrum of the materials present in its segment. This step was not applied to the Indian
Pines dataset because of its low resolution. Therefore this dataset has an order of magnitude more samples than
the others. No further feature extraction was done to keep possible error sources to a minimum. Classes with
less then 15 samples were removed to reduce outlier effects.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Classification Algorithm</title>
        <p>The used classification algorithm is the Mathworks MATLAB [Mat15] implementation of a support vector
machine. The pre-set “fine Gaussian SVM” was chosen and all kernel parameters set to their default values.
As multi-class method the One-vs-All strategy was selected. The chosen SVM uses Error Correcting Output
Codes (ECOC) to transform the multi-class problem into multiple two-class problems resulting in the training
of multiple SVMs instead of a single one.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Selection Strategies</title>
        <p>Four different training scenarios were implemented. The first is used as a reference the other three are the
comparison between active and passive learning:
All at Once uses all available training samples to get the best possible performance. This value can be seen as
a reference to which the other strategies are compared.</p>
        <p>Random sampling was implemented by choosing the next training samples at random and represents the
passive learning approach.</p>
        <p>Uncertainty sampling represents an active learning approach and employs the strategy of the same name
[LC94]. The certainty measure used is the estimated posterior probability which is included in the MATLAB
default implementation.</p>
        <p>Query by committee is a different active learning approach originally introduced in [SOS92]. We used a
committee size of 5 and vote entropy as disagreement measure. It selects the next query sample x as
argmax −
x</p>
        <p>X voteC(y, x)
y
|C|
log
voteC(y, x)
|C|
where voteC(y, x) = Pθ∈C 1{hθ(x)=y} is the number of “votes” that the committee C assigns to label y for
sample x.</p>
        <p>The latter three scenarios start their first training iteration with three samples per class. This is a requirement
by the SVM implementation to estimate the posterior probability. The batch size was chosen such that after 30
iterations all training samples were exhausted. This resulted in the following batch sizes: Abenberg: 6, Indian
Pines: 134, Pavia Centre: 7, Pavia Uni: 4, Vaihingen: 8. For reasons of computational costs the scenarios
“uncertainty sampling”and “query by committee” for the Indian Pines dataset were aborted after 4,000 training
samples were selected.
2.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>Accuracy Calculation</title>
        <p>The first step of evaluating one method is to split the samples randomly into a training (75%) and a test set
(25%). During the following training the evaluated selection strategy is allowed access to the feature data of the
training set. Only after the samples for the next iteration are selected the label information is provided to the
classification algorithm and the next iteration begins. The test set is never connected to the training process and
only used for calculating the performance after each iteration. The performance measure used in this paper is
the classification accuracy. This is the ratio of correct classified samples to total samples in the test set. Multiple
runs of the whole process are done to get statistically robust results.
2.5</p>
      </sec>
      <sec id="sec-2-5">
        <title>Area Under the Curve</title>
        <p>To test if the difference between the three iterative scenarios is statistical significant, the performance of each
execution was condensed into a single value. To achieve this the area under the learning curve was chosen
(learning curve: accuracy vs. number of training samples). The learning curves were matched to span the same
range of training samples. Then the trapezoid method was used to calculate the area.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Data</title>
      <p>This work uses one internal and four publicly available real world datasets. This section gives a short description
of them. For a visual impression of the data see Figure 1. It displays the data with overlayed ground truth. An
overview of the datasets after the preprocessing step is given in Table 1.
This dataset is not publicly available. It is an aerial image produced by a survey of Technische Universitaet
Muenchen over the Bavarian town of Abenberg in Germany. Each pixel has intensity information for 4 spectral
bands: infrared, red, green, and blue. For this work a subset of 1,000 by 1,000 pixel was chosen such that it
contains buildings, roads, woodlands, and open soil areas. The ground truth was manually created by this author
(8 classes: roof, tree, grass, soil, gravel, car, asphalt, water).
1 Contents of original dataset.</p>
      <p>2 Displayed is the final distribution after classes with fewer than 15 samples were removed.
This publicly available dataset is an aerial image of the Purdue University Agronomy farm north west of West
Lafayette, USA [BBL] and covers different vegetation types. Each pixel is a spectrum containing 200 channels
in the 400 to 2,500 nm range of the electromagnetic spectrum. Ground truth is available and contains 16 classes
(Alfalfa, Corn-notill, Corn-mintill, Corn, Grass-pasture, Grass-trees, Grass-pasture-mowed, Hay-windrowed,
Oats, Soybeans-notill, Soybeans-mintill, Soybeans-clean, Wheat, Woods, Building-Grass-Tree-Drives,
StoneSteel-Towers).
3.3</p>
      <sec id="sec-3-1">
        <title>Pavia Centre &amp; University</title>
        <p>These two datasets are also publicly available [Bas11]. They consist of two aerial images of the city Pavia in
northern Italy. Contained are urban and vegetation areas with a geometric ground resolution of 1.3 meters. The
provided ground truth consists of 9 classes (Water, Trees, Meadows, Self-Blocking Bricks, Bare Soil, Asphalt,
Bitumen, Tiles, Shadows), but is mislabelled in the cited datafile (as of submission of this paper). The correct
labelling can be found in [Che06], page 494.
3.4</p>
      </sec>
      <sec id="sec-3-2">
        <title>Vaihingen</title>
        <p>4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>The Vaihingen dataset stems from the ISPRS Benchmark Test on Urban Object Detection and Reconstruction1.
It is publicly available and contains multiple aerial images of the town of Vaihingen in Baden-Wu¨rttemberg,
Germany. For each pixel there are intensity values for three channels: infrared, green, and blue. Height information
acquired by a LiDAR scanner is also available, but not used in this work. The provided ground truth has six
classes (Car, Tree, Low vegetation, Building, Impervious surfaces).</p>
      <p>1The Vaihingen data set was provided by the German Society for Photogrammetry, Remote Sensing and Geoinformation (DGPF)
[Cra10]: http://www.ifp.uni-stuttgart.de/dgpf/DKEP-Allg.html.
10−54
10−9
10−106
10−109
10−104
10−32
0.09
10−7
10−18
10−6</p>
    </sec>
    <sec id="sec-5">
      <title>Discussion</title>
      <p>Almost all strategies show significant differences for AUC performance. However, the magnitude of the difference
measured in correct classified percentage is less then ten percent points which is well within the observed standard
deviation. To summarize: the results show that random sampling has a, though small in magnitude, still
statistically significant advantage over active learning. This is in stark contrast to most literature. It needs to
be determined if this is a problem of the datasets, implementation, or choice of selection strategy. Following we
give a list of possible causes, suggest how to test for them, and offer potential solutions.
5.1</p>
      <sec id="sec-5-1">
        <title>Wrong Quality Metric</title>
        <p>Cause [RLSKB16] have shown that using a single performance measure can be misleading in an active learning
setting.</p>
        <p>Test To test this, other measurements such as F1-Score or area under the receiver operating characteristic curve
(AUROC) should be evaluated.</p>
        <p>Solution There is no metric that fits every problem. Instead the metric must be chosen to accommodate the
domain specific needs. In remote sensing the costs of acquiring more training samples is often higher than
the cost of false negatives. However some instances can be weighted opposite for example in the area of
Counter-IED (improvised explosive device) detection.
5.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>Uneven Class Distribution</title>
        <p>Cause Related to the problem of the wrong quality metric is the problem of uneven class distributions. This is
the case if one class is much more common or rarer than others. Random sampling replicates this distribution
so that the classification algorithm is trained on the same distribution as it is tested on. In the case of active
learning the distribution changes and doesn’t match the one from the test data. However it should be noted
that it is sometimes argued this bias is the advantage of active learning since it avoids querying redundant
samples from overrepresented classes [Mit90].
Test This can be tested by noting which samples are selected during the training process and observing their
change of class distribution directly. Also artificially reducing the presence of one class could lead to new
insights.</p>
        <p>Solution This problem can be alleviated by avoiding use of a classification algorithm that relies on the sample
distribution like a Maximum-Likelihood classifier [WMS14]. Instead a non-statistical classifier should be
chosen.</p>
        <p>Test In case of an SVM this could be observed by analysing how many support vectors are used. If the number
doesn’t increase with more training samples the generalization of the SVM is good. The effect of overlapping
classes can be investigated in detail by using specifically generated synthetic datasets or comparing two easily
separable classes versus two difficult to separate classes in a two-class setting.</p>
        <p>Solution To increase the separability a pre-processing step with feature extraction needs to be introduced.</p>
        <p>However it remains to be seen if this is an advantage for active learning or just an increase in overall
accuracy for both active and passive learning.
5.4</p>
      </sec>
      <sec id="sec-5-3">
        <title>Too Many Samples Per Iteration</title>
        <p>Cause The used uncertainty sampling method is based on the estimated posterior probability. To get a good
estimate at least three samples per class are needed. Because of this large initial training size the SVM
has very good performance from the beginning and shows only very small improvements for the rest of the
training so that it is hard to improve by active learning methods. Furthermore for batch sizes with multiple
samples the redundant information contained in one batch increases.</p>
        <p>Test Observe the classification accuracy of the SVM when initially trained with fewer samples per class. Using
smaller batch sizes to reduce the amount of redundant information that is selected in each iteration, should
increase the performance.</p>
        <p>Solution Use the distance to the hyperplane instead of the estimated posterior probability for the uncertainty
sampling method. This alleviates the need for multiple initial training samples per class. The redundant
information in one batch can be reduced by adding a second decision criterion like maximising the distance
between selected samples in feature space (e.g. density weighted active learning or a diversity criterion
[BP09]).
5.5</p>
      </sec>
      <sec id="sec-5-4">
        <title>Using Only Label Information</title>
        <p>Cause The presented variant of uncertainty sampling selects samples only based on the state of the learning
algorithm. Therefore only information based on the labels of the data is used and information gained from
the unlabelled data itself is not utilized.</p>
        <p>Solution Applying methods from semi- and unsupervised learning can be beneficial and lead to strategies such
as cluster based and hierarchical active learning [LC04], [SOM+12].
[And76]</p>
        <p>J. R. Anderson. A Land Use and Land Cover Classification System for Use with Remote Sensor
Data. Geological Survey professional paper. U.S. Government Printing Office, 1976. URL: https:
//books.google.de/books?id=dE-ToP4UpSIC.</p>
        <p>Basque University. Pavia centre and university: Hyperspectral remote sensing scenes, 2011. URL:
http://www.ehu.eus/ccwintco/index.php?title=Hyperspectral_Remote_Sensing_Scenes#
Pavia_Centre_and_University.
[BP09]
[Cra10]
[DJ00]
[FM04]
[LC94]
[LC04]
[Mat15]
[Mit90]
[Sch12]
[SOS92]
[Tri14]
H. S. Seung, M. Opper, and H. Sompolinsky. Query by committee. In Computational Learning
Theory, pages 287–294. ACM, 1992. doi:10.1145/130385.130417.</p>
        <p>Trimble Navigation Limited. ecognition developer, 2014.
[WMS14]</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>[Che06] Marion F. Baumgardner</surname>
          </string-name>
          , Larry L.
          <string-name>
            <surname>Biehl</surname>
            , and
            <given-names>David A.</given-names>
          </string-name>
          <string-name>
            <surname>Landgrebe</surname>
          </string-name>
          .
          <article-title>220 band aviris hyperspectral image data set: June 12, 1992 indian pine test site 3</article-title>
          . URL: https://purr.purdue.edu/ publications/1947/1, doi:10.4231/R7RX991C.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <source>In International Geoscience and Remote Sensing Symposium</source>
          , pages
          <fpage>III</fpage>
          -693
          <string-name>
            <surname>-</surname>
          </string-name>
          III-696, Piscataway, NJ,
          <year>2009</year>
          . IEEE. doi:
          <volume>10</volume>
          .1109/IGARSS.
          <year>2009</year>
          .
          <volume>5417857</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>C. H.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Signal and Image Processing for Remote Sensing</article-title>
          . CRC Press,
          <year>2006</year>
          . URL: https: //books.google.de/books?id=9CiW0hgiwKYC.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>PFG</given-names>
            <surname>Photogrammetrie</surname>
          </string-name>
          , Fernerkundung, Geoinformation,
          <year>2010</year>
          (2):
          <fpage>73</fpage>
          -
          <lpage>82</lpage>
          ,
          <year>2010</year>
          . URL: http://dx.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          doi.org/10.1127/
          <fpage>1432</fpage>
          -
          <lpage>8364</lpage>
          /
          <year>2010</year>
          /0041.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          Antonio Di Gregorio and
          <string-name>
            <given-names>Louisa J. M.</given-names>
            <surname>Jansen</surname>
          </string-name>
          .
          <article-title>Land cover classification systems (LCCS): Classification concepts and user manual</article-title>
          .
          <source>Food and Agriculture Organization of the United Nations</source>
          , Rome,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Giles M. Foody</surname>
            and
            <given-names>Ajay</given-names>
          </string-name>
          <string-name>
            <surname>Mathur</surname>
          </string-name>
          .
          <article-title>Toward intelligent training of supervised image classifications: directing training data acquisition for svm classification</article-title>
          .
          <source>Remote Sensing of Environment</source>
          ,
          <volume>93</volume>
          (
          <issue>1- 2</issue>
          ):
          <fpage>107</fpage>
          -
          <lpage>117</lpage>
          ,
          <year>2004</year>
          . doi:
          <volume>10</volume>
          .1016/j.rse.
          <year>2004</year>
          .
          <volume>06</volume>
          .017.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>David D.</given-names>
            <surname>Lewis</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jason</given-names>
            <surname>Catlett</surname>
          </string-name>
          .
          <article-title>Heterogeneous uncertainty sampling for supervised learning</article-title>
          .
          <source>In International Conference on Machine Learning</source>
          , pages
          <fpage>148</fpage>
          -
          <lpage>156</lpage>
          . Morgan Kaufmann,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Sanghoon</given-names>
            <surname>Lee and M. M. Crawford</surname>
          </string-name>
          .
          <article-title>Hierarchical clustering approach for unsupervised image classification of hyperspectral data</article-title>
          .
          <source>In International Geoscience and Remote Sensing Symposium: Proceedings</source>
          , pages
          <fpage>941</fpage>
          -
          <lpage>944</lpage>
          ,
          <year>2004</year>
          . doi:
          <volume>10</volume>
          .1109/IGARSS.
          <year>2004</year>
          .
          <volume>1368563</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>MathWorks. Matlab</surname>
          </string-name>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Tom M.</given-names>
            <surname>Mitchell</surname>
          </string-name>
          .
          <article-title>The need for biases in learning generalizations</article-title>
          . In ?, editor,
          <source>Readings in Machine Learning</source>
          . Morgan Kaufmann,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>[RLSKB16] Maria</surname>
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Ramirez-Loaiza</surname>
            , Manali Sharma, Geet Kumar, and
            <given-names>Mustafa</given-names>
          </string-name>
          <string-name>
            <surname>Bilgic</surname>
          </string-name>
          .
          <article-title>Active learning: An empirical study of common baselines</article-title>
          .
          <source>Data Mining and Knowledge Discovery</source>
          ,
          <year>2016</year>
          . doi:
          <volume>10</volume>
          .1007/ s10618-016-0469-7.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Konrad</given-names>
            <surname>Schindler</surname>
          </string-name>
          .
          <article-title>An overview and comparison of smooth labeling methods for land-cover classification</article-title>
          .
          <source>IEEE Transactions on Geoscience and Remote Sensing</source>
          ,
          <volume>50</volume>
          (
          <issue>11</issue>
          ):
          <fpage>4534</fpage>
          -
          <lpage>4545</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <source>doi:10</source>
          .1109/TGRS.
          <year>2012</year>
          .
          <volume>2192741</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>