Sciweavers

666 search results - page 14 / 134
» Unbalanced Graph Cuts
Sort
View
123
Voted
DIS
2006
Springer
15 years 7 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
122
Voted
SIROCCO
2008
15 years 5 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
16 years 4 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 ...
120
Voted
AAAI
2007
15 years 5 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
102
Voted
CVPR
2004
IEEE
16 years 5 months ago
Motion Layer Extraction in the Presence of Occlusion Using Graph Cut
Jiangjian Xiao, Mubarak Shah