85 search results - page 2 / 17 » Wide Baseline Stereo Matching |
108
click to vote
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a new method for matching line segments between two uncalibrated wide-baseline images. Most current techniques for wide-baseline matching are based on viewpoint invaria...
ICPR
2010
IEEE
15 years 29 days ago
2010
IEEE
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
85
Voted
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, wh...
PAMI
2010
14 years 8 months ago
2010
—In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusi...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a new model to overcome the occlusion problems coming from wide baseline multiple camera stereo. Rather than explicitly modeling occlusions in the matching cos...