560 search results - page 63 / 112 » Level-set methods for convex optimization |
97
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
This paper presents a new method for computing optimal L1
solutions for vision geometry problems, particularly for those
problems of fixed-dimension and of large-scale. Our strat...
140
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
118
click to vote
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
We introduce an optimum watermark embedding technique that satisfies common watermarking requirements such as visual fidelity, sufficient embedding rate, robustness against noise ...
122
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problem...
158
click to vote
TOG
2012
13 years 5 months ago
2012
We present a physically-based system to simulate and control the locomotion of soft body characters without skeletons. We use the finite element method to simulate the deformatio...