Sciweavers

199 search results - page 3 / 40
» Wide-Baseline Image Matching Using Line Signatures
Sort
View
ICPR
2010
IEEE
13 years 11 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...
ICPR
2004
IEEE
14 years 8 months ago
Finding Region Correspondences for Wide Baseline Stereo
This study addresses the problem of finding correspondences for wide baseline stereo. Texture has traditionally been utilised as a single-image cue for 3D shape reconstruction (sh...
Dmitry Chetverikov, Zoltán Megyesi, Zsolt J...
CVPR
2005
IEEE
14 years 9 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
PAMI
2010
202views more  PAMI 2010»
13 years 6 months ago
DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo
—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...
Engin Tola, Vincent Lepetit, Pascal Fua
ICDAR
2003
IEEE
14 years 28 days ago
Investigation of Off-Line Japanese Signature Verification Using a Pattern Matching
This paper deals with an off-line Japanese signature verification using a pattern matching method. An annoying problem encountered in off-line signature verification using a patte...
Katsuhiko Ueda