8 search results - page 2 / 2 » What is optimized in tight convex relaxations for multi-labe... |
CVPR
2008
IEEE
14 years 7 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...
SCIA
2007
Springer
13 years 11 months ago
2007
Springer
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
MP
2010
13 years 3 months ago
2010
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...