Abstract
In this paper, we present a topological algorithm which allows to fill contours images. The filling problem has been widely treated and it recently appeared that it can always be split into two different process : a generic topological process and a dedicated geometrical post-processing which depends on the application. Our algorithm, based on a 2D topological map description of the image, addresses the first step of processing. It is fast, generic and robust. Moreover, the complete topological description allows to easily integrate geometrical constrains and makes our approach an interesting basis for every filling process.
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
Lejun, S., Zhou, H.: A new contour fill algorithm for outlined character image generation. Computers & Graphics 19, 551–556 (1995)
Arrivault, D., Richard, N., Bouyer, P.: A fuzzy hierarchical attributed graph approach for handwritten hieroglyphs description. In: 11th International Conference on Computer Analysis of Images and Patterns, Versailles, France, 748 ( 2005)
Pavlidis, T.: Contour filling in raster graphics. In: SIGGRAPH 1981. Proceedings of the 8th annual conference on Computer graphics and interactive techniques, pp. 29–36. ACM Press, New York (1981)
Ren, M., Yang, W., Yang, J.: A new and fast contour-filling algorithm. Pattern Recognition 38, 2564–2577 (2005)
Codrea, M., Nevalainen, O.: Note: An algorithm for contour-based region filling. Computers & Graphics 29, 441–450 (2005)
Martin, M., Alberola-López, C., Ruiz-Alzola, J.: A topology-based filling algorithm. Computers & Graphics 25, 493–509 (2001)
Edmonds, J.: A combinatorial representation for polyhedral surfaces. Notices of the American Mathematical Society vol. 7 (1960)
Tutte, W.: A census of planar maps. Canad. J. Math. 15, 249–271 (1963)
Jacques, A.: Constellations et graphes topologiques. Combinatorial Theory and Applications 2, 657–673 (1970)
Cori, R.: Un code pour les graphes planaires et ses applications. In: Astérisque. Soc. Math. de France, Paris, France, vol. 27 (1975)
Lienhardt, P.: Topological models for boundary representation: a comparison with n-dimensional generalized maps. Computer-Aided Design, vol. 23 (1991)
Damiand, G., Bertrand, Y., Fiorio, C.: Topological model for two-dimensional image representation: definition and optimal extraction algorithm. Computer Vision and Image Understanding 93, 111–154 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damiand, G., Arrivault, D. (2007). A New Contour Filling Algorithm Based on 2D Topological Map. In: Escolano, F., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2007. Lecture Notes in Computer Science, vol 4538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72903-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-72903-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72902-0
Online ISBN: 978-3-540-72903-7
eBook Packages: Computer ScienceComputer Science (R0)