Efficient hierarchical multi-object segmentation in layered graphs
DOI10.1515/MATHM-2020-0108zbMATH Open1475.68425OpenAlexW3186880611MaRDI QIDQ2054416FDOQ2054416
Authors: Leissi M. C. Leon, Krzysztof Chris Ciesielski, Paulo A. V. Miranda 
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
Recommendations
- Differential oriented image foresting transform segmentation by seed competition
- Prior-based hierarchical segmentation highlighting structures of interest
- Prior-based hierarchical segmentation highlighting structures of interest
- Global-local optimizations by hierarchical cuts and climbing energies
- Efficient graph-based image segmentation
Graph theory (including graph drawing) in computer science (68R10) Biomedical imaging and signal processing (92C55) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- 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
- Minimizing energies with hierarchical costs
- Path-value functions for which Dijkstra's algorithm returns optimal mapping
- Oriented Image Foresting Transform Segmentation by Seed Competition
- Optimum cuts in graphs by general fuzzy connectedness with local band constraints
- Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
- Seed robustness of oriented iImage foresting transform: core computation and the robustness coefficient
Cited In (5)
- Object-based image labeling through learning by example and multi-level segmentation
- Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
- 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
- Shortest-Path Constraints for 3D Multiobject Semiautomatic Segmentation Via Clustering and Graph Cut
Uses Software
This page was built for publication: Efficient hierarchical multi-object segmentation in layered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2054416)
