Sciweavers

6 search results - page 1 / 2
» Efficient Dense Matching for Textured Scenes using Region Gr...
Sort
View
BMVC
1998
13 years 5 months ago
Efficient Dense Matching for Textured Scenes using Region Growing
We present a simple and efficient dense matching method based on region growing techniques, which can be applied to a wide range of globally textured images like many outdoor scen...
Maxime Lhuillier
ICPR
2000
IEEE
14 years 5 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
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...
ICCV
2005
IEEE
14 years 6 months ago
Creating Efficient Codebooks for Visual Recognition
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and...
Bill Triggs, Frédéric Jurie
ICPR
2004
IEEE
14 years 5 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...