Sciweavers

255 search results - page 27 / 51
» An Efficient Euclidean Distance Transform
Sort
View
STRINGOLOGY
2004
14 years 11 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
14 years 11 months ago
Image registration using genetic algorithms
This paper addresses the image registration problem applying genetic algorithms. The image registration’s objective is the definition of a mapping that best match two set of poi...
Flávio Luiz Seixas, Luiz Satoru Ochi, Aura ...
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 4 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
JEI
2000
134views more  JEI 2000»
14 years 9 months ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
15 years 3 months ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu