Semi-connections and hierarchies

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

Cited literature [24 references]  Display  Hide  Download
Contributor : Nicolas Passat <>
Submitted on : Wednesday, February 28, 2018 - 2:18:42 AM
Last modification on : Thursday, July 19, 2018 - 3:34:01 PM
Long-term archiving on : Monday, May 28, 2018 - 6:23:53 PM


Files produced by the author(s)



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⟩



Record views


Files downloads