521 search results - page 30 / 105 » Coring method for clustering a graph |
190
click to vote
ACCV
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
154
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
132
click to vote
KES
2008
Springer
15 years 4 months ago
2008
Springer
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...
128
click to vote
ICIP
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
146
click to vote
APCSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...