Towards connected filtering based on component-graphs
Résumé
In recent works, a new notion of component-graph has been introduced to extend the data structure of component-tree –and the induced antiextensive filtering methodologies– from grey-level images to multivalued ones. In this article, we briefly recall the main structural key-points of component-graphs, and we present the initial algorithmic results that open the way to the actual development of component-graph-based antiextensive filtering procedures.
Fichier principal
Naegel_ISMM_2013.pdf (2.33 Mo)
Télécharger le fichier
Naegel ISMM 2013 Poster.pdf (683.71 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...