Implicit component-graph: A discussion

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

Cited literature [13 references]  Display  Hide  Download

https://hal.univ-reims.fr/hal-01695076
Contributor : Nicolas Passat <>
Submitted on : Thursday, February 15, 2018 - 11:46:37 AM
Last modification on : Thursday, June 27, 2019 - 12:12:18 PM
Long-term archiving on : Monday, May 7, 2018 - 12:04:01 AM

File

Passat_ISMM_2017.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

137

Files downloads

118