Share Email Print

Proceedings Paper

Address block localization based on graph theory
Author(s): Djamel Gaceb; Véronique Eglin; Frank Lebourgeois; Hubert Emptoz
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 28 January 2008
PDF: 12 pages
Proc. SPIE 6815, Document Recognition and Retrieval XV, 68150J (28 January 2008); doi: 10.1117/12.766735
Show Author Affiliations
Djamel Gaceb, Institut National des Sciences Appliquées de Lyon (France)
Véronique Eglin, Institut National des Sciences Appliquées de Lyon (France)
Frank Lebourgeois, Institut National des Sciences Appliquées de Lyon (France)
Hubert Emptoz, Institut National des Sciences Appliquées de Lyon (France)

Published in SPIE Proceedings Vol. 6815:
Document Recognition and Retrieval XV
Berrin A. Yanikoglu; Kathrin Berkner, Editor(s)

© SPIE. Terms of Use
Back to Top