Efficient hierarchical multi-object segmentation in layered graphs
From MaRDI portal
Publication:2054416
DOI10.1515/mathm-2020-0108zbMath1475.68425OpenAlexW3186880611MaRDI QIDQ2054416
Krzysztof Chris Ciesielski, Paulo A. V. Miranda, Leissi M. C. Leon
Publication date: 2 December 2021
Published in: Mathematical Morphology. Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/mathm-2020-0108
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Biomedical imaging and signal processing (92C55)
Related Items (2)
Differential oriented image foresting transform and its applications to support high-level priors for object segmentation ⋮ Differential oriented image foresting transform segmentation by seed competition
Uses Software
Cites Work
- Unnamed Item
- General theory of fuzzy connectedness segmentations
- Links between image segmentation based on optimum-path forest and minimum cut in graph
- The minimum barrier distance: a summary of recent advances
- Path-value functions for which Dijkstra's algorithm returns optimal mapping
- Minimizing energies with hierarchical costs
- Optimum cuts in graphs by general fuzzy connectedness with local band constraints
- Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
- Oriented Image Foresting Transform Segmentation by Seed Competition
- Seed Robustness of Oriented Image Foresting Transform: Core Computation and the Robustness Coefficient
This page was built for publication: Efficient hierarchical multi-object segmentation in layered graphs