<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-014-18-3011</article-id>
      <article-id pub-id-type="publisher-id">29211</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>I.7.5 - Document Capture</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>An Evaluation Technique for Binarization Algorithms</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Stathis</surname>
            <given-names>Pavlos</given-names>
          </name>
          <email xlink:type="simple">pstathis@ee.duth.gr</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Kavallieratou</surname>
            <given-names>Ergina</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Papamarkos</surname>
            <given-names>Nikos</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Democritus University of Thrace, Xanthi, Greece</addr-line>
        <institution>Democritus University of Thrace</institution>
        <addr-line content-type="city">Xanthi</addr-line>
        <country>Greece</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">University of the Aegean, Karlovasi, Greece</addr-line>
        <institution>University of the Aegean</institution>
        <addr-line content-type="city">Karlovasi</addr-line>
        <country>Greece</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Pavlos Stathis (<email xlink:type="simple">pstathis@ee.duth.gr</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2008</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>10</month>
        <year>2008</year>
      </pub-date>
      <volume>14</volume>
      <issue>18</issue>
      <fpage>3011</fpage>
      <lpage>3030</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/ED4891EB-0437-5296-8EFB-B7C60603D634">ED4891EB-0437-5296-8EFB-B7C60603D634</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7000505">7000505</uri>
      <permissions>
        <copyright-statement>Pavlos Stathis, Ergina Kavallieratou, Nikos Papamarkos</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Document binarization is an active research area for many years. The choice of the most appropriate binarization algorithm for each case proved to be a very difficult procedure itself. In this paper, we propose a new technique for the validation of document binarization algorithms. Our method is simple in its implementation and can be performed on any binarization algorithm since it doesnt require anything more than the binarization stage. As a demonstration of the proposed technique, we use the case of degraded historical documents. Then we apply the proposed technique to 30 binarization algorithms. Experimental results and conclusions are presented.</p>
      </abstract>
    </article-meta>
  </front>
</article>
