Component-graph construction

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.univ-reims.fr/hal-01821264
Contributor : Nicolas Passat <>
Submitted on : Friday, January 25, 2019 - 5:21:32 PM
Last modification on : Thursday, July 11, 2019 - 10:18:58 AM
Long-term archiving on : Friday, April 26, 2019 - 1:47:35 PM

File

Passat JMIV 2019.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

106

Files downloads

233