Towards connected filtering based on component-graphs

Abstract : 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.
Type de document :
Communication dans un congrès
International Symposium on Mathematical Morphology (ISMM), 2013, Uppsala, Sweden. Springer, 7883, pp.350-361, 2013, Mathematical Morphology and Its Applications to Signal and Image Processing 11th International Symposium, ISMM 2013, Uppsala, Sweden, May 27-29, 2013. Proceedings. 〈10.1007/978-3-642-38294-9_30〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.univ-reims.fr/hal-01695064
Contributeur : Nicolas Passat <>
Soumis le : mercredi 28 février 2018 - 20:49:53
Dernière modification le : samedi 20 octobre 2018 - 01:17:43
Document(s) archivé(s) le : lundi 28 mai 2018 - 15:24:17

Fichier

Naegel_ISMM_2013.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Benoît Naegel, Nicolas Passat. Towards connected filtering based on component-graphs. International Symposium on Mathematical Morphology (ISMM), 2013, Uppsala, Sweden. Springer, 7883, pp.350-361, 2013, Mathematical Morphology and Its Applications to Signal and Image Processing 11th International Symposium, ISMM 2013, Uppsala, Sweden, May 27-29, 2013. Proceedings. 〈10.1007/978-3-642-38294-9_30〉. 〈hal-01695064〉

Partager

Métriques

Consultations de la notice

109

Téléchargements de fichiers

16