Sciweavers

65 search results - page 5 / 13
» A Convex Approach for Variational Super-Resolution
Sort
View
SIAMCO
2002
89views more  SIAMCO 2002»
13 years 8 months ago
Convexity in Zero-Sum Differential Games
A new approach to two-player zero-sum differential games with convex-concave cost function is presented. It employs the tools of convex and variational analysis. A necessary and s...
Rafal Goebel
EMMCVPR
2011
Springer
12 years 8 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
ICIP
2004
IEEE
14 years 10 months ago
A set theoretic approach to target detection using spectral signature statistics
Pixels in hyperspectral images usually contain spectra from several classifiable objects, so that the recorded pixel is a mixture of the classes. Current methods estimate the prop...
David M. Rouse, H. Joel Trussell
ICCV
2009
IEEE
15 years 1 months ago
Optimizing Parametric Total Variation Models
One of the key factors for the success of recent energy minimization methods is that they seek to compute global solutions. Even for non-convex energy functionals, optimization ...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 1 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker