Component-graph construction - Archive ouverte HAL Access content directly
Journal Articles Journal of Mathematical Imaging and Vision Year : 2019

Component-graph construction

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

Abstract

Component-trees are classical tree structures for grey-level image modelling. Component-graphs are defined as a generalization of component-trees to images taking their values in any (totally or partially) ordered sets. Similarly to component-trees, component-graphs are a lossless image model; then, they can allow for the development of various image processing approaches. However, component-graphs are not trees, but directed acyclic graphs. This makes their construction non-trivial, leading to non-linear time cost and resulting in non-linear space data structures. In this theoretical article, we discuss the notion(s) of component-graph, and we propose a strategy for their efficient building and representation, which are necessary conditions for further involving them in image processing approaches.
Fichier principal
Vignette du fichier
Passat JMIV 2019.pdf (427.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01821264 , version 1 (29-06-2018)
hal-01821264 , version 2 (25-01-2019)

Identifiers

Cite

Nicolas Passat, Benoît Naegel, Camille Kurtz. Component-graph construction. Journal of Mathematical Imaging and Vision, 2019, 61 (6), pp.798-823. ⟨10.1007/s10851-019-00872-5⟩. ⟨hal-01821264v2⟩
430 View
426 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More