Reduced graphs for min-cut/max-flow approaches in image segmentation (Q2840685)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reduced graphs for min-cut/max-flow approaches in image segmentation |
scientific article; zbMATH DE number 6190220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduced graphs for min-cut/max-flow approaches in image segmentation |
scientific article; zbMATH DE number 6190220 |
Statements
Reduced graphs for min-cut/max-flow approaches in image segmentation (English)
0 references
23 July 2013
0 references
image segmentation
0 references
MIN-cut/MAX-flow
0 references
graph reduction
0 references
0.8682701587677002
0 references
0.7980527281761169
0 references
