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...
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...
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...
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...
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...