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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ching-Huei, W., Palumbo, P.W., Srihari, S.N.: Object recognition in visually complex environments: an architecture for locating address blocks on mail pieces, Pattern Recognition. In: 9th International Conference, vol. 1, pp. 365–367. IEEE Computer Society Press, Los Alamitos (1988)
Viard-Gaudin, C., Barba, D.: A multi-resolution approach to extract the address block on flat mail pieces. In: ICASSP-91. International Conference, vol. 4, pp. 2701–2704.
Yu, B., Jain, A.K., Mohiuddin, M.: Address block location on complex mail pieces. In: Document Analysis and Recognition. Fourth International Conference, vol. 2, pp. 897–901. IEEE Computer Society Press, Los Alamitos (1997)
Jeong, S.H., Jang, S.I., Nam, Y.-S.: Locating destination address block in Korean mail images. In: ICPR 2004. 17th International Conference, vol. 2, pp. 387–390. IEEE Computer Society Press, Los Alamitos (2004)
Eiterer, L.F., Facon, J., Menoti, D.: Postal envelope address block location by fractal-based approach. In: Computer Graphics and Image Processing. 17th Brazilian Symposium, pp. 90–97. IEEE Computer Society Press, Los Alamitos (2004)
Otsu, N.: A threshold selection method from grey-level histogram. IEEE trans system, man and cybernetics 9, 62–66 (1979)
Sauvola, J., et al.: Adaptive Document Binarization. In: ICDAR 1997, vol. 1, pp. 147–152 (1997)
Pavlidis, Z., Zhou, J.: A Page Segmentation and Classification. CVGIP92 54(6), 484–496
Regentova, E., Latifi, S., Deng, S., Yao, D.: An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images. In: Pattern Analysis and Machine Intelligence, vol. 24, pp. 1039–1047. IEEE Computer Society Press, Los Alamitos
Déforges, O., Barba, D.: A fast multiresolution text-line and non text line structures extraction and discrimination scheme for document image analysis. In: ICPR 1994, pp. 34–138
Wang, S.-Y., Yagasaki, T.: Block selection: a method for segmenting a page image of various editing styles. In: ICDAR 1995. Proceedings of the Third International Conference, vol. 1, pp. 128–133 (1995)
Shi, Z., Govindaraju, V.: Line separation for complex document images using fuzzy runlength. In: Document Image Analysis for Libraries, DIAL 2004, pp. 306–312 (2004)
Drivas, D., Amin, A.: Page segmentation and classification utilising a bottom-up approach, Document Analysis and Recognition. In: ICDAR 1995. Proceedings of the Third International Conference, vol. 2, pp. 610–614 (1995)
Effantin, B., Kheddouci, H.: The b-chromatic number of power graphs. Discrete Mathematics and Theoretical Computer Science (DMTCS) 6, 45–54 (2003)
Elghazel, H., Hacid, M.-S., Khedddoucil, H., Dussauchoy, A.: A New Clustering Approach for Symbolic Data: Algorithms and Application to Healthcare Data, 22 éme journées bases de données avancées, BDA 2006, Lille, Actes On formal proceeding (Octobre 17, 2006)
Corteel, S., Valencia-Pabon, M., Vera, J.-C.: On approximating the b-chromatic number,Discrete Applied Mathematics archive, vol. 146, pp. 106–110. Publisher Elsevier Science Publishers B. V, Amsterdam, The Netherlands (2005), ISSN:0166-218X
Effantin, B., Kheddouci, H.: A distributed algorithm for a b-coloring of a graph. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaceb, D., Eglin, V., Lebourgeois, F., Emptoz, H. (2007). A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2007. Lecture Notes in Computer Science, vol 4633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74260-9_113
Download citation
DOI: https://doi.org/10.1007/978-3-540-74260-9_113
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74258-6
Online ISBN: 978-3-540-74260-9
eBook Packages: Computer ScienceComputer Science (R0)