Sciweavers

697 search results - page 7 / 140
» Convex Functions on Discrete Sets
Sort
View
PAMI
2011
13 years 3 months ago
Multiview Stereo and Silhouette Consistency via Convex Functionals over Convex Domains
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
Daniel Cremers, Kalin Kolev
NIPS
2007
13 years 10 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
ICML
2008
IEEE
14 years 9 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
13 years 8 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman
AUTOMATICA
2008
112views more  AUTOMATICA 2008»
13 years 7 months ago
Stabilizability of switched linear systems does not imply the existence of convex Lyapunov functions
Counterexamples are given which show that a linear switched system (with controlled switching) that can be stabilized by means of a suitable switching law does not necessarily admi...
Franco Blanchini, Carlo Savorgnan