Sciweavers

393 search results - page 4 / 79
» Convex Programming Methods for Global Optimization
Sort
View
MP
2002
195views more  MP 2002»
13 years 7 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
ECCV
2006
Springer
14 years 9 months ago
Practical Global Optimization for Multiview Geometry
This paper presents a practical method for finding the provably globally optimal solution to numerous problems in projective geometry including multiview triangulation, camera rese...
Sameer Agarwal, Manmohan Krishna Chandraker, Fredr...
CVPR
2008
IEEE
14 years 9 months ago
Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutions
In this work, we introduce a novel implicit representation of shape which is based on assigning to each pixel a probability that this pixel is inside the shape. This probabilistic...
Daniel Cremers, Frank R. Schmidt, Frank Barthel
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
13 years 11 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
CVPR
2008
IEEE
14 years 9 months ago
Globally optimal bilinear programming for computer vision applications
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...
Manmohan Krishna Chandraker, David J. Kriegman