27 search results - page 2 / 6 » On Watershed Cuts and Thinnings |
IVC
2010
12 years 11 months ago
2010
Minimum cuts, extremum spanning forests and watersheds have been used as the basis for powerful image segmentation procedures. In this paper, we present some results about the lin...
MICCAI
2006
Springer
14 years 5 months ago
2006
Springer
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
ISMM
2011
Springer
12 years 7 months ago
2011
Springer
We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and w...
IVC
2010
13 years 3 months ago
2010