83 search results - page 7 / 17 » Fast Euclidean Distance Transform using a Graph-Search Algor... |
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
In this paper, we present a new algorithm of snakes with geometric prior. A method of shape alignment using Fourier coefficients is introduced to estimate the Euclidean transform...
ICDAR
1997
IEEE
14 years 1 months ago
1997
IEEE
An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided int...
101
click to vote
ICDE
1999
IEEE
14 years 11 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 ...
SIGMOD
2001
ACM
14 years 10 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...