Sciweavers

895 search results - page 45 / 179
» Approximate convex decomposition
Sort
View
SCALESPACE
2009
Springer
15 years 4 months ago
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
Jan Lellmann, Jörg H. Kappes, Jing Yuan, Flor...
ACCV
2007
Springer
15 years 3 months ago
Color Constancy Via Convex Kernel Optimization
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 ...
Xiaotong Yuan, Stan Z. Li, Ran He
ECCV
2008
Springer
15 years 11 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
15 years 4 months ago
Subgradient methods and consensus algorithms for solving convex optimization problems
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
Björn Johansson, Tamás Keviczky, Mikae...
ICML
2007
IEEE
15 years 10 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi