Sciweavers

667 search results - page 64 / 134
» Computably Based Locally Compact Spaces
Sort
View
168
Voted
IROS
2006
IEEE
159views Robotics» more  IROS 2006»
15 years 8 months ago
Multi-Level Surface Maps for Outdoor Terrain Mapping and Loop Closing
— To operate outdoors or on non-flat surfaces, mobile robots need appropriate data structures that provide a compact representation of the environment and at the same time suppo...
Rudolph Triebel, Patrick Pfaff, Wolfram Burgard
109
Voted
CGI
2004
IEEE
15 years 6 months ago
An Efficient Central Path Algorithm for Virtual Navigation
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...
Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Pr...
136
Voted
ACCV
2010
Springer
14 years 9 months ago
Monocular Template-Based Reconstruction of Smooth and Inextensible Surfaces
Abstract. We present different approaches to reconstructing an inextensible surface from point correspondences between an input image and a template image representing a flat refer...
Florent Brunet, Richard I. Hartley, Adrien Bartoli...
160
Voted
CVPR
2012
IEEE
13 years 5 months ago
Point cloud matching based on 3D self-similarity
Point cloud is one of the primitive representations of 3D data nowadays. Despite that much work has been done in 2D image matching, matching 3D points achieved from different pers...
Jing Huang, Suya You
136
Voted
ICPR
2008
IEEE
16 years 4 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios