270 search results - page 30 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
ICCV
2001
IEEE
14 years 10 months ago
2001
IEEE
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...
PAMI
2007
13 years 8 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
MM
2006
ACM
14 years 2 months ago
2006
ACM
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
SCIA
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...