241 search results - page 6 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
CAIP
2009
Springer
14 years 10 days ago
2009
Springer
Particle filtering of boundary points is a robust way to estimate lanes. This paper introduces a new lane model in correspondence to this particle filterbased approach, which is ...
IWVF
2001
Springer
14 years 4 days ago
2001
Springer
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
DGCI
2006
Springer
13 years 11 months ago
2006
Springer
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and...
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...