Differential oriented image foresting transform segmentation by seed competition

DOI10.1007/978-3-031-19897-7_24MaRDI QIDQ6103057zbMATH OpenFDO

Authors Marcos A. T. Condori, Paulo A. V. Miranda

Publication date 2 June 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-19897-7_24

zbMATH Keywords

differential algorithmsgeneralized graph cutimage segmentation in directed graphsoriented image foresting transform

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10)

Recommendations

• Sub-pixel segmentation with the image foresting transform
• Efficient hierarchical multi-object segmentation in layered graphs
• Multiscale skeletons by image foresting transform and its application to neuromorphometry
• Optimum cuts in graphs by general fuzzy connectedness with local band constraints
• Fast Constrained Image Segmentation Using Optimal Spanning Trees

Cites work

• An Iterative Spanning Forest Framework for Superpixel Segmentation
• Efficient hierarchical multi-object segmentation in layered graphs
• Optimum cuts in graphs by general fuzzy connectedness with local band constraints
• Oriented Image Foresting Transform Segmentation by Seed Competition
• Path-value functions for which Dijkstra's algorithm returns optimal mapping

Cited in

(5)

• Multiscale skeletons by image foresting transform and its application to neuromorphometry
• Efficient hierarchical multi-object segmentation in layered graphs
• Sub-pixel segmentation with the image foresting transform
• Seed robustness of oriented iImage foresting transform: core computation and the robustness coefficient
• Differential oriented image foresting transform and its applications to support high-level priors for object segmentation

This page was built for publication: Differential oriented image foresting transform segmentation by seed competition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103057)