Sciweavers

35 search results - page 2 / 7
» Finding Region Correspondences for Wide Baseline Stereo
Sort
View
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...
CVPR
2005
IEEE
14 years 6 months ago
Correspondence Expansion for Wide Baseline Stereo
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...
Kevin L. Steele, Parris K. Egbert
CVPR
2001
IEEE
14 years 6 months ago
Geometric Blur for Template Matching
We address the problem of finding point correspondences in images by way of an approach to template matching that is robust under affine distortions. This is achieved by applying ...
Alexander C. Berg, Jitendra Malik
CVPR
2004
IEEE
14 years 6 months ago
Fast Wide Baseline Matching for Visual Navigation
A new and fast way to find local image correspondences for wide baseline image matching is described. The targeted application is visual navigation, e.g. of a semi-automatic wheel...
Luc J. Van Gool, Tinne Tuytelaars, Toon Goedem&eac...
ICIP
2006
IEEE
14 years 6 months ago
A Robust Method for the Estimation of Reliable Wide Baseline Correspondences
In this paper we present a complete method to retrieve reliable correspondences among wide baseline images, that is images of the same scene/object acquired from very different vi...
Francesco Colletto, Marco Marcon, Augusto Sarti, S...