Sciweavers

42 search results - page 1 / 9
» Robust Dense Matching Using Local and Global Geometric Const...
Sort
View
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
CVPR
2007
IEEE
14 years 6 months ago
Accurate, Dense, and Robust Multi-View Stereopsis
: This paper proposes a novel algorithm for calibrated multi-view stereopsis that outputs a (quasi) dense set of rectangular patches covering the surfaces visible in the input imag...
Yasutaka Furukawa, Jean Ponce
ICRA
2002
IEEE
111views Robotics» more  ICRA 2002»
13 years 9 months ago
Feature-Based Multi-Hypothesis Localization and Tracking for Mobile Robots using Geometric Constraints
In this paper we present a new probabilistic feature-based approach to multi-hypothesis global localization and pose tracking. Hypotheses are generated using a constraintbased sea...
Kai Oliver Arras, José A. Castellanos, Rola...
BMVC
2002
13 years 6 months ago
Invariant Features from Interest Point Groups
This paper approaches the problem of finding correspondences between images in which there are large changes in viewpoint, scale and illumination. Recent work has shown that scale...
Matthew Brown, David G. Lowe
CVPR
2004
IEEE
14 years 6 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis