1722 search results - page 85 / 345 » On the sample mean of graphs |
197
click to vote
ICIP
2007
IEEE
16 years 7 months 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...
147
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
156
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents a novel method for real-time tracking of objects in video sequences. Tracking is performed using the so-called Morphological Elastic Graph Matching algorithm. ...
130
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
181
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...