3113 search results - page 114 / 623 » Numerical Methods |
166
click to vote
SIAMIS
2010
14 years 11 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
259
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
148
Voted
MCM
2010
14 years 11 months ago
2010
We consider the electromagnetic detection of hidden moving or oscillating conductive targets. The resulting mathematical problem involves computation of a Doppler shift for an ele...
155
click to vote
JOTA
2011
14 years 7 months ago
2011
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
419
click to vote
Publication
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...