Directed connected operators: Asymmetric hierarchies for image filtering and segmentation

Abstract : Connected operators provide well-established solutions for digital image processing, typically in conjunction with hierarchical schemes. In graph-based frameworks, such operators basically rely on symmetric adjacency relations between pixels. In this article, we introduce a notion of directed connected operators for hierarchical image processing, by also considering non-symmetric adjacency relations. The induced image representation models are no longer partition hierarchies (i.e., trees), but directed acyclic graphs that generalize standard morphological tree structures such as component trees, binary partition trees or hierarchical watersheds. We describe how to efficiently build and handle these richer data structures, and we illustrate the versatility of the proposed framework in image filtering and image segmentation.
Complete list of metadatas

Cited literature [80 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00869727
Contributor : Benjamin Perret <>
Submitted on : Wednesday, November 19, 2014 - 2:30:58 PM
Last modification on : Friday, October 4, 2019 - 1:34:31 AM
Long-term archiving on : Friday, April 14, 2017 - 8:38:26 PM

File

Perret - PAMI 2014 - Directed ...
Files produced by the author(s)

Identifiers

Citation

Benjamin Perret, Jean Cousty, Olena Tankyevych, Hugues Talbot, Nicolas Passat. Directed connected operators: Asymmetric hierarchies for image filtering and segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2015, 37 (6), pp.1162-1176. ⟨10.1109/TPAMI.2014.2366145⟩. ⟨hal-00869727v2⟩

Share

Metrics

Record views

654

Files downloads

722