Version française


Guillaume Damiand

oHome page

oResearches

oPublications

oTeaching

oSupervised Thesis

oCV

oContacts

oLinks

A New Contour Filling Algorithm Based on 2D Topological Map

Damiand G., Arrivault D.
Proc. of 6th Workshop on Graph-Based Representations in Pattern Recognition (GBR)
Lecture Notes in Computer Science 4538, pages 319-329, June 2007, Alicante, Spain

Links:  PDF  Hal  Link  

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.

Keywords: Topological maps; Filling process; Character reconstruction.

BibTex references

@InProceedings{DA07,
      author = {Damiand, G. and Arrivault, D.},
      title = {A New Contour Filling Algorithm Based on 2D Topological Map},
      booktitle = {Proc. of 6th Workshop on Graph-Based Representations in Pattern Recognition (GBR)},
      series = {Lecture Notes in Computer Science},
      publisher = {Springer Berlin/Heidelberg},
      volume = {4538},
      pages = {319-329},
      month = {June},
      year = {2007},
      address = {Alicante, Spain},
      keywords = {Topological maps; Filling process; Character reconstruction.},
      url = {https://doi.org/10.1007/978-3-540-72903-7_29}
}

Image


o [Back]