255 search results - page 40 / 51 » An Efficient Euclidean Distance Transform |
DEXA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
APPROX
2008
Springer
15 years 9 hour ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
106
click to vote
CVIU
2008
14 years 10 months ago
2008
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
PAMI
2006
14 years 10 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
ER
2008
Springer
14 years 11 months ago
2008
Springer
For various applications there is the need to compare the similarity between two process models. For example, given the as-is and to-be models of a particular business process, we ...