Sciweavers

1133 search results - page 16 / 227
» Basics of Graph Cuts
Sort
View
DIS
2006
Springer
13 years 11 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
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...
Jan Poland, Thomas Zeugmann
SIROCCO
2008
13 years 9 months ago
Self-stabilizing Cuts in Synchronous Networks
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 ...
Thomas Sauerwald, Dirk Sudholt
ICIP
2009
IEEE
14 years 8 months ago
Modified Grabcut For Unsupervised Object Segmentation
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 ...
AAAI
2007
13 years 10 months ago
Graph Partitioning Based on Link Distributions
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...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu