1133 search results - page 16 / 227 » Basics of Graph Cuts |
110
Voted
DIS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
106
Voted
SIROCCO
2008
15 years 3 months ago
2008
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
112
Voted
ICIP
2009
IEEE
16 years 2 months ago
2009
IEEE
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...
103
Voted
AAAI
2007
15 years 4 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
90
Voted
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE