Sciweavers

1348 search results - page 69 / 270
» Matching planar maps
Sort
View
ICPR
2010
IEEE
14 years 1 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...
ECCV
2002
Springer
14 years 12 months ago
New Techniques for Automated Architectural Reconstruction from Photographs
Abstract. We investigate a strategy for reconstructing of buildings from multiple (uncalibrated) images. In a similar manner to the Facade approach we first generate a coarse piece...
Tomás Werner, Andrew Zisserman
ICRA
2008
IEEE
126views Robotics» more  ICRA 2008»
14 years 4 months ago
Towards detection of orthogonal planes in monocular images of indoor environments
— In this paper, we describe the components of a novel algorithm for the extraction of dominant orthogonal planar structures from monocular images taken in indoor environments. T...
Branislav Micusík, Horst Wildenauer, Markus...
CVPR
2008
IEEE
13 years 10 months ago
Hallucinating 3D facial shapes
This paper focuses on hallucinating a facial shape from a low-resolution 3D facial shape. Firstly, we give a constrained conformal embedding of 3D shape in R2 , which establishes ...
Gang Pan, Song Han, Zhaohui Wu
CVPR
2008
IEEE
15 years 1 days ago
A fast local descriptor for dense matching
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
Engin Tola, Vincent Lepetit, Pascal Fua