A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring

摘要

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.