38 search results - page 1 / 8 » Noisy colored point set matching |
DAM
2011
12 years 11 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
ICCSA
2007
Springer
13 years 8 months ago
2007
Springer
DAM
2006
13 years 4 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
PKDD
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper presents a technique to improve the data association in the Iterative Closest Point [2] based scan matching. The method is based on a distance-filter constructed on...