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