A spatially continuous max-flow and min-cut framework for binary labeling problems (Q2454034)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6303456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A spatially continuous max-flow and min-cut framework for binary labeling problems |
scientific article; zbMATH DE number 6303456 |
Statements
A spatially continuous max-flow and min-cut framework for binary labeling problems (English)
0 references
12 June 2014
0 references
binary labeling problems
0 references
max-flow/min-cut models
0 references
image segmentation
0 references
optimization
0 references
primal/dual problems
0 references
0 references
0 references
0 references
0 references
0 references
0.8268430233001709
0 references
0.76756352186203
0 references
0.7595442533493042
0 references
0.7545804381370544
0 references
