1348 search results - page 69 / 270 » Matching planar maps |
99
Voted
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
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...
106
click to vote
ECCV
2002
Springer
16 years 2 months ago
2002
Springer
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...
100
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— 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...
121
Voted
CVPR
2008
IEEE
15 years 26 days ago
2008
IEEE
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 ...
183
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
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 ...