557 search results - page 72 / 112 » Visualizing Weighted Edges in Graphs |
107
click to vote
DICTA
2003
15 years 15 days ago
2003
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
CVPR
2000
IEEE
15 years 3 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
114
click to vote
CORR
2012
Springer
13 years 6 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
103
click to vote
ICIP
2007
IEEE
16 years 24 days ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
113
click to vote
ISBI
2009
IEEE
15 years 6 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...