Implicit component-graph: A discussion - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Implicit component-graph: A discussion

(1) , (2) , (3)
1
2
3

Abstract

Component-graphs are defined as the generalization of component-trees to images taking their values in partially ordered sets. Similarly to component-trees, component-graphs are a lossless image model, and can allow for the development of various image processing approaches (antiextensive filtering, segmentation by node selection). However, component-graphs are not trees, but directed acyclic graphs. This induces a structural complexity associated to a higher combinatorial cost. These properties make the handling of component-graphs a non-trivial task. We propose a preliminary discussion on a new way of building and manipulating component-graphs, with the purpose of reaching reasonable space and time costs. Tackling these complexity issues is indeed required for actually involving component-graphs in efficient image processing approaches.
Fichier principal
Vignette du fichier
Passat_ISMM_2017.pdf (146.18 Ko) Télécharger le fichier
Vignette du fichier
Passat ISMM 2017 Poster.pdf (656.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01695076 , version 1 (15-02-2018)

Identifiers

Cite

Nicolas Passat, Benoît Naegel, Camille Kurtz. Implicit component-graph: A discussion. International Symposium on Mathematical Morphology (ISMM), 2017, Fontainebleau, France. pp.235-248, ⟨10.1007/978-3-319-57240-6_19⟩. ⟨hal-01695076⟩
125 View
156 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More