Links between image segmentation based on optimum-path forest and minimum cut in graph
From MaRDI portal
(Redirected from Publication:993544)
Recommendations
- Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
- Optimum cuts in graphs by general fuzzy connectedness with local band constraints
- Fast Constrained Image Segmentation Using Optimal Spanning Trees
- Reduced graphs for min-cut/max-flow approaches in image segmentation
- scientific article; zbMATH DE number 1849127
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 1444011 (Why is no real title available?)
- Multiscale skeletons by image foresting transform and its application to neuromorphometry
- Object delineation by -connected components
- Relative Fuzzy Connectedness among Multiple Objects: Theory, Algorithms, and Applications in Image Segmentation
- The ordered queue and the optimality of the watershed approaches
Cited in
(5)- Efficient hierarchical multi-object segmentation in layered graphs
- Seed robustness of oriented iImage foresting transform: core computation and the robustness coefficient
- A graph-based framework for sub-pixel image segmentation
- The role of optimum connectivity in image segmentation: can the algorithm learn object information during the process?
- Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
This page was built for publication: Links between image segmentation based on optimum-path forest and minimum cut in graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993544)