Sciweavers

1672 search results - page 27 / 335
» Tightness problems in the plane
Sort
View
CORR
2012
Springer
185views Education» more  CORR 2012»
12 years 3 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
CVPR
2008
IEEE
14 years 9 months ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner
BMVC
2000
13 years 9 months ago
Shape from Texture: Homogeneity Revisited
The objective of this paper is to estimate the orientation of a scene plane from an uncalibrated perspective image under the assumption that the scene is coated with a homogeneous...
Antonio Criminisi, Andrew Zisserman
JOTA
2011
149views more  JOTA 2011»
13 years 2 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
CVPR
2009
IEEE
15 years 2 months ago
A Stereo Approach that Handles the Matting Problem via Image Warping
We propose an algorithm that simultaneously extracts disparities and alpha matting information given a stereo image pair. Our method divides the reference image into a set of ov...
Michael Bleyer (Vienna University of Technology), ...