40 search results - page 1 / 8 » Image Segmentation with Minimum Mean Cut |
67
Voted
ICCV
2001
IEEE
16 years 3 days ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
86
Voted
CVPR
2005
IEEE
16 years 6 days ago
2005
IEEE
We present a quantitative evaluation of SE-MinCut, a novel segmentation algorithm based on spectral embedding and minimum cut. We use human segmentations from the Berkeley Segment...
107
Voted
ACIVS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
181
click to vote
ISMM
2011
Springer
14 years 1 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...
103
click to vote
ACCV
2009
Springer
15 years 4 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...