Sciweavers

560 search results - page 24 / 112
» Level-set methods for convex optimization
Sort
View
ICPR
2008
IEEE
15 years 8 months ago
Improving Bayesian Network parameter learning using constraints
This paper describes a new approach to unify constraints on parameters with training data to perform parameter estimation in Bayesian networks of known structure. The method is ge...
Cassio Polpo de Campos, Qiang Ji
CVPR
2008
IEEE
16 years 4 months ago
Enforcing convexity for improved alignment with constrained local models
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 2 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
MP
2008
99views more  MP 2008»
15 years 1 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
ICCV
2005
IEEE
15 years 7 months ago
Convex Grouping Combining Boundary and Region Information
Convexity is an important geometric property of many natural and man-made structures. Prior research has shown that it is imperative to many perceptual-organization and imageunder...
Joachim S. Stahl, Song Wang