192 search results - page 11 / 39 » Cut Points in PEG |
68
Voted
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
— We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. ...
106
click to vote
TIP
2011
14 years 4 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
105
click to vote
MEMICS
2010
14 years 4 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
116
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
124
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...