Semi-connections and hierarchies - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Semi-connections and hierarchies

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

Abstract

Connectivity is the basis of several methodological concepts in mathematical morphology. In graph-based approaches, the notion of connectivity can be derived from the notion of adjacency. In this preliminary work, we investigate the effects of relaxing the symmetry property of adjacency. In particular, we observe the consequences on the induced connected components, that are no longer organised as partitions but as covers, and on the hierarchies that are obtained from such components. These hierarchies can extend data structures such as component-trees and partition-trees, and the associated filtering and segmentation paradigms, leading to improved image processing tools.
Fichier principal
Vignette du fichier
article_Revision.pdf (143.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01719130 , version 1 (28-02-2018)

Identifiers

Cite

Olena Tankyevych, Hugues Talbot, Nicolas Passat. Semi-connections and hierarchies. International Symposium on Mathematical Morphology (ISMM), 2013, Uppsala, Sweden. pp.157-168, ⟨10.1007/978-3-642-38294-9_14⟩. ⟨hal-01719130⟩
100 View
161 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More