<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "https://jats.nlm.nih.gov/nlm-dtd/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="3.0" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">ISPRS-Archives</journal-id>
<journal-title-group>
<journal-title>The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</journal-title>
<abbrev-journal-title abbrev-type="publisher">ISPRS-Archives</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2194-9034</issn>
<publisher><publisher-name>Copernicus Publications</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5194/isprsarchives-XL-3-61-2014</article-id>
<title-group>
<article-title>Learning image descriptors for matching based on Haar features</article-title>
</title-group>
<contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Chen</surname>
<given-names>L.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Rottensteiner</surname>
<given-names>F.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Heipke</surname>
<given-names>C.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group><aff id="aff1">
<label>1</label>
<addr-line>Institute of Photogrammetry and GeoInformation, Leibniz Universität Hannover, Hanover, Germany</addr-line>
</aff>
<pub-date pub-type="epub">
<day>11</day>
<month>08</month>
<year>2014</year>
</pub-date>
<volume>XL-3</volume>
<fpage>61</fpage>
<lpage>66</lpage>
<permissions>
<copyright-statement>Copyright: &#x000a9; 2014 L. Chen et al.</copyright-statement>
<copyright-year>2014</copyright-year>
<license license-type="open-access">
<license-p>This work is licensed under the Creative Commons Attribution 3.0 Unported License. To view a copy of this licence, visit <ext-link ext-link-type="uri"  xlink:href="https://creativecommons.org/licenses/by/3.0/">https://creativecommons.org/licenses/by/3.0/</ext-link></license-p>
</license>
</permissions>
<self-uri xlink:href="https://isprs-archives.copernicus.org/articles/XL-3/61/2014/isprs-archives-XL-3-61-2014.html">This article is available from https://isprs-archives.copernicus.org/articles/XL-3/61/2014/isprs-archives-XL-3-61-2014.html</self-uri>
<self-uri xlink:href="https://isprs-archives.copernicus.org/articles/XL-3/61/2014/isprs-archives-XL-3-61-2014.pdf">The full text article is available as a PDF file from https://isprs-archives.copernicus.org/articles/XL-3/61/2014/isprs-archives-XL-3-61-2014.pdf</self-uri>
<abstract>
<p>This paper presents a new and fast binary descriptor for image matching learned from Haar features. The training uses AdaBoost; the
weak learner is built on response function for Haar features, instead of histogram-type features. The weak classifier is selected from a
large weak feature pool. The selected features have different feature type, scale and position within the patch, having correspond
threshold value for weak classifiers. Besides, to cope with the fact in real matching that dissimilar matches are encountered much
more often than similar matches, cascaded classifiers are trained to motivate training algorithms see a large number of dissimilar
patch pairs. The final trained output are binary value vectors, namely descriptors, with corresponding weight and perceptron
threshold for a strong classifier in every stage. We present preliminary results which serve as a proof-of-concept of the work.</p>
</abstract>
<counts><page-count count="6"/></counts>
</article-meta>
</front>
<body/>
<back>
</back>
</article>