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...
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...
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...
—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...
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...