26 search results - page 4 / 6 » Tight Convex Relaxations for Vector-Valued Labeling Problems |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
NIPS
2003
13 years 9 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
Multi-task learning refers to the learning problem of performing inference by jointly considering multiple related tasks. There have already been many research efforts on supervise...