Sciweavers

55 search results - page 1 / 11
» Quasi-Dense Wide Baseline Matching Using Match Propagation
Sort
View
CVPR
2007
IEEE
14 years 7 months ago
Quasi-Dense Wide Baseline Matching Using Match Propagation
In this paper we propose extensions to the match propagation algorithm which is a technique for computing quasidense point correspondences between two views. The extensions make t...
Juho Kannala, Sami S. Brandt
ICPR
2010
IEEE
13 years 8 months ago
Quasi-Dense Wide Baseline Matching for Three Views
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...
Pekka Koskenkorva, Juho Kannala, Sami Sebastian Br...
ICARCV
2006
IEEE
101views Robotics» more  ICARCV 2006»
13 years 11 months ago
Road Scene Analysis by Stereovision: a Robust and Quasi-Dense Approach
A stereovision method is presented in this paper, to compute reliable and quasi-dense disparity maps of road scenes using in-vehicle cameras. It combines the advantages of the &qu...
Nicolas Hautière, Raphaël Labayrade, M...
ICPR
2004
IEEE
14 years 6 months ago
Affine Propagation for Surface Reconstruction in Wide Baseline Stereo
The problem of dense matching in wide baseline stereo is considered. It is assumed that the scene is formed by piecewise-smooth, Lambertian, textured surfaces and that rectified i...
Dmitry Chetverikov, Zoltán Megyesi
ICCV
2009
IEEE
14 years 10 months ago
Wide-Baseline Image Matching Using Line Signatures
We present a wide-baseline image matching approach based on line segments. Line segments are clustered into local groups according to spatial proximity. Each group is treated as...
Lu Wang, Ulrich Neumann and Suya You