Sciweavers

1337 search results - page 26 / 268
» Fast computation of distance estimators
Sort
View
ICCSA
2004
Springer
15 years 11 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
16 years 5 days ago
A Lie Algebraic Approach for Consistent Pose Registration for General Euclidean Motion
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
Motilal Agrawal
ICAPR
2009
Springer
16 years 21 days ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
ICIP
2010
IEEE
15 years 4 months ago
Fast and correspondence-less camera motion estimation based on voting mechanism and morton codes
This paper proposes a computationally efficient approach for estimating camera motion based on a voting mechanism that neither relies on explicit feature matching nor RANSAC. In t...
Mauricio Soto Alvarez, Stefano Maludrottu, Carlo S...
DCC
1999
IEEE
15 years 10 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega