393 search results - page 9 / 79 » Convex Programming Methods for Global Optimization |
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by estimating a reference shape and a set of rigid transformations gi...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces a novel convex kernel based method for color constancy computation with explicit illuminant parameter estimation. A simple linear render model is adopted and ...
SIAMSC
2008
13 years 7 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...