A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring
Identifieur interne : 000B42 ( Istex/Corpus ); précédent : 000B41; suivant : 000B43A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring
Auteurs : Djamel Gaceb ; Véronique Eglin ; Frank Lebourgeois ; Hubert EmptozSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
Abstract
Abstract: An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.
Url:
DOI: 10.1007/978-3-540-74260-9_113
Links to Exploration step
ISTEX:CED316FA7D2BB955090D4644D37E7BF99536B208Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title><author><name sortKey="Gaceb, Djamel" sort="Gaceb, Djamel" uniqKey="Gaceb D" first="Djamel" last="Gaceb">Djamel Gaceb</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: djamel.gaceb1@insa-lyon.fr</mods:affiliation></affiliation></author><author><name sortKey="Eglin, Veronique" sort="Eglin, Veronique" uniqKey="Eglin V" first="Véronique" last="Eglin">Véronique Eglin</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: veronique.eglin@insa-lyon.fr</mods:affiliation></affiliation></author><author><name sortKey="Lebourgeois, Frank" sort="Lebourgeois, Frank" uniqKey="Lebourgeois F" first="Frank" last="Lebourgeois">Frank Lebourgeois</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: flebourg@rfv.insa-lyon.fr</mods:affiliation></affiliation></author><author><name sortKey="Emptoz, Hubert" sort="Emptoz, Hubert" uniqKey="Emptoz H" first="Hubert" last="Emptoz">Hubert Emptoz</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: hubert.emptoz@insa-lyon.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CED316FA7D2BB955090D4644D37E7BF99536B208</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-74260-9_113</idno><idno type="url">https://api.istex.fr/document/CED316FA7D2BB955090D4644D37E7BF99536B208/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000B42</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title><author><name sortKey="Gaceb, Djamel" sort="Gaceb, Djamel" uniqKey="Gaceb D" first="Djamel" last="Gaceb">Djamel Gaceb</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: djamel.gaceb1@insa-lyon.fr</mods:affiliation></affiliation></author><author><name sortKey="Eglin, Veronique" sort="Eglin, Veronique" uniqKey="Eglin V" first="Véronique" last="Eglin">Véronique Eglin</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: veronique.eglin@insa-lyon.fr</mods:affiliation></affiliation></author><author><name sortKey="Lebourgeois, Frank" sort="Lebourgeois, Frank" uniqKey="Lebourgeois F" first="Frank" last="Lebourgeois">Frank Lebourgeois</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: flebourg@rfv.insa-lyon.fr</mods:affiliation></affiliation></author><author><name sortKey="Emptoz, Hubert" sort="Emptoz, Hubert" uniqKey="Emptoz H" first="Hubert" last="Emptoz">Hubert Emptoz</name><affiliation><mods:affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: hubert.emptoz@insa-lyon.fr</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2007</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">CED316FA7D2BB955090D4644D37E7BF99536B208</idno><idno type="DOI">10.1007/978-3-540-74260-9_113</idno><idno type="ChapterID">113</idno><idno type="ChapterID">Chap113</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Djamel Gaceb</name><affiliations><json:string>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</json:string><json:string>E-mail: djamel.gaceb1@insa-lyon.fr</json:string></affiliations></json:item><json:item><name>Véronique Eglin</name><affiliations><json:string>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</json:string><json:string>E-mail: veronique.eglin@insa-lyon.fr</json:string></affiliations></json:item><json:item><name>Frank Lebourgeois</name><affiliations><json:string>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</json:string><json:string>E-mail: flebourg@rfv.insa-lyon.fr</json:string></affiliations></json:item><json:item><name>Hubert Emptoz</name><affiliations><json:string>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</json:string><json:string>E-mail: hubert.emptoz@insa-lyon.fr</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.</abstract><qualityIndicators><score>5.545</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>929</abstractCharCount><pdfWordCount>3733</pdfWordCount><pdfCharCount>21846</pdfCharCount><pdfPageCount>13</pdfPageCount><abstractWordCount>151</abstractWordCount></qualityIndicators><title>A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title><genre.original><json:string>OriginalPaper</json:string></genre.original><chapterId><json:string>113</json:string><json:string>Chap113</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>David Hutchison</name></json:item><json:item><name>Takeo Kanade</name></json:item><json:item><name>Josef Kittler</name></json:item><json:item><name>Jon M. Kleinberg</name></json:item><json:item><name>Friedemann Mattern</name></json:item><json:item><name>John C. Mitchell</name></json:item><json:item><name>Moni Naor</name></json:item><json:item><name>Oscar Nierstrasz</name></json:item><json:item><name>C. Pandu Rangan</name></json:item><json:item><name>Bernhard Steffen</name></json:item><json:item><name>Madhu Sudan</name></json:item><json:item><name>Demetri Terzopoulos</name></json:item><json:item><name>Doug Tygar</name></json:item><json:item><name>Moshe Y. Vardi</name></json:item><json:item><name>Gerhard Weikum</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2007</copyrightDate></serie><host><editor><json:item><name>Mohamed Kamel</name></json:item><json:item><name>Aurélio Campilho</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Image Processing and Computer Vision</value></json:item><json:item><value>Pattern Recognition</value></json:item><json:item><value>Biometrics</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Computer Graphics</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item></subject><isbn><json:string>978-3-540-74258-6</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Image Analysis and Recognition</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>978-3-540-74260-9</json:string></bookId><volume>4633</volume><pages><last>1288</last><first>1276</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-540-74260-9</json:string></eisbn><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-74260-9</json:string></doi></host><publicationDate>2007</publicationDate><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-74260-9_113</json:string></doi><id>CED316FA7D2BB955090D4644D37E7BF99536B208</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/CED316FA7D2BB955090D4644D37E7BF99536B208/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/CED316FA7D2BB955090D4644D37E7BF99536B208/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/CED316FA7D2BB955090D4644D37E7BF99536B208/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2007</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title><author><persName><forename type="first">Djamel</forename><surname>Gaceb</surname></persName><email>djamel.gaceb1@insa-lyon.fr</email><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</affiliation></author><author><persName><forename type="first">Véronique</forename><surname>Eglin</surname></persName><email>veronique.eglin@insa-lyon.fr</email><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</affiliation></author><author><persName><forename type="first">Frank</forename><surname>Lebourgeois</surname></persName><email>flebourg@rfv.insa-lyon.fr</email><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</affiliation></author><author><persName><forename type="first">Hubert</forename><surname>Emptoz</surname></persName><email>hubert.emptoz@insa-lyon.fr</email><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex,</affiliation></author></analytic><monogr><title level="m">Image Analysis and Recognition</title><title level="m" type="sub">4th International Conference, ICIAR 2007, Montreal, Canada, August 22-24, 2007. Proceedings</title><idno type="pISBN">978-3-540-74258-6</idno><idno type="eISBN">978-3-540-74260-9</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-540-74260-9</idno><idno type="BookID">978-3-540-74260-9</idno><idno type="BookTitleID">151905</idno><idno type="BookSequenceNumber">4633</idno><idno type="BookVolumeNumber">4633</idno><idno type="BookChapterCount">115</idno><editor><persName><forename type="first">Mohamed</forename><surname>Kamel</surname></persName></editor><editor><persName><forename type="first">Aurélio</forename><surname>Campilho</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2007"></date><biblScope unit="volume">4633</biblScope><biblScope unit="page" from="1276">1276</biblScope><biblScope unit="page" to="1288">1288</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName></editor><biblScope><date>2007</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><idno type="istex">CED316FA7D2BB955090D4644D37E7BF99536B208</idno><idno type="DOI">10.1007/978-3-540-74260-9_113</idno><idno type="ChapterID">113</idno><idno type="ChapterID">Chap113</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2007</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I22021</label><label>I2203X</label><label>I22040</label><label>I21017</label><label>I22013</label><label>I16021</label><item><term>Computer Science</term></item><item><term>Image Processing and Computer Vision</term></item><item><term>Pattern Recognition</term></item><item><term>Biometrics</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Computer Graphics</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2007">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/CED316FA7D2BB955090D4644D37E7BF99536B208/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-74260-9</BookID><BookTitle>Image Analysis and Recognition</BookTitle><BookSubTitle>4th International Conference, ICIAR 2007, Montreal, Canada, August 22-24, 2007. Proceedings</BookSubTitle><BookVolumeNumber>4633</BookVolumeNumber><BookSequenceNumber>4633</BookSequenceNumber><BookDOI>10.1007/978-3-540-74260-9</BookDOI><BookTitleID>151905</BookTitleID><BookPrintISBN>978-3-540-74258-6</BookPrintISBN><BookElectronicISBN>978-3-540-74260-9</BookElectronicISBN><BookChapterCount>115</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I22021" Priority="1" Type="Secondary">Image Processing and Computer Vision</BookSubject><BookSubject Code="I2203X" Priority="2" Type="Secondary">Pattern Recognition</BookSubject><BookSubject Code="I22040" Priority="3" Type="Secondary">Biometrics</BookSubject><BookSubject Code="I21017" Priority="4" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I22013" Priority="5" Type="Secondary">Computer Graphics</BookSubject><BookSubject Code="I16021" Priority="6" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Mohamed</GivenName><FamilyName>Kamel</FamilyName></EditorName><Contact><Email>mkamel@uwaterloo.ca</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Aurélio</GivenName><FamilyName>Campilho</FamilyName></EditorName><Contact><Email>campilho@fe.up.pt</Email></Contact></Editor></EditorGroup></BookHeader><Part ID="Part13"><PartInfo TocLevels="0"><PartID>13</PartID><PartSequenceNumber>13</PartSequenceNumber><PartTitle>Applications</PartTitle><PartChapterCount>20</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Image Analysis and Recognition</BookTitle></PartContext></PartInfo><Chapter ID="Chap113" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>113</ChapterID><ChapterDOI>10.1007/978-3-540-74260-9_113</ChapterDOI><ChapterSequenceNumber>113</ChapterSequenceNumber><ChapterTitle Language="En">A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</ChapterTitle><ChapterFirstPage>1276</ChapterFirstPage><ChapterLastPage>1288</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>13</PartID><BookID>978-3-540-74260-9</BookID><BookTitle>Image Analysis and Recognition</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Djamel</GivenName><FamilyName>Gaceb</FamilyName></AuthorName><Contact><Email>djamel.gaceb1@insa-lyon.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Véronique</GivenName><FamilyName>Eglin</FamilyName></AuthorName><Contact><Email>veronique.eglin@insa-lyon.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Frank</GivenName><FamilyName>Lebourgeois</FamilyName></AuthorName><Contact><Email>flebourg@rfv.insa-lyon.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Hubert</GivenName><FamilyName>Emptoz</FamilyName></AuthorName><Contact><Email>hubert.emptoz@insa-lyon.fr</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</OrgName><OrgAddress><Country> </Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>Text localization</Keyword><Keyword>physical segmentation</Keyword><Keyword>real time processing</Keyword><Keyword>business documents processing</Keyword><Keyword>Graph coloring</Keyword></KeywordGroup></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title></titleInfo><name type="personal"><namePart type="given">Djamel</namePart><namePart type="family">Gaceb</namePart><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</affiliation><affiliation>E-mail: djamel.gaceb1@insa-lyon.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Véronique</namePart><namePart type="family">Eglin</namePart><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</affiliation><affiliation>E-mail: veronique.eglin@insa-lyon.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Frank</namePart><namePart type="family">Lebourgeois</namePart><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</affiliation><affiliation>E-mail: flebourg@rfv.insa-lyon.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Hubert</namePart><namePart type="family">Emptoz</namePart><affiliation>LIRIS INSA de Lyon – 20, av. Albert Einstein 69621 Villeurbanne Cedex</affiliation><affiliation>E-mail: hubert.emptoz@insa-lyon.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2007</dateIssued><copyrightDate encoding="w3cdtf">2007</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.</abstract><relatedItem type="host"><titleInfo><title>Image Analysis and Recognition</title><subTitle>4th International Conference, ICIAR 2007, Montreal, Canada, August 22-24, 2007. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Mohamed</namePart><namePart type="family">Kamel</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Aurélio</namePart><namePart type="family">Campilho</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I22021">Image Processing and Computer Vision</topic><topic authority="SpringerSubjectCodes" authorityURI="I2203X">Pattern Recognition</topic><topic authority="SpringerSubjectCodes" authorityURI="I22040">Biometrics</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic></subject><identifier type="DOI">10.1007/978-3-540-74260-9</identifier><identifier type="ISBN">978-3-540-74258-6</identifier><identifier type="eISBN">978-3-540-74260-9</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">151905</identifier><identifier type="BookID">978-3-540-74260-9</identifier><identifier type="BookChapterCount">115</identifier><identifier type="BookVolumeNumber">4633</identifier><identifier type="BookSequenceNumber">4633</identifier><identifier type="PartChapterCount">20</identifier><part><date>2007</date><detail type="part"><title>Applications</title></detail><detail type="volume"><number>4633</number><caption>vol.</caption></detail><extent unit="pages"><start>1276</start><end>1288</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><identifier type="istex">CED316FA7D2BB955090D4644D37E7BF99536B208</identifier><identifier type="DOI">10.1007/978-3-540-74260-9_113</identifier><identifier type="ChapterID">113</identifier><identifier type="ChapterID">Chap113</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2007</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></mods></metadata><enrichments><istex:refBibTEI uri="https://api.istex.fr/document/CED316FA7D2BB955090D4644D37E7BF99536B208/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">Object recognition in visually complex environments: an architecture for locating address blocks on mail pieces</title><author><persName><forename type="first">W</forename><surname>Ching-Huei</surname></persName></author><author><persName><forename type="first">P</forename><forename type="middle">W</forename><surname>Palumbo</surname></persName></author><author><persName><forename type="first">S</forename><forename type="middle">N</forename><surname>Srihari</surname></persName></author></analytic><monogr><title level="m">Pattern Recognition, 9th International Conference</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society Press</publisher><date type="published" when="1988"></date><biblScope unit="page" from="365" to="367"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b1"><analytic><title level="a" type="main">A multi-resolution approach to extract the address block on flat mail pieces</title><author><persName><forename type="first">C</forename><surname>Viard-Gaudin</surname></persName></author><author><persName><forename type="first">D</forename><surname>Barba</surname></persName></author></analytic><monogr><title level="m">ICASSP-91. International Conference</title><imprint><biblScope unit="page" from="2701" to="2704"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b2"><analytic><title level="a" type="main">Address block location on complex mail pieces</title><author><persName><forename type="first">B</forename><surname>Yu</surname></persName></author><author><persName><forename type="first">A</forename><forename type="middle">K</forename><surname>Jain</surname></persName></author><author><persName><forename type="first">M</forename><surname>Mohiuddin</surname></persName></author></analytic><monogr><title level="m">Document Analysis and Recognition. Fourth International Conference</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society Press</publisher><date type="published" when="1997"></date><biblScope unit="page" from="897" to="901"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Locating destination address block in Korean mail images</title><author><persName><forename type="first">S</forename><forename type="middle">H</forename><surname>Jeong</surname></persName></author><author><persName><forename type="first">S</forename><forename type="middle">I</forename><surname>Jang</surname></persName></author><author><persName><forename type="first">Y</forename><forename type="middle">S</forename><surname>Nam</surname></persName></author></analytic><monogr><title level="m">ICPR 2004. 17th International Conference</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society Press</publisher><date type="published" when="2004"></date><biblScope unit="page" from="387" to="390"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Postal envelope address block location by fractalbased approach</title><author><persName><forename type="first">L</forename><forename type="middle">F</forename><surname>Eiterer</surname></persName></author><author><persName><forename type="first">J</forename><surname>Facon</surname></persName></author><author><persName><forename type="first">D</forename><surname>Menoti</surname></persName></author></analytic><monogr><title level="m">Computer Graphics and Image Processing. 17th Brazilian Symposium</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society Press</publisher><date type="published" when="2004"></date><biblScope unit="page" from="90" to="97"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">A threshold selection method from grey-level histogram</title><author><persName><forename type="first">N</forename><surname>Otsu</surname></persName></author></analytic><monogr><title level="j">IEEE trans system, man and cybernetics</title><imprint><biblScope unit="volume">9</biblScope><biblScope unit="page" from="62" to="66"></biblScope><date type="published" when="1979"></date></imprint></monogr></biblStruct><biblStruct xml:id="b6"><analytic><title level="a" type="main">Adaptive Document Binarization</title><author><persName><forename type="first">J</forename><surname>Sauvola</surname></persName></author></analytic><monogr><title level="m">ICDAR'97</title><imprint><date type="published" when="1997"></date><biblScope unit="page" from="147" to="152"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b7"><analytic><title level="a" type="main">A Page Segmentation and Classification</title><author><persName><forename type="first">Z</forename><surname>Pavlidis</surname></persName></author><author><persName><forename type="first">J</forename><surname>Zhou</surname></persName></author></analytic><monogr><title level="j">CVGIP92</title><imprint><biblScope unit="volume">54</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="484" to="496"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images</title><author><persName><forename type="first">E</forename><surname>Regentova</surname></persName></author><author><persName><forename type="first">S</forename><surname>Latifi</surname></persName></author><author><persName><forename type="first">S</forename><surname>Deng</surname></persName></author><author><persName><forename type="first">D</forename><surname>Yao</surname></persName></author></analytic><monogr><title level="m">Pattern Analysis and Machine Intelligence</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society Press</publisher><biblScope unit="page" from="1039" to="1047"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b9"><analytic><title level="a" type="main">A fast multiresolution text-line and non text line structures extraction and discrimination scheme for document image analysis</title><author><persName><forename type="first">O</forename><surname>Déforges</surname></persName></author><author><persName><forename type="first">D</forename><surname>Barba</surname></persName></author></analytic><monogr><title level="m">ICPR 94</title><imprint><biblScope unit="page" from="34" to="138"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b10"><analytic><title level="a" type="main">Block selection: a method for segmenting a page image of various editing styles</title><author><persName><forename type="first">S.-Y</forename><surname>Wang</surname></persName></author><author><persName><forename type="first">T</forename><surname>Yagasaki</surname></persName></author></analytic><monogr><title level="m">ICDAR 1995. Proceedings of the Third International Conference</title><imprint><date type="published" when="1995"></date><biblScope unit="page" from="128" to="133"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b11"><analytic><title level="a" type="main">Line separation for complex document images using fuzzy runlength</title><author><persName><forename type="first">Z</forename><surname>Shi</surname></persName></author><author><persName><forename type="first">V</forename><surname>Govindaraju</surname></persName></author></analytic><monogr><title level="m">Document Image Analysis for Libraries</title><imprint><date type="published" when="2004"></date><biblScope unit="page" from="306" to="312"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b12"><analytic><title level="a" type="main">Page segmentation and classification utilising a bottom-up approach, Document Analysis and Recognition</title><author><persName><forename type="first">D</forename><surname>Drivas</surname></persName></author><author><persName><forename type="first">A</forename><surname>Amin</surname></persName></author></analytic><monogr><title level="m">ICDAR 1995. Proceedings of the Third International Conference</title><imprint><date type="published" when="1995"></date><biblScope unit="page" from="610" to="614"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b13"><analytic><title level="a" type="main">The b-chromatic number of power graphs</title><author><persName><forename type="first">B</forename><surname>Effantin</surname></persName></author><author><persName><forename type="first">H</forename><surname>Kheddouci</surname></persName></author></analytic><monogr><title level="j">Discrete Mathematics and Theoretical Computer Science (DMTCS)</title><imprint><biblScope unit="volume">6</biblScope><biblScope unit="page" from="45" to="54"></biblScope><date type="published" when="2003"></date></imprint></monogr></biblStruct><biblStruct xml:id="b14"><monogr><title level="m" type="main">A New Clustering Approach for Symbolic Data: Algorithms and Application to Healthcare Data, 22 éme journées bases de données avancées</title><author><persName><forename type="first">H</forename><surname>Elghazel</surname></persName></author><author><persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Hacid</surname></persName></author><author><persName><forename type="first">H</forename><surname>Khedddoucil</surname></persName></author><author><persName><forename type="first">A</forename><surname>Dussauchoy</surname></persName></author><imprint><date type="published" when="2006"></date><pubPlace>Lille</pubPlace></imprint></monogr><note>Actes. On formal proceeding (Octobre 17</note></biblStruct><biblStruct xml:id="b15"><analytic><title level="a" type="main">On approximating the b-chromatic number</title><author><persName><forename type="first">S</forename><surname>Corteel</surname></persName></author><author><persName><forename type="first">M</forename><surname>Valencia-Pabon</surname></persName></author><author><persName><forename type="first">J.-C</forename><surname>Vera</surname></persName></author></analytic><monogr><title level="j">Discrete Applied Mathematics archive</title><imprint><biblScope unit="volume">146</biblScope><biblScope unit="page" from="0166" to="218"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b16"><analytic><title level="a" type="main">A distributed algorithm for a b-coloring of a graph</title><author><persName><forename type="first">B</forename><surname>Effantin</surname></persName></author><author><persName><forename type="first">H</forename><surname>Kheddouci</surname></persName></author><author><persName><forename type="first">L</forename><forename type="middle">T</forename><surname>Yang</surname></persName></author><author><persName><forename type="first">Di</forename><surname>Martino</surname></persName></author><author><persName><forename type="first">B</forename><surname>Zima</surname></persName></author><author><persName><forename type="first">H</forename><forename type="middle">P</forename><surname>Dongarra</surname></persName></author><author><persName><forename type="first">J</forename></persName></author></analytic><monogr><title level="m">ISPA 2006</title><meeting><address><addrLine>Heidelberg</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="2006"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B42 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000B42 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:CED316FA7D2BB955090D4644D37E7BF99536B208
|texte= A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring
}}
| This area was generated with Dilib version V0.6.32. |  |