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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.univ-reims.fr/hal-01695064
Contributor : Nicolas Passat <>
Submitted on : Wednesday, February 28, 2018 - 8:49:53 PM
Last modification on : Thursday, June 27, 2019 - 12:12:19 PM
Long-term archiving on : Monday, May 28, 2018 - 3:24:17 PM

File

Naegel_ISMM_2013.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

135

Files downloads

80