Address block localization based on graph theory
Identifieur interne :
000514 ( PascalFrancis/Curation );
précédent :
000513;
suivant :
000515
Address block localization based on graph theory
Auteurs : Djamel Gaceb [
France] ;
Véronique Eglin [
France] ;
Frank Lebourgeois [
France] ;
Hubert Emptoz [
France]
Source :
-
Proceedings electronic imaging science and technology
RBID : Pascal:08-0399976
Descripteurs français
- Pascal (Inist)
- Théorie graphe,
Temps calcul,
Localisation,
Reconnaissance optique caractère,
Evaluation performance,
Architecture modulaire,
Coloration graphe,
Cohérence,
Reconnaissance forme,
0130C,
4230S.
English descriptors
Abstract
An efficient mail sorting system is mainly based on an accurate optical recognition of the addresses on the envelopes. However, the localizing 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. Currently, a good localizing step leads to a better recognition rate. The limit of current methods is mainly caused by modular linear architectures used for ABL: their performances greatly depend on each independent module performance. We are presenting in this paper a new approach for ABL based on a pyramidal data organization and on a hierarchical graph coloring for classification process. This new approach presents the advantage to guarantee a good coherence between different modules and reduces both the computation time and the rejection rate. The proposed method gives a very satisfying rate of 98% of good locations on a set of 750 envelope images.
| pA |
| A05 | | | | @2 6815 |
|---|
| A08 | 01 | 1 | ENG | @1 Address block localization based on graph theory |
|---|
| A09 | 01 | 1 | ENG | @1 Document recognition and retrieval XV : 29-31 January 2008, San Jose, California, USA |
|---|
| A11 | 01 | 1 | | @1 GACEB (Djamel) |
|---|
| A11 | 02 | 1 | | @1 EGLIN (Véronique) |
|---|
| A11 | 03 | 1 | | @1 LEBOURGEOIS (Frank) |
|---|
| A11 | 04 | 1 | | @1 EMPTOZ (Hubert) |
|---|
| A12 | 01 | 1 | | @1 YANIKOGLU (Berrin A.) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 BERKNER (Kathrin) @9 ed. |
|---|
| A14 | 01 | | | @1 LIRIS INSA de Lyon -20, av. Albert Einstein @2 69621 Villeurbanne @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. @Z 4 aut. |
|---|
| A18 | 01 | 1 | | @1 IS&T--The Society for Imaging Science and Technology @3 USA @9 org-cong. |
|---|
| A18 | 02 | 1 | | @1 Society of photo-optical instrumentation engineers @3 USA @9 org-cong. |
|---|
| A18 | 03 | 1 | | @1 Ricoh Innovations @3 INC @9 org-cong. |
|---|
| A20 | | | | @2 68150J.1-68150J.12 |
|---|
| A21 | | | | @1 2008 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 978-0-8194-6987-8 |
|---|
| A43 | 01 | | | @1 INIST @2 21760 @5 354000172831370170 |
|---|
| A44 | | | | @0 0000 @1 © 2008 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 21 ref. |
|---|
| A47 | 01 | 1 | | @0 08-0399976 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 2 | | @0 Proceedings electronic imaging science and technology |
|---|
| A66 | 01 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 An efficient mail sorting system is mainly based on an accurate optical recognition of the addresses on the envelopes. However, the localizing 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. Currently, a good localizing step leads to a better recognition rate. The limit of current methods is mainly caused by modular linear architectures used for ABL: their performances greatly depend on each independent module performance. We are presenting in this paper a new approach for ABL based on a pyramidal data organization and on a hierarchical graph coloring for classification process. This new approach presents the advantage to guarantee a good coherence between different modules and reduces both the computation time and the rejection rate. The proposed method gives a very satisfying rate of 98% of good locations on a set of 750 envelope images. |
|---|
| C02 | 01 | X | | @0 001D04A05A |
|---|
| C02 | 02 | 3 | | @0 001B00A30C |
|---|
| C02 | 03 | 3 | | @0 001B40B30S |
|---|
| C03 | 01 | X | FRE | @0 Théorie graphe @5 23 |
|---|
| C03 | 01 | X | ENG | @0 Graph theory @5 23 |
|---|
| C03 | 01 | X | SPA | @0 Teoría grafo @5 23 |
|---|
| C03 | 02 | X | FRE | @0 Temps calcul @5 61 |
|---|
| C03 | 02 | X | ENG | @0 Computation time @5 61 |
|---|
| C03 | 02 | X | SPA | @0 Tiempo computación @5 61 |
|---|
| C03 | 03 | X | FRE | @0 Localisation @5 62 |
|---|
| C03 | 03 | X | ENG | @0 Localization @5 62 |
|---|
| C03 | 03 | X | SPA | @0 Localización @5 62 |
|---|
| C03 | 04 | X | FRE | @0 Reconnaissance optique caractère @5 63 |
|---|
| C03 | 04 | X | ENG | @0 Optical character recognition @5 63 |
|---|
| C03 | 04 | X | SPA | @0 Reconocimento óptico de caracteres @5 63 |
|---|
| C03 | 05 | X | FRE | @0 Evaluation performance @5 64 |
|---|
| C03 | 05 | X | ENG | @0 Performance evaluation @5 64 |
|---|
| C03 | 05 | X | SPA | @0 Evaluación prestación @5 64 |
|---|
| C03 | 06 | X | FRE | @0 Architecture modulaire @5 65 |
|---|
| C03 | 06 | X | ENG | @0 Modular architecture @5 65 |
|---|
| C03 | 06 | X | SPA | @0 Arquitectura modular @5 65 |
|---|
| C03 | 07 | X | FRE | @0 Coloration graphe @5 66 |
|---|
| C03 | 07 | X | ENG | @0 Graph colouring @5 66 |
|---|
| C03 | 07 | X | SPA | @0 Coloración grafo @5 66 |
|---|
| C03 | 08 | X | FRE | @0 Cohérence @5 67 |
|---|
| C03 | 08 | X | ENG | @0 Coherence @5 67 |
|---|
| C03 | 08 | X | SPA | @0 Coherencia @5 67 |
|---|
| C03 | 09 | X | FRE | @0 Reconnaissance forme @5 68 |
|---|
| C03 | 09 | X | ENG | @0 Pattern recognition @5 68 |
|---|
| C03 | 09 | X | SPA | @0 Reconocimiento patrón @5 68 |
|---|
| C03 | 10 | X | FRE | @0 0130C @4 INC @5 83 |
|---|
| C03 | 11 | X | FRE | @0 4230S @4 INC @5 91 |
|---|
| N21 | | | | @1 259 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Document recognition and retrieval. Conference @2 15 @3 San Jose CA USA @4 2008 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000270
Links to Exploration step
Pascal:08-0399976
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Address block localization based on graph theory</title>
<author><name sortKey="Gaceb, Djamel" sort="Gaceb, Djamel" uniqKey="Gaceb D" first="Djamel" last="Gaceb">Djamel Gaceb</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Eglin, Veronique" sort="Eglin, Veronique" uniqKey="Eglin V" first="Véronique" last="Eglin">Véronique Eglin</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Lebourgeois, Frank" sort="Lebourgeois, Frank" uniqKey="Lebourgeois F" first="Frank" last="Lebourgeois">Frank Lebourgeois</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Emptoz, Hubert" sort="Emptoz, Hubert" uniqKey="Emptoz H" first="Hubert" last="Emptoz">Hubert Emptoz</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">08-0399976</idno>
<date when="2008">2008</date>
<idno type="stanalyst">PASCAL 08-0399976 INIST</idno>
<idno type="RBID">Pascal:08-0399976</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000270</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000514</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Address block localization based on graph theory</title>
<author><name sortKey="Gaceb, Djamel" sort="Gaceb, Djamel" uniqKey="Gaceb D" first="Djamel" last="Gaceb">Djamel Gaceb</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Eglin, Veronique" sort="Eglin, Veronique" uniqKey="Eglin V" first="Véronique" last="Eglin">Véronique Eglin</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Lebourgeois, Frank" sort="Lebourgeois, Frank" uniqKey="Lebourgeois F" first="Frank" last="Lebourgeois">Frank Lebourgeois</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Emptoz, Hubert" sort="Emptoz, Hubert" uniqKey="Emptoz H" first="Hubert" last="Emptoz">Hubert Emptoz</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><series><title level="j" type="main">Proceedings electronic imaging science and technology</title>
</series><seriesStmt><title level="j" type="main">Proceedings electronic imaging science and technology</title>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Coherence</term>
<term>Computation time</term>
<term>Graph colouring</term>
<term>Graph theory</term>
<term>Localization</term>
<term>Modular architecture</term>
<term>Optical character recognition</term>
<term>Pattern recognition</term>
<term>Performance evaluation</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Théorie graphe</term>
<term>Temps calcul</term>
<term>Localisation</term>
<term>Reconnaissance optique caractère</term>
<term>Evaluation performance</term>
<term>Architecture modulaire</term>
<term>Coloration graphe</term>
<term>Cohérence</term>
<term>Reconnaissance forme</term>
<term>0130C</term>
<term>4230S</term>
</keywords><front><div type="abstract" xml:lang="en">An efficient mail sorting system is mainly based on an accurate optical recognition of the addresses on the envelopes. However, the localizing 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. Currently, a good localizing step leads to a better recognition rate. The limit of current methods is mainly caused by modular linear architectures used for ABL: their performances greatly depend on each independent module performance. We are presenting in this paper a new approach for ABL based on a pyramidal data organization and on a hierarchical graph coloring for classification process. This new approach presents the advantage to guarantee a good coherence between different modules and reduces both the computation time and the rejection rate. The proposed method gives a very satisfying rate of 98% of good locations on a set of 750 envelope images.</div>
</front><inist><standard h6="B"><pA><fA05><s2>6815</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Address block localization based on graph theory</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Document recognition and retrieval XV : 29-31 January 2008, San Jose, California, USA</s1>
</fA09><fA11 i1="01" i2="1"><s1>GACEB (Djamel)</s1>
</fA11><fA11 i1="02" i2="1"><s1>EGLIN (Véronique)</s1>
</fA11><fA11 i1="03" i2="1"><s1>LEBOURGEOIS (Frank)</s1>
</fA11><fA11 i1="04" i2="1"><s1>EMPTOZ (Hubert)</s1>
</fA11><fA12 i1="01" i2="1"><s1>YANIKOGLU (Berrin A.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>BERKNER (Kathrin)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LIRIS INSA de Lyon -20, av. Albert Einstein</s1>
<s2>69621 Villeurbanne</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA18 i1="01" i2="1"><s1>IS&T--The Society for Imaging Science and Technology</s1>
<s3>USA</s3>
<s9>org-cong.</s9>
</fA18><fA18 i1="02" i2="1"><s1>Society of photo-optical instrumentation engineers</s1>
<s3>USA</s3>
<s9>org-cong.</s9>
</fA18><fA18 i1="03" i2="1"><s1>Ricoh Innovations</s1>
<s3>INC</s3>
<s9>org-cong.</s9>
</fA18><fA20><s2>68150J.1-68150J.12</s2>
</fA20><fA21><s1>2008</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>978-0-8194-6987-8</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>21760</s2>
<s5>354000172831370170</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2008 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>21 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>08-0399976</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="2"><s0>Proceedings electronic imaging science and technology</s0>
</fA64><fA66 i1="01"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>An efficient mail sorting system is mainly based on an accurate optical recognition of the addresses on the envelopes. However, the localizing 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. Currently, a good localizing step leads to a better recognition rate. The limit of current methods is mainly caused by modular linear architectures used for ABL: their performances greatly depend on each independent module performance. We are presenting in this paper a new approach for ABL based on a pyramidal data organization and on a hierarchical graph coloring for classification process. This new approach presents the advantage to guarantee a good coherence between different modules and reduces both the computation time and the rejection rate. The proposed method gives a very satisfying rate of 98% of good locations on a set of 750 envelope images.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D04A05A</s0>
</fC02><fC02 i1="02" i2="3"><s0>001B00A30C</s0>
</fC02><fC02 i1="03" i2="3"><s0>001B40B30S</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Théorie graphe</s0>
<s5>23</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Graph theory</s0>
<s5>23</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Teoría grafo</s0>
<s5>23</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Temps calcul</s0>
<s5>61</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Computation time</s0>
<s5>61</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Tiempo computación</s0>
<s5>61</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Localisation</s0>
<s5>62</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Localization</s0>
<s5>62</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Localización</s0>
<s5>62</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Reconnaissance optique caractère</s0>
<s5>63</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Optical character recognition</s0>
<s5>63</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Reconocimento óptico de caracteres</s0>
<s5>63</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Evaluation performance</s0>
<s5>64</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Performance evaluation</s0>
<s5>64</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Evaluación prestación</s0>
<s5>64</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Architecture modulaire</s0>
<s5>65</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Modular architecture</s0>
<s5>65</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Arquitectura modular</s0>
<s5>65</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Coloration graphe</s0>
<s5>66</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Graph colouring</s0>
<s5>66</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Coloración grafo</s0>
<s5>66</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Cohérence</s0>
<s5>67</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Coherence</s0>
<s5>67</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Coherencia</s0>
<s5>67</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>68</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>68</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>68</s5>
</fC03><fC03 i1="10" i2="X" l="FRE"><s0>0130C</s0>
<s4>INC</s4>
<s5>83</s5>
</fC03><fC03 i1="11" i2="X" l="FRE"><s0>4230S</s0>
<s4>INC</s4>
<s5>91</s5>
</fC03><fN21><s1>259</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Document recognition and retrieval. Conference</s1>
<s2>15</s2>
<s3>San Jose CA USA</s3>
<s4>2008</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000514 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000514 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:08-0399976
|texte= Address block localization based on graph theory
}}
| This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024 |  |
