Translator Disclaimer
28 January 2008 Address block localization based on graph theory
Author Affiliations +
Proceedings Volume 6815, Document Recognition and Retrieval XV; 68150J (2008) https://doi.org/10.1117/12.766735
Event: Electronic Imaging, 2008, San Jose, California, United States
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Djamel Gaceb, Véronique Eglin, Frank Lebourgeois, and Hubert Emptoz "Address block localization based on graph theory", Proc. SPIE 6815, Document Recognition and Retrieval XV, 68150J (28 January 2008); https://doi.org/10.1117/12.766735
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top