1115 search results - page 15 / 223 » Active Graph Cuts |
105
Voted
PPAM
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
123
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
125
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
148
click to vote
PAMI
2007
15 years 1 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....
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...