13 search results - page 1 / 3 » Graph Partitioning by Spectral Rounding: Applications in Ima... |
82
Voted
CVPR
2006
IEEE
16 years 15 days 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...
79
Voted
MICCAI
2010
Springer
14 years 9 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
113
click to vote
PAMI
2007
14 years 10 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....
70
Voted
CVPR
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
111
click to vote
NIPS
2004
14 years 12 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...