Sciweavers

57 search results - page 4 / 12
» Closest point search in lattices
Sort
View
DAGSTUHL
2006
13 years 8 months ago
6D SLAM with Cached kd-tree Search
6D SLAM (Simultaneous Localization and Mapping) or 6D Concurrent Localization and Mapping of mobile robots considers six degrees of freedom for the robot pose, namely, the x, y and...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
COMPGEOM
1995
ACM
13 years 11 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein
IJRR
2007
80views more  IJRR 2007»
13 years 7 months ago
Fast Laser Scan Matching using Polar Coordinates
In this paper a novel Polar Scan Matching (PSM) approach is described that works in the laser scanner’s polar coordinate system, therefore taking advantage of the structure of t...
Albert Diosi, Lindsay Kleeman
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
14 years 11 days ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli
NAACL
2004
13 years 8 months ago
Lattice-Based Search for Spoken Utterance Retrieval
Recent work on spoken document retrieval has suggested that it is adequate to take the singlebest output of ASR, and perform text retrieval on this output. This is reasonable enou...
Murat Saraclar, Richard Sproat