Sciweavers

19 search results - page 2 / 4
» Optimal algorithms for global optimization in case of unknow...
Sort
View
CVPR
2007
IEEE
14 years 7 months ago
On Constant Focal Length Self-Calibration From Multiple Views
We investigate the problem of finding the metric structure of a general 3D scene viewed by a moving camera with square pixels and constant unknown focal length. While the problem ...
Adrien Bartoli, Alain Crouzil, Benoît Bocqui...
CVPR
2008
IEEE
14 years 7 months ago
Matching non-rigidly deformable shapes across images: A globally optimal solution
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
Thomas Schoenemann, Daniel Cremers
LCPC
1998
Springer
13 years 9 months ago
A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality
We present a cache locality optimization technique that can optimize a loop nest even if the arrays referenced have different layouts in memory. Such a capability is required for a...
Mahmut T. Kandemir, J. Ramanujam, Alok N. Choudhar...
TIP
2010
127views more  TIP 2010»
13 years 3 months ago
Bayesian Compressive Sensing Using Laplace Priors
In this paper we model the components of the compressive sensing (CS) problem, i.e., the signal acquisition process, the unknown signal coefficients and the model parameters for ...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
ESA
2009
Springer
139views Algorithms» more  ESA 2009»
13 years 11 months ago
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc