Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest
Identifieur interne : 000039 ( Hal/Corpus ); précédent : 000038; suivant : 000040Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest
Auteurs : Bart Lamiroy ; Daniel Lopresti ; Tao SunSource :
English descriptors
Abstract
This contest aims to provide a metric giving indications on the influence of individual document analysis stages to overall end-to-end applications. Contestants are provided with a full, working pipeline which operates on a page image to extract useful information. The pipeline is built with clearly identified analysis stages (e.g. binarization, skew detection, layout analysis, OCR ...) that have a formalized input and output. Contestants are invited to contribute their own algorithms as an alternative to one or more of the initially provided stages. The evaluation measures the overall impact of the contributed algorithm on the final (end-of-pipeline) output.
Url:
DOI: 10.1109/ICDAR.2011.302
Links to Exploration step
Hal:inria-00608371Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest</title>
<author><name sortKey="Lamiroy, Bart" sort="Lamiroy, Bart" uniqKey="Lamiroy B" first="Bart" last="Lamiroy">Bart Lamiroy</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-119680" status="OLD"><orgName>Querying Graphics through Analysis and Recognition</orgName>
<orgName type="acronym">QGAR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://qgar.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Lopresti, Daniel" sort="Lopresti, Daniel" uniqKey="Lopresti D" first="Daniel" last="Lopresti">Daniel Lopresti</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-21735" status="VALID"><orgName>Computer Science & Engineering Department</orgName>
<orgName type="acronym">CSE</orgName>
<desc><address><addrLine>P.C. Rossin College of Engineering & Applied Science - Computer Science and Engineering - Packard Laboratory, 19 Memorial Drive West - Lehigh University, Bethlehem PA 18015</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.cse.lehigh.edu/</ref>
</desc>
<listRelation><relation active="#struct-301550" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301550" type="direct"><org type="institution" xml:id="struct-301550" status="VALID"><orgName>Lehigh University, Bethlehem, USA</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Sun, Tao" sort="Sun, Tao" uniqKey="Sun T" first="Tao" last="Sun">Tao Sun</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-21735" status="VALID"><orgName>Computer Science & Engineering Department</orgName>
<orgName type="acronym">CSE</orgName>
<desc><address><addrLine>P.C. Rossin College of Engineering & Applied Science - Computer Science and Engineering - Packard Laboratory, 19 Memorial Drive West - Lehigh University, Bethlehem PA 18015</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.cse.lehigh.edu/</ref>
</desc>
<listRelation><relation active="#struct-301550" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301550" type="direct"><org type="institution" xml:id="struct-301550" status="VALID"><orgName>Lehigh University, Bethlehem, USA</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00608371</idno>
<idno type="halId">inria-00608371</idno>
<idno type="halUri">https://hal.inria.fr/inria-00608371</idno>
<idno type="url">https://hal.inria.fr/inria-00608371</idno>
<idno type="doi">10.1109/ICDAR.2011.302</idno>
<date when="2011-09-18">2011-09-18</date>
<idno type="wicri:Area/Hal/Corpus">000039</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest</title>
<author><name sortKey="Lamiroy, Bart" sort="Lamiroy, Bart" uniqKey="Lamiroy B" first="Bart" last="Lamiroy">Bart Lamiroy</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-119680" status="OLD"><orgName>Querying Graphics through Analysis and Recognition</orgName>
<orgName type="acronym">QGAR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://qgar.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Lopresti, Daniel" sort="Lopresti, Daniel" uniqKey="Lopresti D" first="Daniel" last="Lopresti">Daniel Lopresti</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-21735" status="VALID"><orgName>Computer Science & Engineering Department</orgName>
<orgName type="acronym">CSE</orgName>
<desc><address><addrLine>P.C. Rossin College of Engineering & Applied Science - Computer Science and Engineering - Packard Laboratory, 19 Memorial Drive West - Lehigh University, Bethlehem PA 18015</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.cse.lehigh.edu/</ref>
</desc>
<listRelation><relation active="#struct-301550" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301550" type="direct"><org type="institution" xml:id="struct-301550" status="VALID"><orgName>Lehigh University, Bethlehem, USA</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Sun, Tao" sort="Sun, Tao" uniqKey="Sun T" first="Tao" last="Sun">Tao Sun</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-21735" status="VALID"><orgName>Computer Science & Engineering Department</orgName>
<orgName type="acronym">CSE</orgName>
<desc><address><addrLine>P.C. Rossin College of Engineering & Applied Science - Computer Science and Engineering - Packard Laboratory, 19 Memorial Drive West - Lehigh University, Bethlehem PA 18015</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.cse.lehigh.edu/</ref>
</desc>
<listRelation><relation active="#struct-301550" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301550" type="direct"><org type="institution" xml:id="struct-301550" status="VALID"><orgName>Lehigh University, Bethlehem, USA</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1109/ICDAR.2011.302</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>benchmark</term>
<term>document analysis</term>
<term>performance evaluation</term>
<term>web services</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This contest aims to provide a metric giving indications on the influence of individual document analysis stages to overall end-to-end applications. Contestants are provided with a full, working pipeline which operates on a page image to extract useful information. The pipeline is built with clearly identified analysis stages (e.g. binarization, skew detection, layout analysis, OCR ...) that have a formalized input and output. Contestants are invited to contribute their own algorithms as an alternative to one or more of the initially provided stages. The evaluation measures the overall impact of the contributed algorithm on the final (end-of-pipeline) output.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest</title>
<author role="aut"><persName><forename type="first">Bart</forename>
<surname>Lamiroy</surname>
</persName>
<email>Bart.Lamiroy@loria.fr</email>
<idno type="idhal">bart-lamiroy</idno>
<idno type="halauthor">370896</idno>
<idno type="ResearcherId">http://www.researcherid.com/rid/A-7746-2010</idno>
<idno type="IdRef">http://www.idref.fr/111726980</idno>
<idno type="ORCID">http://orcid.org/0000-0003-0871-0149</idno>
<affiliation ref="#struct-119680"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Daniel</forename>
<surname>Lopresti</surname>
</persName>
<email>lopresti@cse.lehigh.edu</email>
<idno type="halauthor">625310</idno>
<orgName ref="#struct-301550"></orgName>
<affiliation ref="#struct-21735"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Tao</forename>
<surname>Sun</surname>
</persName>
<email></email>
<idno type="halauthor">625311</idno>
<orgName ref="#struct-301550"></orgName>
<affiliation ref="#struct-21735"></affiliation>
</author>
<editor role="depositor"><persName><forename>Bart</forename>
<surname>Lamiroy</surname>
</persName>
<email>Bart.Lamiroy@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2011-07-12 20:53:43</date>
<date type="whenWritten">2011-07-01</date>
<date type="whenModified">2016-05-19 01:04:21</date>
<date type="whenReleased">2011-07-13 09:08:56</date>
<date type="whenProduced">2011-09-18</date>
<date type="whenEndEmbargoed">2011-07-12</date>
<ref type="file" target="https://hal.inria.fr/inria-00608371/document"><date notBefore="2011-07-12"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.inria.fr/inria-00608371/file/ICDAR_2011_ContestReport.pdf"><date notBefore="2011-07-12"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="113383"><persName><forename>Bart</forename>
<surname>Lamiroy</surname>
</persName>
<email>Bart.Lamiroy@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00608371</idno>
<idno type="halUri">https://hal.inria.fr/inria-00608371</idno>
<idno type="halBibtex">lamiroy:inria-00608371</idno>
<idno type="halRefHtml">11th International Conference on Document Analysis and Recognition - ICDAR 2011, Sep 2011, Beijing, China. IEEE Computer Society, 2011, <10.1109/ICDAR.2011.302></idno>
<idno type="halRef">11th International Conference on Document Analysis and Recognition - ICDAR 2011, Sep 2011, Beijing, China. IEEE Computer Society, 2011, <10.1109/ICDAR.2011.302></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-TALC" p="LORIA">Traitement automatique des langues et des connaissances</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
</seriesStmt>
<notesStmt><note type="commentary">ISBN: 978-1-4577-1350-7</note>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest</title>
<author role="aut"><persName><forename type="first">Bart</forename>
<surname>Lamiroy</surname>
</persName>
<email>Bart.Lamiroy@loria.fr</email>
<idno type="idHal">bart-lamiroy</idno>
<idno type="halAuthorId">370896</idno>
<idno type="ResearcherId">http://www.researcherid.com/rid/A-7746-2010</idno>
<idno type="IdRef">http://www.idref.fr/111726980</idno>
<idno type="ORCID">http://orcid.org/0000-0003-0871-0149</idno>
<affiliation ref="#struct-119680"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Daniel</forename>
<surname>Lopresti</surname>
</persName>
<email>lopresti@cse.lehigh.edu</email>
<idno type="halAuthorId">625310</idno>
<orgName ref="#struct-301550"></orgName>
<affiliation ref="#struct-21735"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Tao</forename>
<surname>Sun</surname>
</persName>
<idno type="halAuthorId">625311</idno>
<orgName ref="#struct-301550"></orgName>
<affiliation ref="#struct-21735"></affiliation>
</author>
</analytic>
<monogr><meeting><title>11th International Conference on Document Analysis and Recognition - ICDAR 2011</title>
<date type="start">2011-09-18</date>
<date type="end">2011-09-21</date>
<settlement>Beijing</settlement>
<country key="CN">China</country>
</meeting>
<respStmt><resp>conferenceOrganizer</resp>
<name>International Association for Pattern Recognition</name>
</respStmt>
<imprint><publisher>IEEE Computer Society</publisher>
<date type="datePub">2011-09-18</date>
</imprint>
</monogr>
<idno type="doi">10.1109/ICDAR.2011.302</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">benchmark</term>
<term xml:lang="en">web services</term>
<term xml:lang="en">document analysis</term>
<term xml:lang="en">performance evaluation</term>
</keywords>
<classCode scheme="halDomain" n="info.info-cv">Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">This contest aims to provide a metric giving indications on the influence of individual document analysis stages to overall end-to-end applications. Contestants are provided with a full, working pipeline which operates on a page image to extract useful information. The pipeline is built with clearly identified analysis stages (e.g. binarization, skew detection, layout analysis, OCR ...) that have a formalized input and output. Contestants are invited to contribute their own algorithms as an alternative to one or more of the initially provided stages. The evaluation measures the overall impact of the contributed algorithm on the final (end-of-pipeline) output.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000039 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 000039 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= Hal |étape= Corpus |type= RBID |clé= Hal:inria-00608371 |texte= Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest }}
![]() | This area was generated with Dilib version V0.6.32. | ![]() |