690 search results - page 99 / 138 » Dense Admissible Sets |
189
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
158
click to vote
DAM
2010
15 years 6 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
194
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Local image descriptors that are highly discriminative,
computational efficient, and with low storage footprint have
long been a dream goal of computer vision research. In this
...
300
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
220
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...