241 search results - page 5 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
ISSAC
1998
Springer
13 years 12 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n 2 n binary image. We show that the algorithm runs in O(log n...
GIS
2002
ACM
13 years 7 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
IDEAL
2009
Springer
13 years 5 months ago
2009
Springer
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
MCAM
2007
Springer
14 years 1 months ago
2007
Springer
This paper proposes a scheme to detect and locate the players and the ball on the grass playfield in soccer videos. We put forward a shape analysisbased approach to identify the pl...