A new graph cut-based multiple active contour algorithm without initial contours and seed points (Q1008482)
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: A new graph cut-based multiple active contour algorithm without initial contours and seed points |
scientific article; zbMATH DE number 5534628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new graph cut-based multiple active contour algorithm without initial contours and seed points |
scientific article; zbMATH DE number 5534628 |
Statements
A new graph cut-based multiple active contour algorithm without initial contours and seed points (English)
0 references
30 March 2009
0 references
multiple active contours
0 references
graph cuts
0 references
divisive partitioning
0 references
image segmentation
0 references
0.7497185468673706
0 references
0.7334305644035339
0 references
0.7297752499580383
0 references
0.7253362536430359
0 references
0.7222131490707397
0 references
