116 search results - page 5 / 24 » Reformulation and convex relaxation techniques for global op... |
90
Voted
ICCV
2007
IEEE
16 years 1 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 ...
CVPR
2008
IEEE
16 years 1 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...
100
Voted
NIPS
2001
15 years 1 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
107
click to vote
SIAMIS
2010
14 years 6 months ago
2010
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
114
Voted
EMMCVPR
2011
Springer
13 years 11 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...