Sciweavers

1688 search results - page 131 / 338
» Computational Perspectives on Map Generalization
Sort
View
ICCV
2009
IEEE
15 years 2 months ago
Matching as a non-cooperative game
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
Andrea Albarelli, Samuel Rota Bulò, Andrea ...
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
15 years 10 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart
ICRA
2009
IEEE
138views Robotics» more  ICRA 2009»
15 years 11 months ago
Which landmark is useful? Learning selection policies for navigation in unknown environments
Abstract— In general, a mobile robot that operates in unknown environments has to maintain a map and has to determine its own location given the map. This introduces significant...
Hauke Strasdat, Cyrill Stachniss, Wolfram Burgard
171
Voted
IVC
2008
138views more  IVC 2008»
15 years 5 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
WOLLIC
2009
Springer
15 years 11 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos