255 search results - page 19 / 51 » An Efficient Euclidean Distance Transform |
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
ICASSP
2011
IEEE
2011
IEEE
Efficient search of music pitch contours using wavelet transforms and segmented dynamic time warping
14 years 1 months ago
We propose a method of music melody matching based on their “continuous” (or “time-frame-based”) pitch contours. Most previous methods using frame-based contours either ma...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
We investigate how common binary mathematical morphology operators can be adapted so that the size of the structuring element (SE) can vary across the image. We show that when the...
110
click to vote
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
ESA
1994
Springer
15 years 2 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...