83 search results - page 3 / 17 » Fast Euclidean Distance Transform using a Graph-Search Algor... |
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
IDEAL
2009
Springer
13 years 3 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 (...
JGTOOLS
2006
13 years 5 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
VLDB
2001
ACM
13 years 9 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
CAIP
2009
Springer
13 years 10 months 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 ...