Sciweavers

24 search results - page 1 / 5
» Quasi-Dense Wide Baseline Matching for Three Views
Sort
View
ICPR
2010
IEEE
13 years 7 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
2007
IEEE
14 years 6 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
ICIP
2006
IEEE
14 years 6 months ago
Multi-View Image Registration for Wide-Baseline Visual Sensor Networks
We present a new dense multi-view registration technique for wide-baseline video/images that integrates a parametric optical flowbased approach with a sparse set of feature corres...
Gulcin Caner, A. Murat Tekalp, Gaurav Sharma, Wend...
ICCV
2003
IEEE
14 years 6 months ago
Two-Frame Wide Baseline Matching
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...
Jiangjian Xiao, Mubarak Shah
ICCV
1998
IEEE
14 years 6 months ago
Wide Baseline Stereo Matching
`Invariant regions' are image patches that automatically deform with changing viewpoint as to keep on covering identical physical parts of a scene. Such regions are then desc...
Philip Pritchett, Andrew Zisserman