Sciweavers

6 search results - page 1 / 2
» Efficient Dense Matching for Textured Scenes using Region Gr...
Sort
View
105
Voted
BMVC
1998
15 years 11 days 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
85
Voted
ICPR
2000
IEEE
16 years 2 days 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
15 years 2 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...
99
Voted
ICCV
2005
IEEE
16 years 28 days 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
89
Voted
ICPR
2004
IEEE
16 years 3 days 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...