560 search results - page 19 / 112 » Level-set methods for convex optimization |
190
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
103
click to vote
MOR
2006
15 years 1 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
134
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
3?D shape recovery of non-rigid surfaces from 3?D to 2?D correspondences is an under-constrained problem that requires prior knowledge of the possible deformations. State-of-the-a...
127
click to vote
AAAI
2011
14 years 1 months ago
2011
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...