83 search results - page 5 / 17 » Fast Euclidean Distance Transform using a Graph-Search Algor... |
161
Voted
VMV
2007
15 years 7 months ago
2007
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
204
click to vote
CVPR
2001
IEEE
16 years 7 months ago
2001
IEEE
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...
146
click to vote
ICPR
2008
IEEE
16 years 7 days ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
176
Voted
IROS
2006
IEEE
15 years 11 months ago
2006
IEEE
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...
202
click to vote
NIPS
2001
15 years 7 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...