150 search results - page 29 / 30 » A Linear Algorithm for Computing the Homography from Conics ... |
KDD
2008
ACM
14 years 6 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
IJCV
2006
13 years 6 months ago
2006
In this paper we address the problem of recovering 3D non-rigid structure from a sequence of images taken with a stereo pair. We have extended existing non-rigid factorization algo...
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
Radiometric variations between input images can seriously
degrade the performance of stereo matching algorithms.
In this situation, mutual information is a very popular
and powe...
LOGCOM
1998
13 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...