Towards connected filtering based on component-graphs - Université de Reims Champagne-Ardenne Access content directly
Conference Papers Year : 2013

Towards connected filtering based on component-graphs


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
Vignette du fichier
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
Origin : Files produced by the author(s)

Dates and versions

hal-01695064 , version 1 (28-02-2018)



Benoît Naegel, Nicolas Passat. Towards connected filtering based on component-graphs. International Symposium on Mathematical Morphology (ISMM), 2013, Uppsala, Sweden. pp.350-361, ⟨10.1007/978-3-642-38294-9_30⟩. ⟨hal-01695064⟩
194 View
309 Download



Gmail Facebook Twitter LinkedIn More