Pages that link to "Item:Q2840685"
From MaRDI portal
The following pages link to Reduced graphs for min-cut/max-flow approaches in image segmentation (Q2840685):
Displaying 7 items.
- A reduction method for graph cut optimization (Q903099) (← links)
- Links between image segmentation based on optimum-path forest and minimum cut in graph (Q993544) (← links)
- A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation (Q2032045) (← links)
- A distributed mincut/maxflow algorithm combining path augmentation and push-relabel (Q2254255) (← links)
- A spatially continuous max-flow and min-cut framework for binary labeling problems (Q2454034) (← links)
- Exact solutions for discrete graphical models. Multicuts and reduction techniques (Q2875319) (← links)
- A simple topology preserving max-flow algorithm for graph cut based image segmentation (Q2917274) (← links)