Sciweavers

100 search results - page 3 / 20
» Fast Approximate Energy Minimization with Label Costs
Sort
View
JCO
2007
128views more  JCO 2007»
13 years 6 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
VMV
2008
165views Visualization» more  VMV 2008»
13 years 7 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...
CVPR
2009
IEEE
15 years 1 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
INFOCOM
2010
IEEE
13 years 4 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...
JMIV
2006
166views more  JMIV 2006»
13 years 6 months ago
Fast Surface Segmentation Guided by User Input Using Implicit Extension of Minimal Paths
We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two or more known curves (the constrai...
Roberto Ardon, Laurent D. Cohen, Anthony J. Yezzi